Pareto stability in two-sided many-to-many matching with weak preferences

[1]  L. Shapley,et al.  College Admissions and the Stability of Marriage , 1962 .

[2]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[3]  A. Roth.  Stability and Polarization of Interests in Job Matching , 1984 .

[4]  Charles Blair,et al.  The Lattice Structure of the Set of Stable Matchings with Multiple Partners , 1988, Math. Oper. Res..

[5]  Alvin E. Roth,et al.  Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

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

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[8]  W A Wulf,et al.  The collaboratory opportunity. , 1993, Science.

[9]  Robert W. Irving.  Stable Marriage and Indifference , 1994, Discret. Appl. Math..

[10]  A. Roth,et al.  The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design , 1999, The American economic review.

[11]  David Manlove,et al.  Stable Marriage with Incomplete Lists and Ties , 1999, ICALP.

[12]  Michel Balinski,et al.  Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) , 2000, Discret. Appl. Math..

[13]  Ahmet Alkan,et al.  On preferences over subsets and the lattice structure of stable matchings , 2001 .

[14]  David Manlove,et al.  Hard variants of stable marriage , 2002, Theor. Comput. Sci..

[15]  A. Roth.  The Economist as Engineer: Game Theory, Experimentation, and Computation as Tools for Design Economics , 2002 .

[16]  Ahmet Alkan,et al.  A class of multipartner matching markets with a strong lattice structure , 2002 .

[17]  M. Utku Ünver,et al.  Course Bidding at Business Schools , 2007 .

[18]  Atila Abdulkadiroglu,et al.  School Choice: A Mechanism Design Approach , 2003 .

[19]  Jordi Massó,et al.  An algorithm to compute the full set of many-to-many stable matchings , 2004, Math. Soc. Sci..

[20]  Varun S. Malhotra.  On the Stability of Multiple Partner Stable Marriages with Ties , 2004, ESA.

[21]  F. Echenique,et al.  A Theory of Stability in Many-to-Many Matching Markets , 2004 .

[22]  M. Utku Ünver,et al.  Credible group stability in many-to-many matching problems , 2006, J. Econ. Theory.

[23]  Bettina Klaus,et al.  Paths to stability for matching markets with couples , 2007, Games Econ. Behav..

[24]  Kurt Mehlhorn,et al.  Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem , 2007, TALG.

[25]  M. Utku Ünver,et al.  Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration , 2006, Int. J. Game Theory.

[26]  Aytek Erdil,et al.  What's the Matter with Tie-Breaking? Improving Efficiency in School Choice , 2008 .

[27]  Eric McDermid.  A 3/2-Approximation Algorithm for General Stable Marriage , 2009, ICALP.

[28]  Parag A. Pathak,et al.  Strategy-Proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match , 2009 .

[29]  Ning Chen,et al.  Strongly Stable Assignment , 2010, ESA.

[30]  Onur Kesten.  School Choice with Consent , 2010 .

[31]  Eric Budish,et al.  The Multi-Unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard , 2010 .

[32]  Marilda Sotomayor,et al.  The pareto-stability concept is a natural solution concept for discrete matching markets with indifferences , 2011, Int. J. Game Theory.

[33]  A. Roth,et al.  The Handbook of Market Design , 2013 .

[34]  Fuhito Kojima,et al.  Efficient resource allocation under multi-unit demand , 2013, Games Econ. Behav..

[35]  Naoyuki Kamiyama,et al.  A New Approach to the Pareto Stable Matching Problem , 2012, Math. Oper. Res..

[36]  F. Klijn,et al.  A Many-to-Many 'Rural Hospital Theorem' , 2014 .

[37]  Scott Duke Kominers,et al.  Matching with Slot-Specific Priorities: Theory , 2016 .

[38]  Eduardo M. Azevedo,et al.  A Supply and Demand Framework for Two-Sided Matching Markets , 2014, Journal of Political Economy.

[39]  David Manlove,et al.  Pareto Optimal Matchings in Many-to-Many Markets with Ties , 2015, Theory of Computing Systems.

[40]  Aytek Erdil,et al.  Two-sided matching with indifferences , 2017, J. Econ. Theory.

[41]  Martin Bichler,et al.  Matching with indifferences: A comparison of algorithms in the context of course allocation , 2017, Eur. J. Oper. Res..

[42]  Chi-Kit Lam,et al.  Group Strategyproof Pareto-Stable Marriage with Indifferences via the Generalized Assignment Game , 2017, SAGT.

[43]  Parag A. Pathak,et al.  Reserve Design: Unintended Consequences and the Demise of Boston’s Walk Zones , 2018, Journal of Political Economy.

[44]  Mengling Li,et al.  Ties matter: Improving efficiency in course allocation by allowing ties , 2020, Journal of Economic Behavior & Organization.