Fetching the paper…
Reading the bibliography…
We consider the problem of fairly and efficiently allocating indivisible items (goods or bads) under capacity constraints.
Welfare economics and existence of an equilibrium for a competitive economy
Takashi Negishi. 1960 · 1960
Earlier work this paper cites.
Two problems in the theory of fairness
Hal R Varian. 1976 · 1976
Earlier work this paper cites.
Fair division of a measurable space
Dietrich Weller. 1985 · 1985
Earlier work this paper cites.
Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms
Michael L. Fredman and Robert Endre Tarjan. 1987 · 1987
Earlier work this paper cites.
Fair Division: From cake-cutting to dispute resolution
Steven John Brams and Alan D Taylor. 1996 · 1996
Earlier work this paper cites.
On approximately fair allocations of indivisible goods. In Proceedings of the 5th ACM Conference on Electronic Commerce . 125–131
Richard J Lipton, Evangelos Markakis, Elchanan Mossel, and Amin Saberi. 2004 · 2004
Earlier work this paper cites.
Fair division and collective welfare
Hervé Moulin. 2004 · 2004
Earlier work this paper cites.
Mathematics and democracy: Designing better voting and fair-division procedures
Steven J Brams. 2007 · 2007
Earlier work this paper cites.
Strategic divide and choose
Antonio Nicolò and Yan Yu. 2008 · 2008
Earlier work this paper cites.
The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes
Eric Budish. 2011 · 2011
Earlier work this paper cites.
The undercut procedure: an algorithm for the envy-free division of indivisible items
Steven J Brams, D Marc Kilgour, and Christian Klamler. 2012 · 2012
Earlier work this paper cites.
Two-person fair division of indivisible items: An efficient, envy-free algorithm
Steven J Brams, Marc Kilgour, and Christian Klamler. 2014 · 2014
Earlier work this paper cites.
A note on the undercut procedure
Haris Aziz. 2015 · 2015
Earlier work this paper cites.
Fair Allocation of Indivisible Goods
Sylvain Bouveret, Yann Chevaleyre, and Nicolas Maudet. 2016 · 2016
Earlier work this paper cites.
Allocating indivisible items in categorized domains. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence . 359–365
Erika Mackin and Lirong Xia. 2016 · 2016
Cited alongside, same era.
Divide and compromise
Antonio Nicolò and Rodrigo A Velez. 2017 · 2017
Cited alongside, same era.
Finding fair and efficient allocations. In Proceedings of the 2018 ACM Conference on Economics and Computation . 557–574
Siddharth Barman, Sanath Kumar Krishnamurthy, and Rohit Vaish. 2018 · 2018
Cited alongside, same era.
Fair Division Under Cardinality Constraints.. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence . 91–97
Arpita Biswas and Siddharth Barman. 2018 · 2018
Cited alongside, same era.
Two-player fair division of indivisible items: Comparison of algorithms
D Marc Kilgour and Rudolf Vetschera. 2018 · 2018
Cited alongside, same era.
The fairness of leximin in allocation of indivisible chores
Xingyu Chen and Zijie Liu. 2020 · 2020
Later among the works it cites.
Fair division with multiple pieces
Kathryn Nyman, Francis Edward Su, and Shira Zerbib. 2020 · 2020
Later among the works it cites.
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
Umang Bhaskar, AR Sricharan, and Rohit Vaish. 2021 · 2021
Later among the works it cites.
On Fair Division under Heterogeneous Matroid Constraints. In Proceedings of the AAAI Conference on Artificial Intelligence . 5312–5320
Amitay Dror, Michal Feldman, and Erel Segal-Halevi. 2021 · 2021
Later among the works it cites.
Unified Fair Allocation of Goods and Chores via Copies
Yotam Gafni, Xin Huang, Ron Lavi, and Inbal Talgam-Cohen. 2021 · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Martin Aleksandrov and Toby Walsh. 2019 · 2019
Cited alongside, same era.
On the proximity of markets with integral equilibria. In Proceedings of the AAAI Conference on Artificial Intelligence , Vol. 33. 1748–1755
Siddharth Barman and Sanath Kumar Krishnamurthy. 2019 · 2019
Cited alongside, same era.
The unreasonable fairness of maximum Nash welfare
Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D Procaccia, Nisarg Shah, and Junxing Wang. 2019 · 2019
Cited alongside, same era.
Mechanism Design for Multi-Type Housing Markets with Acceptable Bundles. In Proceedings of the AAAI Conference on Artificial Intelligence . 2165–2172
Sujoy Sikdar, Sibel Adalı, and Lirong Xia. 2019 · 2019
Cited alongside, same era.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
Haris Aziz, Hervé Moulin, and Fedor Sandomirskiy. 2020 · 2020
Cited alongside, same era.
Envy-free relaxations for goods, chores, and mixed items
Kristóf Bérczi, Erika R Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, and Kazuhisa Makino. 2020 · 2020
Cited alongside, same era.
One Dollar Each Eliminates Envy. In Proceedings of the 21st ACM Conference on Economics and Computation . 23–39
Johannes Brustle, Jack Dippel, Vishnu V. Narayan, Mashbat Suzuki, and Adrian Vetta. 2020 · 2020
Cited alongside, same era.
Later among the works it cites.
Guaranteeing Half-Maximin Shares Under Cardinality Constraints
Halvard Hummel and Magnus Lie Hetland. 2021 · 2021
Later among the works it cites.
Constraints in fair division
Warut Suksompong. 2021 · 2021
Later among the works it cites.
Xiaowei Wu, Bo Li, and Jiarui Gan. 2021 · 2021
Later among the works it cites.
Fair allocation of indivisible goods and chores
Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi, and Toby Walsh. 2022 · 2022
Closest in time.
Almost envy-free allocations with connected bundles
Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, and William S Zwicker. 2022 · 2022
Closest in time.
Improving Fairness and Efficiency Guarantees for Allocating Indivisible Chores
Jugal Garg, Aniket Murhekar, and John Qin. 2022b · 2022
Closest in time.
Playing Divide-and-Choose Given Uncertain Preferences
Jamie Tucker-Foltz and Richard Zeckhauser. 2022 · 2022
Closest in time.
Pareto-optimal allocation of indivisible goods with connectivity constraints. In Proceedings of the AAAI conference on artificial intelligence . 2045–2052
Ayumi Igarashi and Dominik Peters. 2019 · 2052
Closest in time.