Funder
Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Control and Optimization,Computer Science Applications,Economics, Econometrics and Finance (miscellaneous)
Reference19 articles.
1. Aziz H, Caragiannis I, Igarashi A, Walsh T (2019) Fair allocation of combinations of indivisible goods and chores. Proc Twenty-Eighth Int Joint Conf Artificial Intel (IJCAI-19) 53–59
2. Barberà S, Bossert W, Pattanaik PK (2004) Ranking sets of objects. In Barberà, S., Hammond, P.J., and C. Seidl (eds). Handbook Util Theor. Springer, Boston, MA
3. Bilò V, Caragiannis I, Flammini M, Igarashi A, Monaco G, Peters D, Vinci C, Zwicker WS (2018) Almost envy-free allocations with connected bundles. arXiv:1808.09406
4. Bouveret S, Chevaleyre Y, Maudet N (2016) Fair allocation of indivisible goods. In Brandt, F., Conitzer, V., Endriss, U., Lang, J., and A.D. Procaccia (eds). Handbook of computational social choice, Cambridge University Press, New York. 284–310
5. Brams SJ, Fishburn P (2000) Fair division of indivisible items between two people with identical preferences: envy-freeness, Pareto-optimality, and equity. Soc Choice Welfare 17:247–267