Fully Polynomial-Time Approximation Schemes for Fair Rent Division

References

• [1] Abdulkadiroglu A, Sönmez T, Utku Ünver M (2004) Room assignment-rent division: A market approach. Soc. Choice Welfare 22(3):515–538.Crossref, Google Scholar
• [2] Alkan A (1989) Existence and computation of matching equilibria. Eur. J. Political Econom. 5(2-3):285–296.Crossref, Google Scholar
• [3] Alkan A, Demange G, Gale D (1991) Fair allocation of indivisible goods and criteria of justice. Econometrica 59(4):1023–1039.Crossref, Google Scholar
• [4] Andersson T, Ehlers L, Svensson L-G (2014) Budget balance, fairness, and minimal manipulability. Theorical Econom. 9(3):753–777.Google Scholar
• [5] Aragones E (1995) A derivation of the money rawlsian solution. Soc. Choice Welfare 12(3):267–276.Crossref, Google Scholar
• [6] Arunachaleswaran ER, Barman S, Rathi N (2018) Fully polynomial-time approximation schemes for fair rent division. Preprint, submitted July 11, https://arxiv.org/abs/1807.04163.Google Scholar
• [7] Azrieli Y, Shmaya E (2014) Rental harmony with roommates. J. Econom. Theory 153:128–137.Crossref, Google Scholar
• [8] Brams SJ, Kilgour DM (2001) Competitive fair division. J. Political Econom. 109(2):418–443.Crossref, Google Scholar
• [9] Brams SJ, Taylor AD (1996) Fair Division: From Cake-Cutting to Dispute Resolution (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• [10] Brandt F, Conitzer V, Endris U, Lang J, Procaccia AD (2016) Handbook of Computational Social Choice (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• [11] Daskalakis C, Fabrikant A, Papadimitriou CH (2006) The game world is flat: The complexity of Nash equilibria in succinct games. ICALP Internat. Colloquium on Automata, Languages, and Programming (Springer, Berlin, Heidelberg), 513–524.Crossref, Google Scholar
• [12] Demange G (1982) Strategyproofness in the Assignment Market Game (Laboratoire d’économétrie de l’École Polytechnique).Google Scholar
• [13] Demange G, Gale D (1985) The strategy structure of two-sided matching markets. Econometrica 53(4):873–888.Crossref, Google Scholar
• [14] Deng X, Qi Q, Saberi A (2012) Algorithmic solutions for envy-free cake cutting. Oper. Res. 60(6):1461–1476.Link, Google Scholar
• [15] Foley DK (1967) Resource Allocation and the Public Sector (Yale Economic Essays, New Haven, CT).Google Scholar
• [16] Gal Y, Mash M, Procaccia AD, Zick Y (2017) Which is the fairest (rent division) of them all? J. ACM 64(6):1–22.Crossref, Google Scholar
• [17] Gale D (1960) The Theory of Linear Economic Models (University of Chicago Press, Chicago).Google Scholar
• [18] Green JR, Laffont JJ (1979) Incentives in Public Decision Making (North-Holland).Google Scholar
• [19] Johnson DS, Papadimitriou CH, Yannakakis M (1988) How easy is local search? J. Comput. System Sci. 37(1):79–100.Crossref, Google Scholar
• [20] Knaster B, Kuratowski C, Mazurkiewicz S (1929) Ein beweis des fixpunktsatzes für n-dimensionale simplexe. Fundamenta Math. 14(1):132–137.Crossref, Google Scholar
• [21] Mas-Colell A, Whinston MD, Green JR, et al. (1995) Microeconomic Theory, vol. 1 (Oxford University Press, New York).Google Scholar
• [22] Meunier F, Mulzer W, Sarrabezolles P, Stein Y (2017) The rainbow at the end of the line: a ppad formulation of the colorful carathéodory theorem with applications. Proc. 28th Annual ACM-SIAM Sympos. on Discrete Algorithms (Society for Industrial and Applied Mathematics), 1342–1351.Google Scholar
• [23] Moulin H (2016) Handbook of Computational Social Choice (Cambridge University Press, Cambridge, UK).Google Scholar
• [24] Papadimitriou CH (1994) On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. System Sci. 48(3):498–532.Crossref, Google Scholar
• [25] Procaccia AD, Velez RA, Yu D (2018) Fair rent division on a budget. Proc. 32nd AAAI Conf. on Artificial Intelligence.Google Scholar
• [26] Quinzii M (1984) Core and competitive equilibria with indivisibilities. Internat. J. Game Theory 13(1):41–60.Crossref, Google Scholar
• [27] Shapley LS, Shubik M (1971) The assignment game I: The core. Internat. J. Game Theory 1(1):111–130.Crossref, Google Scholar
• [28] Stromquist W (1980) How to cut a cake fairly. Amer. Math. Monthly 87(8):640–644.Crossref, Google Scholar
• [29] Su FE (1999) Rental harmony: Sperner’s lemma in fair division. Amer. Math. Monthly 106(10):930–942.Crossref, Google Scholar
• [30] Sun N, Yang Z (2001) On fair allocations with indivisibilities. DP No. 1347, Cowles Foundation, Yale University, New Haven.Google Scholar
• [31] Sun N, Yang Z (2003) A general strategy proof fair allocation mechanism. Econom. Lett. 81(1):73–79.Crossref, Google Scholar
• [32] Svensson LG (1983) Large indivisibles: An analysis with respect to price equilibrium and fairness. Econometrica 51(4):939–954.Crossref, Google Scholar
• [33] Varian HR (1974) Equity, envy, and efficiency. J. Econom. Theory 9(1):63–91.Crossref, Google Scholar
• [34] Velez RA (2011) Are incentives against economic justice? J. Econom. Theory 146(1):326–345.Crossref, Google Scholar
• [35] Velez RA (2018) Equitable rent division. ACM Trans. Econom. Comput. 6(2):1–25.Crossref, Google Scholar
• [36] Velez RA (2020) A polynomial algorithm for maxmin and minmax envy-free rent division on a soft budget. Preprint, submitted February 7, https://arxiv.org/abs/2002.02966.Google Scholar