Compromises and Rewards: stable and non-manipulable probabilistic matching

Research output: Contribution to journalJournal articleResearchpeer-review

Documents

Can we reconcile stability with non-manipulability in two-sided matching problems by selecting lotteries over matchings? We parameterize, through sets of utility functions, how ordinal preferences induce preferences over lotteries and develop corresponding notions of ex-ante stability and non-manipulability. For most sets, the properties are incompatible. However, for the set of utility functions with increasing differences, stability and non-manipulability characterize Compromises and Rewards. This novel rule is fundamentally different from the one that has attracted most attention in the literature, Deferred Acceptance. We then derive complementary negative results that show that increasing differences essentially is a necessary condition for the properties to be compatible.

Original languageEnglish
JournalInternational Journal of Game Theory
Volume48
Issue number2
Pages (from-to)365-392
Number of pages28
ISSN0020-7276
DOIs
Publication statusPublished - 2019

    Research areas

  • Compromises, Lottery, Non-manipulability, Rewards, Stability, Two-sided matching

Number of downloads are based on statistics from Google Scholar and www.ku.dk


No data available

ID: 241093830