Random Paths to Popularity in Two-Sided Matching

We study practically relevant aspects of popularity in two-sided matching where only one side has preferences. A matching is called popular if there does not exist another matching that is preferred by a simple majority. We show that for a matching to be popular it is necessary and sucient that no coalition of size up to 3 decides to exchange their houses by simple majority.We then constructively show that a market where such coalitions meet at random converges to a popular matching whenever it exists.

[1]  Katarína Cechlárová,et al.  House-swapping with divorcing and engaged pairs , 2016, Discret. Appl. Math..

[2]  David Manlove,et al.  Popular Matchings in the Capacitated House Allocation Problem , 2006, ESA.

[3]  Julián Mestre.  Weighted Popular Matchings , 2008, Encyclopedia of Algorithms.

[4]  Felix Brandt,et al.  On Popular Random Assignments , 2013, SAGT.

[5]  Naoyuki Kamiyama,et al.  Popular Matchings with Ties and Matroid Constraints , 2015, SIAM J. Discret. Math..

[6]  Felix Brandt,et al.  Majority Graphs of Assignment Problems and Properties of Popular Random Assignments , 2017, AAMAS.

[7]  TELIKEPALLI KAVITHA,et al.  A Size-Popularity Tradeoff in the Stable Marriage Problem , 2014, SIAM J. Comput..

[8]  H. Young,et al.  Handbook of Game Theory with Economic Applications , 2015 .

[9]  David Manlove,et al.  Matching under Preferences , 2014, Handbook of Computational Social Choice.

[10]  Katarzyna E. Paluch.  Popular and clan-popular b-matchings , 2012, Theor. Comput. Sci..

[11]  Telikepalli Kavitha,et al.  Voting Paths , 2010, SIAM J. Discret. Math..

[12]  Sourav Chakraborty,et al.  Counting Popular Matchings in House Allocation Problems , 2013, CSR.

[13]  Meghana Nasre.  Popular Matchings: Structure and Strategic Issues , 2014, SIAM J. Discret. Math..

[14]  Telikepalli Kavitha,et al.  Popular Matchings in the Stable Marriage Problem , 2011, ICALP.

[15]  David Manlove,et al.  Popular matchings in the weighted capacitated house allocation problem , 2010, J. Discrete Algorithms.

[16]  Telikepalli Kavitha,et al.  Popular Matchings with Two-Sided Preferences and One-Sided Ties , 2015, ICALP.

[17]  I. Good.  A note on condorcet sets , 1971 .

[18]  Telikepalli Kavitha,et al.  Popular mixed matchings , 2009, Theor. Comput. Sci..

[19]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[20]  Yufei Yuan,et al.  Residence exchange wanted: A stable residence exchange problem , 1996 .

[21]  Meghana Nasre,et al.  Popular matchings with variable item copies , 2011, Theor. Comput. Sci..

[22]  Richard Matthew McCutchen.  The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences , 2008, LATIN.

[23]  International Foundation for Autonomous Agents and MultiAgent Systems ( IFAAMAS ) , 2007 .

[24]  Clayton R. Featherstone.  Rank Eciency: Investigating a Widespread Ordinal Welfare Criterion , 2013 .

[25]  A. Roth,et al.  Random paths to stability in two-sided matching , 1990 .

[26]  Martin Hoefer,et al.  Maintaining Near-Popular Matchings , 2015, ICALP.

[27]  Telikepalli Kavitha,et al.  Popularity, Mixed Matchings, and Self-duality , 2017, SODA.

[28]  Telikepalli Kavitha,et al.  Popular edges and dominant matchings , 2015, IPCO.

[29]  David Manlove,et al.  Paired and Altruistic Kidney Donation in the UK , 2015, ACM J. Exp. Algorithmics.

[30]  Naoyuki Kamiyama.  The popular matching and condensation problems under matroid constraints , 2016, J. Comb. Optim..

[31]  R. Zeckhauser,et al.  The Efficient Allocation of Individuals to Positions , 1979, Journal of Political Economy.

[32]  P. Gärdenfors.  Match making: Assignments based on bilateral preferences , 1975 .

[33]  David Manlove,et al.  Popular Matchings in the Marriage and Roommates Problems , 2010, CIAC.

[34]  Telikepalli Kavitha,et al.  Popularity at Minimum Cost , 2010, ISAAC.

[35]  A. Roth,et al.  Two-sided matching , 1990 .

[36]  L. Shapley,et al.  On cores and indivisibility , 1974 .

[37]  Mohammad Mahdian,et al.  Random popular matchings , 2006, EC '06.

[38]  Telikepalli Kavitha,et al.  Optimal popular matchings , 2009, Discret. Appl. Math..

[39]  Ágnes Cseh.  Popular Matchings , 2017 .

[40]  Eric McDermid,et al.  Popular matchings: structure and algorithms , 2011, J. Comb. Optim..