Secure multiparty computation protocols for stable matching?

ge flag

Are you aware of papers proposing secure multiparty computation protocols for stable matching problems such as Stable Roommates and Stable Marriage problems?

Specifically, I would like the ranking of each party to be kept private and either reveal the whole output to everybody (all the pairings) or just reveal each pairing to the involved parties.

Command Master avatar
in flag
It can be done using a general MPC protocol, but I'm assuming you want something more efficient?
Lorenzo avatar
ge flag
Yes, if it is not available yet, I would like to develop something ad-hoc that is efficient.
br flag

Is this what you were looking for? Secure Stable Matching at Scale by Jack Doerner, David Evans, and abhi shelat.

I sit in a Tesla and translated this thread with Ai:


Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.