Fetching the paper…
Reading the bibliography…
We consider two models of fair division with indivisible items: one for goods and one for bads.
Kuhn, H.W., Yaw, B.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly pp. 83–97 (1955)
1955
Earlier work this paper cites.
Foley, D.K.: Resource allocation and the public sector. YALE ECON ESSAYS 7
1967
Earlier work this paper cites.
Varian, H.R.: Equity, envy, and efficiency. Journal of Economic Theory 9
1974
Earlier work this paper cites.
Brams, S.J., Taylor, A.D.: Fair division - from cake-cutting to dispute resolution. Cambridge University Press (1996)
1996
Earlier work this paper cites.
Moulin, H.: Fair division and collective welfare. MIT Press (2003)
2003
Earlier work this paper cites.
Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings Fifth ACM Conference on Electronic Commerce (EC-2004), New York, NY, USA, May 17-20, 2004. pp. 125–131 (2004)
2004
Earlier work this paper cites.
de Clippel, G.: Equity, envy and efficiency under asymmetric information. Economics Letters 99
2008
Earlier work this paper cites.
de Clippel, G., Moulin, H., Tideman, N.: Impartial division of a dollar. Journal of Economic Theory 139
2008
Earlier work this paper cites.
Chakrabarty, D., Chuzhoy, J., Khanna, S.: On allocating goods to maximize fairness. In: FOCS. pp. 107–116. IEEE Computer Society (2009)
2009
Earlier work this paper cites.
Goemans, M.X., Harvey, N.J.A., Iwata, S., Mirrokni, V.S.: Approximating submodular functions everywhere. In: SODA. pp. 535–544. SIAM (2009)
2009
Earlier work this paper cites.
Ramezani, S., Endriss, U.: Nash social welfare in multiagent resource allocation. In: AMEC/TADA. Lecture Notes in Business Information Processing, vol. 59, pp. 117–131 (2009)
2009
Earlier work this paper cites.
Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. In: BQGT. p. 74:1. ACM (2010)
2010
Earlier work this paper cites.
Lan, T., Kao, D., Chiang, M., Sabharwal, A.: An axiomatic theory of fairness in network resource allocation. In: 2010 Proceedings IEEE INFOCOM. pp. 1–9 (March 2010)
2010
Cited alongside, same era.
Dobzinski, S., Vondrák, J.: Communication complexity of combinatorial auctions with submodular valuations. In: SODA. pp. 1205–1215. SIAM (2013)
2013
Cited alongside, same era.
Nguyen, T.T., Roos, M., Rothe, J.: A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation. Annals of Mathematics and Artificial Intelligence 68
2013
Cited alongside, same era.
Goldman, J.R., Procaccia, A.D.: Spliddit: unleashing fair division algorithms. SIGecom Exchanges 13
2014
Cited alongside, same era.
Heydrich, S., van Stee, R.: Dividing connected chores fairly. Theoretical Computer Science 593
2015
Smet, P.: Nurse rostering: models and algorithms for theory, practice and integration with other problems. 4OR 14
2016
Later among the works it cites.
Verne, G., Bratteteig, T.: Do-it-yourself services and work-like chores: on civic duties and digital public services. Personal and Ubiquitous Computing 20
2016
Later among the works it cites.
Aziz, H., Rauchecker, G., Schryen, G., Walsh, T.: Algorithms for max-min share fair allocation of indivisible chores. In: Proceedings of the Thirty-First AAAI 2017, San Francisco, California, USA, February 4-9, 2017. pp. 335–341. AAAI Press (2017)
2017
Later among the works it cites.
Bouveret, S., Cechlárová, K., Elkind, E., Igarashi, A., Peters, D.: Fair division of a graph. In: Proceedings of the Twenty-Sixth IJCAI 2017, August 19-25, 2017. pp. 135–141 (2017)
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Parkes, D.C., Procaccia, A.D., Shah, N.: Beyond dominant resource fairness: Extensions, limitations, and indivisibilities. ACM Transactions 3
2015
Cited alongside, same era.
Segal-Halevi, E., Nitzan, S.: Fair cake-cutting among groups. CoRR abs/1510.03903
2015
Cited alongside, same era.
Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for any number of agents. In: FOCS. pp. 416–427. IEEE Computer Society (2016)
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2016
Cited alongside, same era.
Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice. Cambridge University Press, New York, NY, USA, 1st edn. (2016)
2016
Cited alongside, same era.
Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum nash welfare. In: Proceedings of the 2016 ACM Conference on Economics and Computation, EC ’16, Maastricht, The Netherlands, July 24-28, 2016. pp. 305–322 (2016)
2016
Cited alongside, same era.
Freeman, R., Zahedi, S.M., Conitzer, V.: Fair and efficient social choice in dynamic settings. In: Proceedings of the Twenty-Sixth IJCAI-17, Melbourne, Australia, August 19-25. pp. 4580–4587 (2017)
2017
Later among the works it cites.
Amanatidis, G., Birmpas, G., Markakis, V.: Comparing approximate relaxations of envy-freeness. In: Proceedings of the Twenty-Seventh IJCAI 2018, Stockholm, Sweden, July 13-19. pp. 42–48. ijcai.org (2018)
2018
Closest in time.
Aziz, H., Bouveret, S., Caragiannis, I., Giagkousi, I., Lang, J.: Knowledge, fairness, and social constraints. In: Proceedings of the Thirty-Second AAAI 2018, New Orleans, Louisiana, USA, February 2-7, 2018. AAAI Press (2018)
2018
Closest in time.
Aziz, H., Caragiannis, I., Igarashi, A.: Fair allocation of combinations of indivisible goods and chores. In: AAMAS-IJCAI AIAIAI Workshop on agents and incentives in artificial intelligence, AAMAS-IJCAI 2018, Stockholm, Sweden, July 10-19 (2018)
2018
Closest in time.
Barman, S., Krishnamurthy, S.K., Vaish, R.: Greedy algorithms for maximizing nash social welfare. In: AAMAS. pp. 7–13. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM (2018)
2018
Closest in time.
Gal, K., Procaccia, A.D., Mash, M., Zick, Y.: Which is the fairest (rent division) of them all? Communication ACM 61
2018
Closest in time.
Plaut, B., Roughgarden, T.: Almost envy-freeness with general valuations. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018. pp. 2584–2603 (2018)
2018
Closest in time.