Resilient Fair Allocation of Indivisible Goods

Abstract

[1]  Alexandros A. Voudouris,et al.  Fair Division of Indivisible Goods: A Survey , 2022, IJCAI.

[2]  Erel Segal-Halevi,et al.  Ordinal Maximin Share Approximation for Goods , 2021, J. Artif. Intell. Res..

[3]  Margarida Carvalho,et al.  Robust Models for the Kidney Exchange Problem , 2020, INFORMS J. Comput..

[4]  Toby Walsh,et al.  Fair allocation of indivisible goods and chores , 2019, Autonomous Agents and Multi-Agent Systems.

[5]  Erel Segal-Halevi,et al.  The Constrained Round Robin Algorithm for Fair and Efficient Allocation , 2019, ArXiv.

[6]  Aris Filos-Ratsikas,et al.  Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries , 2019, AAAI.

[7]  Makoto Yokoo,et al.  Robustness against Agent Failure in Hedonic Games , 2019, AAMAS.

[8]  John P. Dickerson,et al.  Scalable Robust Kidney Exchange , 2018, AAAI.

[9]  Nicolas Maudet,et al.  Efficiency, Sequenceability and Deal-Optimality in Fair Division of Indivisible Goods , 2018, AAMAS.

[10]  F. Su,et al.  Multilabeled versions of Sperner's and Fan's lemmas and applications , 2018, SIAM J. Appl. Algebra Geom..

[11]  Warut Suksompong,et al.  Democratic Fair Allocation of Indivisible Goods , 2017, IJCAI.

[12]  Mohammad Ghodsi,et al.  Fair Allocation of Indivisible Goods: Improvements and Generalizations , 2017, EC.

[13]  Mohammad Taghi Hajiaghayi,et al.  Fair Allocation of Indivisible Goods to Asymmetric Agents , 2017, AAMAS.

[14]  Ariel D. Procaccia,et al.  The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.

[15]  Wei Wang,et al.  Multi-Resource Fair Allocation in Heterogeneous Cloud Computing Systems , 2015, IEEE Transactions on Parallel and Distributed Systems.

[16]  Toby Walsh,et al.  Possible and Necessary Allocations via Sequential Mechanisms , 2014, IJCAI.

[17]  Sarit Kraus,et al.  Game-Theoretic Patrolling with Dynamic Execution Uncertainty and a Case Study on a Real Transit System , 2014, J. Artif. Intell. Res..

[18]  Haris Aziz,et al.  Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations , 2013, WINE.

[19]  Ariel D. Procaccia,et al.  Failure-aware kidney exchange , 2013, EC '13.

[20]  Jérôme Lang,et al.  A General Elicitation-Free Protocol for Allocating Indivisible Goods , 2011, IJCAI.

[21]  Eric Budish,et al.  The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.

[22]  Silvio Micali,et al.  Resilient Mechanisms For Truly Combinatorial Auctions , 2008 .

[23]  Barry O'Sullivan,et al.  Robust solutions for combinatorial auctions , 2005, EC '05.

[24]  Makoto Yokoo,et al.  Robust Combinatorial Auction Protocol against False-Name Bids , 2000, AAAI/IAAI.

[25]  D. Gale,et al.  Fair Allocation of Indivisible Goods and Criteria of Justice , 1991 .

[26]  Yann Chevaleyre,et al.  Fair Allocation of Indivisible Goods , 2016, Handbook of Computational Social Choice.

[27]  Juan Felipe Botero,et al.  Resilient allocation of service Function chains , 2016, 2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN).

[28]  Lawrence G. Sager.  Handbook of Computational Social Choice , 2015 .

[29]  S. Brams,et al.  Fair Division: From Cake-Cutting to Dispute Resolution , 1996 .