Fetching the paper…
Reading the bibliography…
We study the fair allocation of undesirable indivisible items, or chores.
Resource Allocation and the Public Sector
Duncan Foley · 1967
Earlier work this paper cites.
On Cores and Indivisibility
Lloyd Shapley and Herbert Scarf · 1974
Earlier work this paper cites.
aha! Insight
Martin Gardner · 1978
Earlier work this paper cites.
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael R. Garey and David S. Johnson · 1979
Earlier work this paper cites.
How to Cut a Cake Fairly
Walter Stromquist · 1980
Earlier work this paper cites.
Splitting Necklaces
Noga Alon · 1987
Earlier work this paper cites.
On the Fair Allocation of Indivisible Goods
Eric S Maskin · 1987
Earlier work this paper cites.
Fair Allocation of Indivisible Goods and Criteria of Justice
Ahmet Alkan, Gabrielle Demange, and David Gale · 1991
Earlier work this paper cites.
A Derivation of the Money Rawlsian Solution
Enriqueta Aragones · 1995
Earlier work this paper cites.
Fair Division: From Cake-Cutting to Dispute Resolution
Steven J Brams and Alan D Taylor · 1996
Earlier work this paper cites.
Cake-Cutting Algorithms: Be Fair If You Can
Jack Robertson and William Webb · 1998
Earlier work this paper cites.
Rental Harmony: Sperner’s Lemma in Fair Division
Francis Edward Su · 1999
Earlier work this paper cites.
An Algorithm for Envy-Free Allocations in an Economy with Indivisible Objects and Money
Flip Klijn · 2000
Earlier work this paper cites.
Bidding for Envy-Freeness: A Procedural Approach to N-Player Fair-Division Problems
Claus-Jochen Haake, Matthias G Raith, and Francis Edward Su · 2002
Earlier work this paper cites.
Envy-Free and Pareto Efficient Allocations in Economies with Indivisible Goods and Money
Marc Meertens, Jos Potters, and Hans Reijnierse · 2002
Earlier work this paper cites.
Fair Chore Division for Climate Change
Martino Traxler · 2002
Earlier work this paper cites.
On Approximately Fair Allocations of Indivisible Goods
Richard J Lipton, Evangelos Markakis, Elchanan Mossel, and Amin Saberi · 2004
Earlier work this paper cites.
Introduction to Algorithms, Third Edition
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein · 2009
Earlier work this paper cites.
N-Person Envy-Free Chore Division
Elisha Peterson and Francis Edward Su · 2009
Earlier work this paper cites.
Finding Approximate Competitive Equilibria: Efficient and Fair Course Allocation
Abraham Othman, Tuomas Sandholm, and Eric Budish · 2010
Earlier work this paper cites.
The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
Eric Budish · 2011
Earlier work this paper cites.
Optimal Envy-Free Cake Cutting
Yuga J Cohler, John K Lai, David C Parkes, and Ariel D Procaccia · 2011
Earlier work this paper cites.
How to Cut a Cake Before the Party Ends
David Kurokawa, John K Lai, and Ariel D Procaccia · 2013
Earlier work this paper cites.
Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations
Haris Aziz and Chun Ye · 2014
Cited alongside, same era.
Fair Assignment of Indivisible Objects under Ordinal Preferences
Haris Aziz, Serge Gaspers, Simon Mackenzie, and Toby Walsh · 2015
Cited alongside, same era.
Spliddit: Unleashing Fair Division Algorithms
Jonathan Goldman and Ariel D Procaccia · 2015
Cited alongside, same era.
Cake Cutting Algorithms
Ariel D Procaccia · 2015
Cited alongside, same era.
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents
Haris Aziz and Simon Mackenzie · 2016
Cited alongside, same era.
Algorithms for Max-Min Share Fair Allocation of Indivisible Chores
Haris Aziz, Gerhard Rauchecker, Guido Schryen, and Toby Walsh · 2017
Cited alongside, same era.
Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination
Georgios Amanatidis, Evangelos Markakis, and Apostolos Ntokos · 2020
Closest in time.
Sergey Avvakumov and Roman Karasev · 2020
Closest in time.
A Polynomial-Time Algorithm for Computing a Pareto Optimal and Almost Proportional Allocation
Haris Aziz, Hervé Moulin, and Fedor Sandomirskiy · 2020
Closest in time.
Fair Cake Division Under Monotone Likelihood Ratios
Siddharth Barman and Nidhi Rathi · 2020
Closest in time.
The Price of Quota-based Diversity in Assignment Problems
Nawal Benabbou, Mithun Chakraborty, Xuan-Vinh Ho, Jakub Sliwinski, and Yair Zick · 2020
Closest in time.
Finding Fair and Efficient Allocations When Valuations Don’t Add Up
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
Eric Budish, Gérard P Cachon, Judd B Kessler, and Abraham Othman · 2017
Cited alongside, same era.
Almost Envy Freeness and Welfare Efficiency in Fair Division with Goods or Bads
Martin Aleksandrov · 2018
Cited alongside, same era.
Fair Allocation of Combinations of Indivisible Goods and Chores
Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi, and Toby Walsh · 2018
Cited alongside, same era.
Finding Fair and Efficient Allocations
Siddharth Barman, Sanath Kumar Krishnamurthy, and Rohit Vaish · 2018
Cited alongside, same era.
Greedy Algorithms for Maximizing Nash Social Welfare
Siddharth Barman, Sanath Kumar Krishnamurthy, and Rohit Vaish · 2018
Cited alongside, same era.
Envy-Free Chore Division For an Arbitrary Number of Agents
Sina Dehghani, Alireza Farhadi, MohammadTaghi HajiAghayi, and Hadi Yami · 2018
Cited alongside, same era.
Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, and Yair Zick · 2020
Closest in time.
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
Closest in time.
One Dollar Each Eliminates Envy
Johannes Brustle, Jack Dippel, Vishnu V Narayan, Mashbat Suzuki, and Adrian Vetta · 2020
Closest in time.
Computing Envy-Freeable Allocations with Limited Subsidies
Ioannis Caragiannis and Stavros Ioannidis · 2020
Closest in time.
The Fairness of Leximin in Allocation of Indivisible Chores
Xingyu Chen and Zijie Liu · 2020
Closest in time.
Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation
Rupert Freeman, Nisarg Shah, and Rohit Vaish · 2020
Closest in time.
Equitable Allocations of Indivisible Chores
Rupert Freeman, Sujoy Sikdar, Rohit Vaish, and Lirong Xia · 2020
Closest in time.
Fair Division through Information Withholding
Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Hejun Wang, and Lirong Xia · 2020
Closest in time.
Parag A Pathak, Tayfun Sönmez, M Utku Ünver, and M Bumin Yenmez · 2020
Closest in time.
Competitive Equilibrium for Almost All Incomes: Existence and Fairness
Erel Segal-Halevi · 2020
Closest in time.
Achieving Envy-freeness and Equitability with Monetary Transfers
Haris Aziz · 2021
Closest in time.
Fair Division of Mixed Divisible and Indivisible Goods
Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, and Xinhang Lu · 2021
Closest in time.
Maximin Fairness with Mixed Divisible and Indivisible Goods
Xiaohui Bei, Shengxin Liu, Xinhang Lu, and Hongao Wang · 2021
Closest in time.
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
Umang Bhaskar, A. R. Sricharan, and Rohit Vaish · 2021
Closest in time.
Fair and Efficient Allocations under Subadditive Valuations
Bhaskar Ray Chaudhury, Jugal Garg, and Ruta Mehta · 2021
Closest in time.
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores
Xin Huang and Pinyan Lu · 2021
Closest in time.
Approximating Maximin Shares with Mixed Manna
Rucha Kulkarni, Ruta Mehta, and Setareh Taki · 2021
Closest in time.