Fetching the paper…
Reading the bibliography…
We consider fair allocation of indivisible items in a model with goods, chores, and copies, as a unified framework for studying: (1)~the existence of EFX and other solution concepts for goods with copies; (2)~the existence of EFX and other solution concepts for chores.
Scalable Fair Division for ’At Most One’ Preferences
Kroer, C.; and Peysakhovich, A. 2019 · 1909
Earlier work this paper cites.
Competitive Equilibrium with Generic Budgets: Beyond Additive
Babaioff, M.; Nisan, N.; and Talgam-Cohen, I. 2019 · 1911
Earlier work this paper cites.
On Approximately Fair Allocations of Indivisible Goods
Lipton, R. J.; Markakis, E.; Mossel, E.; and Saberi, A. 2004 · 2004
Earlier work this paper cites.
Chaudhury, B. R.; Garg, J.; McGlaughlin, P.; and Mehta, R. 2020 · 2008
Earlier work this paper cites.
The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes
Budish, E. 2011 · 2011
Earlier work this paper cites.
When Can the Maximin Share Guarantee Be Guaranteed?
Kurokawa, D.; Procaccia, A.; and Wang, J. 2016 · 2016
Earlier work this paper cites.
Algorithms for Max-Min Share Fair Allocation of Indivisible Chores
Aziz, H.; Rauchecker, G.; Schryen, G.; and Walsh, T. 2017 · 2017
Earlier work this paper cites.
Approximation Algorithms for Maximin Fair Division
Barman, S.; and Krishnamurthy, S. K. 2017 · 2017
Earlier work this paper cites.
Competitive division of a mixed manna
Bogomolnaia, A.; Moulin, H.; Sandomirskiy, F.; and Yanovskaya, E. 2017 · 2017
Cited alongside, same era.
Comparing Approximate Relaxations of Envy-Freeness
Amanatidis, G.; Birmpas, G.; and Markakis, E. 2018 · 2018
Cited alongside, same era.
Groupwise Maximin Fair Allocation of Indivisible Goods
Barman, S.; Biswas, A.; Krishnamurthy, S.; and Narahari, Y. 2018 · 2018
Cited alongside, same era.
Fair Division Under Cardinality Constraints
Biswas, A.; and Barman, S. 2018 · 2018
Cited alongside, same era.
Fair Allocation of Indivisible Goods: Improvements and Generalizations
Ghodsi, M.; Hajiaghayi, M.; Seddighin, M.; Seddighin, S.; and Yami, H. 2018 · 2018
Cited alongside, same era.
Fair Allocation of Indivisible Goods and Chores
Aziz, H.; Caragiannis, I.; Igarashi, A.; and Walsh, T. 2019 · 2019
Cited alongside, same era.
EFX Exists for Three Agents
Chaudhury, B. R.; Garg, J.; and Mehlhorn, K. 2020 · 2020
Later among the works it cites.
An Improved Approximation Algorithm for Maximin Shares
Garg, J.; and Taki, S. 2020 · 2020
Later among the works it cites.
Fair-Share Allocations for Agents with Arbitrary Entitlements
Babaioff, M.; Ezra, T.; and Feige, U. 2021 · 2021
Closest in time.
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
Bhaskar, U.; Sricharan, A. R.; and Vaish, R. 2021 · 2021
Closest in time.
On Fair Division under Heterogeneous Matroid Constraints
Dror, A.; Feldman, M.; and Segal-Halevi, E. 2021 · 2021
Closest in time.
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores
Huang, X.; and Lu, P. 2021 · 2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Matroid Constrained Fair Allocation Problem
Biswas, A.; and Barman, S. 2019 · 2019
Cited alongside, same era.
The unreasonable fairness of maximum Nash welfare
Caragiannis, I.; Kurokawa, D.; Moulin, H.; Procaccia, A. D.; Shah, N.; and Wang, J. 2019 · 2019
Cited alongside, same era.
On the PTAS for Maximin Shares in an Indivisible Mixed Manna
Kulkarni, R.; Mehta, R.; and Taki, S. 2021 · 2021
Closest in time.
Strategy-Proof Exchange under Trichotomous Preferences
Manjunath, V.; and Westkamp, A. 2021 · 2021
Closest in time.