Strategy-proof and envy-free mechanisms for house allocation

Abdulkadiroğlu, 1998, Random serial dictatorship and the core from random endowments in house allocation problems, Econometrica, 66, 689, 10.2307/2998580 Abdulkadiroğlu, 2003, School choice: a mechanism design approach, Am. Econ. Rev., 93, 729, 10.1257/000282803322157061 Azevedo, 2019, Strategy-proofness in the large, Rev. Econ. Stud., 86, 81 Bade, 2016, Fairness and group-strategyproofness clash in assignment problems, J. Econ. Theory, 165, 257, 10.1016/j.jet.2016.04.012 Basteck, 2018, Fair solutions to the random assignment problem, J. Math. Econ., 79, 163, 10.1016/j.jmateco.2018.02.006 Basteck, 2023, Strategy-proof and envy-free random assignment, J. Econ. Theory, 209, 10.1016/j.jet.2023.105618 Birkhoff, 1946, Three observations on linear algebra, Univ. Nac. Tacuman, Rev. Ser. A, 5, 147 Bogomolnaia, 2012, Probabilistic assignment of objects: characterizing the serial rule, J. Econ. Theory, 147, 2072, 10.1016/j.jet.2012.05.013 Bogomolnaia, 2001, A new solution to the random assignment problem, J. Econ. Theory, 100, 295, 10.1006/jeth.2000.2710 Budish, 2011, The combinatorial assignment problem: approximate competitive equilibrium from equal incomes, J. Polit. Econ., 119, 1061, 10.1086/664613 Budish, 2013, Designing random allocation mechanisms: theory and applications, Am. Econ. Rev., 103, 585, 10.1257/aer.103.2.585 Chambers, 2004, Consistency in the probabilistic assignment model, J. Math. Econ., 40, 953, 10.1016/j.jmateco.2003.10.004 Che, 2010, Asymptotic equivalence of probabilistic serial and random priority mechanisms, Econometrica, 78, 1625, 10.3982/ECTA8354 Chen, 2002, Improving efficiency of on-campus housing: an experimental study, Am. Econ. Rev., 92, 1669, 10.1257/000282802762024728 Foley, 1967, Resource allocation and the public sector, Yale Econ. Essays, 7, 45 Gale, 1987 Harless, 2019, Efficient rules for probabilistic assignment, J. Math. Econ., 84, 107, 10.1016/j.jmateco.2019.07.006 Harless, 2022, Efficient mixtures of priority rules for assigning objects, Games Econ. Behav., 132, 73, 10.1016/j.geb.2021.11.009 Hashimoto, 2014, Two axiomatic approaches to the probabilistic serial mechanism, Theor. Econ., 9, 253, 10.3982/TE1010 Heo, 2014, The extended serial correspondence on a rich preference domain, Int. J. Game Theory, 43, 439, 10.1007/s00182-013-0388-4 Heo, 2014, Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization, J. Math. Econ., 54, 40, 10.1016/j.jmateco.2014.08.003 Heo, 2015, A characterization of the extended serial correspondence, J. Math. Econ., 59, 102, 10.1016/j.jmateco.2015.05.003 Hylland, 1979, The efficient allocation of individuals to positions, J. Polit. Econ., 87, 293, 10.1086/260757 Jackson, 2007, Envy-freeness and implementation in large economies, Rev. Econ. Des., 11, 185 Kesten, 2009, Why do popular mechanisms lack efficiency in random environments?, J. Econ. Theory, 144, 2209, 10.1016/j.jet.2009.05.003 Kesten, 2017, Efficient lottery design, Soc. Choice Welf., 48, 31, 10.1007/s00355-016-0978-8 Kojima, 2010, Incentives in the probabilistic serial mechanism, J. Econ. Theory, 145, 106, 10.1016/j.jet.2009.09.002 Liu, 2016, Ordinal efficiency, fairness, and incentives in large markets Martini, 2016, Strategy-proof and fair assignment is wasteful, Games Econ. Behav., 98, 172, 10.1016/j.geb.2016.06.007 Mennle, 2014, An axiomatic approach to characterizing and relaxing strategyproofness of one-sided matching mechanisms, 37 Mennle, 2021, Partial strategyproofness: relaxing strategyproofness for the random assignment problem, J. Econ. Theory, 191, 10.1016/j.jet.2020.105144 Moulin, 2019, Fair division in the Internet age, Annu. Rev. Econ., 11, 407, 10.1146/annurev-economics-080218-025559 Muller, 1977, The equivalence of strong positive association and strategy-proofness, J. Econ. Theory, 14, 412, 10.1016/0022-0531(77)90140-5 Nesterov, 2017, Fairness and efficiency in strategy-proof object allocation mechanisms, J. Econ. Theory, 170, 145, 10.1016/j.jet.2017.05.004 Noda, 2018 Pápai, 2000, Strategyproof assignment by hierarchical exchange, Econometrica, 68, 1403, 10.1111/1468-0262.00166 Pycia, 2017, Incentive compatible allocation and exchange of discrete resources, Theor. Econ., 12, 287, 10.3982/TE2201 Robertson, 1998 Roth, 2005, Pairwise kidney exchange, J. Econ. Theory, 125, 151, 10.1016/j.jet.2005.04.004 Satterthwaite, 1981, Strategy-proof allocation mechanisms at differentiable points, Rev. Econ. Stud., 48, 587, 10.2307/2297198 Shapley, 1974, On cores and indivisibility, J. Math. Econ., 1, 23, 10.1016/0304-4068(74)90033-0 Edward Su, 1999, Rental harmony: Sperner's lemma in fair division, Am. Math. Mon., 106, 930, 10.1080/00029890.1999.12005142 Svensson, 1994, Queue allocation of indivisible goods, Soc. Choice Welf., 11, 323, 10.1007/BF00183301 Svensson, 1999, Strategy-proof allocation of indivisible goods, Soc. Choice Welf., 16, 557, 10.1007/s003550050160 von Neumann, 1953, A certain zero-sum two-person game equivalent to the optimal assignment problem, 5 Zhang, 2019, Efficient and fair assignment mechanisms are strongly group manipulable, J. Econ. Theory, 180, 167, 10.1016/j.jet.2018.12.005 Zhou, 1990, On a conjecture by Gale about one-sided matching problems, J. Econ. Theory, 52, 123, 10.1016/0022-0531(90)90070-Z