Access the full text.
Sign up today, get DeepDyve free for 14 days.
Erel Segal-Halevi (2018)
Fair multi-cake cuttingDiscret. Appl. Math., 291
Halvard Hummel, Magnus Hetland (2021)
Fair allocation of conflicting itemsAutonomous Agents and Multi-Agent Systems, 36
Paul Goldberg, Alexandros Hollender, Warut Suksompong (2019)
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
Anna Bogomolnaia, H. Moulin, Fedor Sandomirskiy, E. Yanovskaya (2017)
Competitive Division of a Mixed MannaNational Research University Higher School of Economics Research Paper Series
C. Leiserson, T. Schardl, Warut Suksompong (2015)
Upper Bounds on Number of Steals in Rooted TreesTheory of Computing Systems, 58
Erel Segal-Halevi (2017)
Fairly Dividing a Cake after Some Parts Were Burnt in the Oven
J. Edmonds, K. Pruhs (2006)
Cake cutting really is not a piece of cake
Mithun Chakraborty, Warut Suksompong, Yair Zick (2019)
Weighted Envy-freeness in Indivisible Item AllocationACM Transactions on Economics and Computation (TEAC), 9
Manurangsi, P., Suksompong, W. (2017)
Asymptotic existence of fair divisions for groupsMathematical Social Sciences, 89
Eshwar Arunachaleswaran, R. Gopalakrishnan (2018)
The Price of Indivisibility in Cake CuttingArXiv, abs/1801.08341
H. Aziz, I. Caragiannis, Ayumi Igarashi, T. Walsh (2019)
Fair allocation of indivisible goods and choresAutonomous Agents and Multi-Agent Systems, 36
Halvard Hummel, Magnus Hetland (2022)
Guaranteeing Half-Maximin Shares Under Cardinality ConstraintsArXiv, abs/2106.07300
S. Brams, Alan Taylor (1996)
Fair Division: From Cake-Cutting to Dispute Resolution
Hummel, H., Hetland, M. L. (2021a)
Fair allocation of conflicting itemsCoRR abs/2104.06280.
M. Kyropoulou, Warut Suksompong, Alexandros Voudouris (2019)
Almost Envy-Freeness in Group Resource Allocation
F. Su (1999)
Rental Harmony: Sperner's Lemma in Fair DivisionAmerican Mathematical Monthly, 106
Hadi Hosseini, Ayumi Igarashi, Andrew Searns (2020)
Fair Division of Time: Multi-layered Cake Cutting
Nisarg Shah (2017)
SplidditXRDS: Crossroads, The ACM Magazine for Students, 24
E. Elkind, Erel Segal-Halevi, Warut Suksompong (2021)
Keep Your Distance: Land Division With SeparationComput. Geom., 113
Simina Brânzei, N. Nisan (2017)
The Query Complexity of Cake CuttingArXiv, abs/1705.02946
Vittorio Bilò, I. Caragiannis, M. Flammini, Ayumi Igarashi, G. Monaco, Dominik Peters, Cosimo Vinci, W. Zwicker (2018)
Almost Envy-Free Allocations with Connected BundlesArXiv, abs/1808.09406
Jonathan Goldman, A. Procaccia (2015)
Spliddit: unleashing fair division algorithmsSIGecom Exch., 13
L. Gourvès, J. Monnot, Lydia Tlilane (2014)
Near Fairness in Matroids
Ayumi Igarashi, Dominik Peters (2018)
Pareto-Optimal Allocation of Indivisible Goods with Connectivity ConstraintsArXiv, abs/1811.04872
Amitay Dror, M. Feldman, Erel Segal-Halevi (2020)
On Fair Division under Heterogeneous Matroid ConstraintsArXiv, abs/2010.07280
Erel Segal-Halevi, S. Nitzan, A. Hassidim, Y. Aumann (2016)
Envy-Free Division of LandMath. Oper. Res., 45
H. Moulin (2003)
Fair division and collective welfare
Markakis, E. (2017)
Approximation algorithms and hardness results for fair divisionTrends in Computational Social Choice, 12
Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, Xinhang Lu (2019)
Fair Division of Mixed Divisible and Indivisible Goods
Ágnes Cseh, T. Fleiner (2017)
The Complexity of Cake Cutting with Unequal SharesACM Transactions on Algorithms (TALG), 16
Ayumi Igarashi, W. Zwicker (2021)
Fair division of graphs and of tangled cakesMathematical Programming
S. Bouveret, K. Cechlárová, E. Elkind, Ayumi Igarashi, Dominik Peters (2017)
Fair Division of a GraphArXiv, abs/1705.10239
R. Lipton, E. Markakis, Elchanan Mossel, A. Saberi (2004)
On approximately fair allocations of indivisible goods
Alireza Farhadi, M. Hajiaghayi, M. Ghodsi, Sébastien Lahaie, David Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami (2017)
Fair Allocation of Indivisible Goods to Asymmetric AgentsJ. Artif. Intell. Res., 64
Xiaotie Deng, Qi Qi, A. Saberi (2012)
Algorithmic Solutions for Envy-Free Cake CuttingOper. Res., 60
A. Procaccia (2016)
Cake Cutting Algorithms
E. Elkind, Erel Segal-Halevi, Warut Suksompong (2021)
Graphical Cake Cutting via Maximin ShareArXiv, abs/2105.04755
Nisarg Shah (2017)
Spliddit: two years of making the world fairerACM Crossroads Student Magazine, 24
Zhentao Li, A. Vetta (2018)
The Fair Division of Hereditary Set SystemsACM Transactions on Economics and Computation (TEAC), 9
S. Bouveret, K. Cechlárová, Julien Lesca (2018)
Chore division on a graphAutonomous Agents and Multi-Agent Systems, 33
Neeldhara Misra, Chinmay Sonar, P. Vaidyanathan, Rohit Vaish (2021)
Equitable Division of a PathArXiv, abs/2101.09794
Warut Suksompong (2017)
Fairly Allocating Contiguous Blocks of Indivisible ItemsDiscret. Appl. Math., 260
T. Walsh (2020)
Fair Division: The Computer Scientist's PerspectiveArXiv, abs/2005.04855
W. Thomson (2016)
Introduction to the Theory of Fair Allocation
Siddharth Barman, Arpita Biswas (2018)
Fair Division Under Cardinality Constraints
Ayumi Igarashi, Frédéric Meunier (2021)
Envy-free division of multi-layered cakes
Erel Segal-Halevi, S. Nitzan (2015)
Proportional Cake-Cutting among FamiliesarXiv: Computer Science and Game Theory
I. Caragiannis, David Kurokawa, H. Moulin, A. Procaccia, Nisarg Shah, Junxing Wang (2019)
The Unreasonable Fairness of Maximum Nash WelfareACM Transactions on Economics and Computation (TEAC), 7
Zbigniew Lonc, M. Truszczynski (2018)
Maximin Share Allocations on CyclesArXiv, abs/1905.03038
Jiarui Gan, Bo Li, Xiaowei Wu (2021)
Approximately Envy-Free Budget-Feasible AllocationArXiv, abs/2106.14446
H. Aziz, Simon Mackenzie (2016)
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong (2019)
The Price of Connectivity in Fair DivisionSIAM J. Discret. Math., 36
E. Elkind, Erel Segal-Halevi, Warut Suksompong (2020)
Mind the Gap: Cake Cutting With SeparationArtif. Intell., 313
Erel Segal-Halevi, S. Nitzan, A. Hassidim, Y. Aumann (2014)
Fair and Square: Cake-Cutting in Two DimensionsArXiv, abs/1409.4511
Nina Chiarelli, Matjaž Krnc, Martin Milanič, Ulrich Pferschy, Nevena Pivac, Joachim Schauer (2020)
Fair Packing of Independent SetsCombinatorial Algorithms, 12126
L. Gourvès, J. Monnot (2019)
On maximin share allocations in matroidsTheor. Comput. Sci., 754
E. Markakis (2017)
Approximation Algorithms and Hardness Results for Fair Division with Indivisible Goods
S. Even, A. Paz (1984)
A note on cake cuttingDiscret. Appl. Math., 7
Xiaohui Bei, Warut Suksompong (2019)
Dividing a Graphical Cake
J. Robertson, W. Webb (1998)
Cake-cutting algorithms - be fair if you can
Naveen Garg, T. Kavitha, Amit Kumar, K. Mehlhorn, Julián Mestre (2009)
Assigning Papers to RefereesAlgorithmica, 58
S. Bouveret, Y. Chevaleyre, N. Maudet (2016)
Fair Allocation of Indivisible Goods
Goldman, J., Procaccia, A. D. (2014)
Spliddit: Unleashing fair division algorithmsACM SIGecom Exchanges, 13
Eshwar Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, Nidhi Rathi (2019)
Fair and Efficient Cake Division with Connected PiecesArXiv, abs/1907.11019
Erel Segal-Halevi, S. Nitzan (2016)
Envy-Free Cake-Cutting among FamiliesArXiv, abs/1607.01517
Warut Suksompong (2017)
Approximate maximin shares for groups of agentsMath. Soc. Sci., 92
W. Stromquist (2008)
Envy-Free Cake Divisions Cannot be Found by Finite ProtocolsElectron. J. Comb., 15
Igarashi, A., Zwicker, W. S. (2021)
Fair division of graphs and of tangled cakesCoRR abs/2102.08560.
Xiaowei Wu, Bo Li, Jiarui Gan (2020)
Budget-feasible Maximum Nash Social Welfare Allocation is Almost Envy-freeArXiv, abs/2012.03766
Moshe Babaioff, N. Nisan, Inbal Talgam-Cohen (2017)
Competitive Equilibria with Indivisible Goods and Generic BudgetsArXiv, abs/1703.08150
D. Jojic, G. Panina, R. Živaljević (2019)
Splitting Necklaces, with ConstraintsSIAM J. Discret. Math., 35
L. Dubins, E. Spanier (1961)
How to Cut a Cake FairlyAmerican Mathematical Monthly, 68
Aziz, H., Caragiannis, I., Igarashi, A., Walsh, T. (2019)
Fair allocation of indivisible goods and choresProceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI)
The fair allocation of resources to interested agents is a fundamental problem in society. While the majority of the fair division literature assumes that all allocations are feasible, in practice there are often constraints on the allocation that can be chosen. In this survey, we discuss fairness guarantees for both divisible (cake cutting) and indivisible resources under several common types of constraints, including connectivity, cardinality, matroid, geometric, separation, budget, and conflict constraints. We also outline a number of open questions and directions.
ACM SIGecom Exchanges – Association for Computing Machinery
Published: Dec 6, 2021
Keywords: constraints
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.