{"type":"ScholarlyArticle","title":"Fair Division: The Computer Scientist’s Perspective","authors":[{"name":"Toby Walsh","slug":"toby-walsh","given":"Toby","family":"Walsh","affiliation":"UNSW Sydney"}],"abstract":"I survey recent progress on a classic and challenging problem in social choice: the fair division of indivisible items. I discuss how a computational perspective has provided interesting insights into and understanding of how to divide items fairly and efficiently. This has involved bringing to bear tools such as those used in knowledge representation, computational complexity, approximation methods, game theory, online analysis and communication complexity.","doi":"10.24963/ijcai.2020/691","url":"https://ijcai.org/proceedings/2020/691","pdf":"https://ijcai.org/proceedings/2020/0691.pdf","markdown":"https://ijcai.org/proceedings/2020/691.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/691","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Survey track","track":"Survey track","number":691,"pages":{"first":4966,"last":4972},"keywords":["Agent-based and Multi-agent Systems: general"],"videos":[],"references":[{"position":1,"raw":"[Aleksandrov and Walsh, 2019] Martin Aleksandrov and Toby Walsh. Strategy-proofness, envy-freeness and pareto efficiency in online fair division with additive utilities. In","title":"Strategy-proofness, envy-freeness and pareto efficiency in online fair division with additive utilities","authors":"Aleksandrov, Walsh ;, Martin Aleksandrov, Toby Walsh","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"Abhaya C. Nayak and Alok Sharma, editors, 16th Pacific Rim Int. Conf. on Artificial Intelligence (PRICAI 2019), volume 11670 of LNCS, 527-541. Springer, 2019.","title":"16th Pacific Rim Int. Conf. on Artificial Intelligence (PRICAI 2019)","authors":null,"year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Aleksandrov and Walsh, 2020] M. Aleksandrov and T. Walsh. Online fair division: A survey. In Vincent Conitzer and Fei Sha, editors, Proc. of 34th AAAI Conf. on Artificial Intelligence. AAAI Press, 2020.","title":"Online fair division: A survey","authors":"M Aleksandrov, T Walsh","year":"2020","venue":"Proc. of 34th AAAI Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Aleksandrov et al., 2015] M. Aleksandrov, H. Aziz, S. Gaspers, and T. Walsh. Online fair division: analysing a food bank problem. In Q. Yang and M. Wooldridge, editors, Proc. of 24th Int. Joint Conf. on Artificial Intelligence, (IJCAI 2015), 2540-2546, 2015.","title":"Online fair division: analysing a food bank problem","authors":"M Aleksandrov, H Aziz, S Gaspers, T Walsh","year":"2015","venue":"Proc. of 24th Int. Joint Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2015/360"},{"position":5,"raw":"[Amanatidis et al., 2020] Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, and Alexandros A. Voudouris. Maximum nash welfare and other stories about EFX. CoRR, abs/2001.09838, 2020.","title":"Maximum nash welfare and other stories about EFX","authors":"Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A Voudouris","year":"2020","venue":null,"doi":null,"url":null,"internal_url":"/proceedings/2020/4"},{"position":6,"raw":"[Aziz et al., 2014] H. Aziz, S. Gaspers, S. Mackenzie, and T. Walsh. Fair assignment of indivisible objects under or- dinal preferences. In A. Bazzan, M. Huhns, A. Lomus- cio, and P. Scerri, editors, Int. conference on Autonomous Agents and Multi-Agent Systems, AAMAS '14, 1305-1312, 2014.","title":"Fair assignment of indivisible objects under ordinal preferences","authors":"H Aziz, S Gaspers, S Mackenzie, T Walsh","year":"2014","venue":"Int. conference on Autonomous Agents and Multi-Agent Systems, AAMAS '14","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Aziz et al., 2015a] H. Aziz, S. Gaspers, S. Mackenzie, N. Mattei, N. Narodytska, and T. Walsh. Equilibria under the probabilistic serial rule. In Q. Yang and M. Wooldridge, editors, Proc. of 24th Int. Joint Conf. on Artificial Intelligence, (IJCAI 2015), 1105-1112, 2015.","title":"Equilibria under the probabilistic serial rule","authors":"Aziz","year":"2015","venue":"Proc. of 24th Int. Joint Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2015/160"},{"position":8,"raw":"[Aziz et al., 2015b] H. Aziz, S. Gaspers, S. Mackenzie, N. Mattei, N. Narodytska, and T. Walsh. Manipulating the probabilistic serial rule. In G. Weiss, P. Yolum, R.H. Bor- dini, and E. Elkind, editors, Proc. of the 2015 Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 1451-1459. ACM, 2015.","title":"Manipulating the probabilistic serial rule","authors":"Aziz","year":"2015","venue":"Proc. of the 2015 Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Aziz et al., 2015c] H. Aziz, S. Gaspers, S. Mackenzie, and T. Walsh. Fair assignment of indivisible objects under ordinal preferences. Artificial Intelligence, 227:71 -92, 2015.","title":"Fair assignment of indivisible objects under ordinal preferences","authors":"Aziz","year":"2015","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Aziz et al., 2017] H. Aziz, G. Rauchecker, G. Schryen, and T. Walsh. Algorithms for max-min share fair allocation of indivisible chores. In S. Singh and S. Markovitch, editors, Proc. of 31st AAAI Conf. on Artificial Intelligence, 335- 341. AAAI Press, 2017.","title":"Algorithms for max-min share fair allocation of indivisible chores","authors":"H Aziz, G Rauchecker, G Schryen, T Walsh","year":"2017","venue":"Proc. of 31st AAAI Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Aziz et al., 2018] Haris Aziz, Ioannis Caragiannis, and Ayumi Igarashi. Fair allocation of combinations of indi- visible goods and chores. In AI Workshop on agents and incentives in artificial intelligence, AAMAS 2018, Stock- holm, Sweden, July 10-15, 2018.","title":"Fair allocation of combinations of indivisible goods and chores","authors":"Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi","year":"2018","venue":"AI Workshop on agents and incentives in artificial intelligence, AAMAS 2018","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Aziz et al., 2019] Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi, and Toby Walsh. Fair allocation of indivisible goods and chores. In Sarit Kraus, editor, Proc. of 28th Int. Joint Conf. on Artificial Intelligence, 53-59, 2019.","title":"Fair allocation of indivisible goods and chores","authors":"Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi, Toby Walsh","year":"2019","venue":"Proc. of 28th Int. Joint Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2019/8"},{"position":13,"raw":"[Barman and Krishnamurthy, 2019] Siddharth Barman and Sanath Kumar Krishnamurthy. On the proximity of mar- kets with integral equilibria. In Proc. of 33rd AAAI Conf. on Artificial Intelligence, AAAI 2019, 1748-1755. AAAI Press, 2019.","title":"On the proximity of markets with integral equilibria","authors":"Siddharth Barman, Sanath Kumar, Krishnamurthy","year":"2019","venue":"Proc. of 33rd AAAI Conf. on Artificial Intelligence, AAAI 2019","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Barman et al., 2018] Siddharth Barman, Sanath Kumar Kr- ishnamurthy, and Rohit Vaish. Greedy algorithms for max- imizing nash social welfare. In Proc. of 17th Int. Conf. on Autonomous Agents and MultiAgent Systems, AAMAS 2018, Stockholm, Sweden, July 10-15, 2018, 7-13, 2018.","title":"Greedy algorithms for maximizing nash social welfare","authors":"Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish","year":"2018","venue":"Proc. of 17th Int. Conf. on Autonomous Agents and MultiAgent Systems, AAMAS 2018","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Benade et al., 2018] Gerdus Benade, Aleksandr M. Kazachkov, Ariel D. Procaccia, and Christos-Alexandros Psomas. How to make envy vanish over time. In Éva Tardos, Edith Elkind, and Rakesh Vohra, editors, Proc. of 2018 ACM Conf. on Economics and Computation, 593-610, 2018.","title":"How to make envy vanish over time","authors":"Benade","year":"2018","venue":"Proc. of 2018 ACM Conf. on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Beviá, 1998] Carmen Beviá. Fair allocation in a general model with indivisible goods. Review of Economic De- sign, 3(3):195-213, 1998.","title":"Carmen Beviá. Fair allocation in a general model with indivisible goods","authors":"Beviá","year":"1998","venue":"Review of Economic Design","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Bogomolnaia and Moulin, 2001] A. Bogomolnaia and H. Moulin. A new solution to the random assignment problem. Journal of Economic Theory, 100(2):295 -328, 2001.","title":"A new solution to the random assignment problem","authors":"A Bogomolnaia, H Moulin","year":"2001","venue":"Journal of Economic Theory","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Bogomolnaia et al., 2017] Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, and Elena Yanovskaya. Competitive division of a mixed manna. Econometrica, 85(6):1847-1871, 2017.","title":"Competitive division of a mixed manna","authors":"Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaya","year":"2017","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Bogomolnaia et al., 2019] Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, and Elena Yanovskaia. Dividing bads under additive utilities. Social Choice and Welfare, 52(3):395-417, Mar 2019.","title":"Dividing bads under additive utilities","authors":"Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaia","year":"2019","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Bouveret and Lang, 2008] S. Bouveret and J. Lang. Effi- ciency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. Journal of Artificial Intelligence Research (JAIR), 32:525-564, 2008.","title":"Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity","authors":"S Bouveret, J Lang","year":"2008","venue":"Journal of Artificial Intelligence Research (JAIR)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Bouveret and Lang, 2011] S. Bouveret and J. Lang. A general elicitation-free protocol for allocating indivisible goods. In Toby Walsh, editor, Proc. of 22nd Int. Joint Conf. on Artificial Intelligence (IJCAI 2011), 73-78. IJ- CAI/AAAI, 2011.","title":"A general elicitation-free protocol for allocating indivisible goods","authors":"S Bouveret, J Lang","year":"2011","venue":"Proc. of 22nd Int. Joint Conf. on Artificial Intelligence (IJCAI 2011)","doi":null,"url":null,"internal_url":"/proceedings/2011/24"},{"position":22,"raw":"[Brams and Straffin, 1979] S.J. Brams and P.D. Straffin. Prisoners' dilemama and professional sports drafts. The American Mathematical Monthly, 86(2):pp. 80-88, 1979.","title":"Prisoners' dilemama and professional sports drafts","authors":"S J Brams, P D Straffin","year":"1979","venue":"The American Mathematical Monthly","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Brams and Taylor, 1996] S.J. Brams and A.D. Taylor. Fair Division: From cake-cutting to dispute resolution. Cam- bridge University Press, Cambridge, 1996.","title":"Fair Division: From cake-cutting to dispute resolution","authors":"S J Brams, A D Taylor","year":"1996","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Brams et al., 2003] Steven J. Brams, Paul H. Edelman, and Peter C. Fishburn. Fair division of indivisible items. The- ory and Decision, 55(2):147-180, Sep 2003.","title":"Fair division of indivisible items","authors":"Steven J Brams, Paul H Edelman, Peter C Fishburn","year":"2003","venue":"Theory and Decision","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Bredereck et al., 2019] Robert Bredereck, Andrzej Kacz- marczyk, Dusan Knop, and Rolf Niedermeier. High- multiplicity fair allocation: Lenstra empowered by N-fold integer programming. In Anna Karlin, Nicole Immorlica, and Ramesh Johari, editors, Proc. of 2019 ACM Conf. on Economics and Computation (EC 2019), 505-523. ACM, 2019.","title":"Highmultiplicity fair allocation: Lenstra empowered by N-fold integer programming","authors":"Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier","year":"2019","venue":"Proc. of 2019 ACM Conf. on Economics and Computation (EC 2019)","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Budish, 2011] Eric Budish. The combinatorial assign- ment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy, 119(6):1061-1103, 2011.","title":"The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes","authors":"Eric Budish","year":"2011","venue":"Journal of Political Economy","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Caragiannis et al., 2009] Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and Maria Ky- ropoulou. The efficiency of fair division. In 5th Int. Workshop on Internet and Network Economics (WINE 2009), volume 5929 of LNCS, 475-482. Springer, 2009.","title":"The efficiency of fair division","authors":"Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou","year":"2009","venue":"5th Int. Workshop on Internet and Network Economics (WINE 2009)","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Caragiannis et al., 2016] I. Caragiannis, D. Kurokawa, H. Moulin, A. Procaccia, N. Shah, and J. Wang. The un- reasonable fairness of maximum nash welfare. In Proc. of 2016 ACM Conf. on Economics and Computation, EC '16, 305-322, New York, NY, USA, 2016. ACM.","title":"The unreasonable fairness of maximum nash welfare","authors":"Caragiannis","year":"2016","venue":"Proc. of 2016 ACM Conf. on Economics and Computation, EC '16","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Chevaleyre et al., 2008] Yann Chevaleyre, Ulle Endriss, Sylvia Estivie, and Nicolas Maudet. Multiagent resource allocation in k-additive domains: preference representa- tion and complexity. Annals of Operations Research, 163(1):49-62, Oct 2008.","title":"Multiagent resource allocation in k-additive domains: preference representation and complexity","authors":"Yann Chevaleyre, Ulle Endriss, Sylvia Estivie, Nicolas Maudet","year":"2008","venue":"Annals of Operations Research","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Conitzer et al., 2017] Vincent Conitzer, Rupert Freeman, and Nisarg Shah. Fair public decision making. In Con- stantinos Daskalakis, Moshe Babaioff, and Hervé Moulin, editors, Proc. of 2017 ACM Conf. on Economics and Com- putation, EC '17, 629-646, 2017.","title":"Fair public decision making","authors":"Vincent Conitzer, Rupert Freeman, Nisarg Shah","year":"2017","venue":"Proc. of 2017 ACM Conf. on Economics and Computation, EC '17","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[de Keijzer et al., 2009] Bart de Keijzer, Sylvain Bouveret, Tomas Klos, and Yingqian Zhang. On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences. In Proc. of Algorithmic Decision Theory, 1st Int. Conf., ADT, 98-110, 2009.","title":"On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences","authors":"De Keijzer","year":"2009","venue":"Proc. of Algorithmic Decision Theory, 1st Int. Conf","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Dickerson et al., 2014] J.P. Dickerson, J.R. Goldman, J. Karp, A.D. Procaccia, and T. Sandholm. The com- putational rise and fall of fairness. In C.E. Brodley and P. Stone, editors, Proc. of 28th AAAI Conf. on Artificial Intelligence, 1405-1411, 2014.","title":"The computational rise and fall of fairness","authors":"J P Dickerson, J R Goldman, J Karp, A D Procaccia, T Sandholm","year":"2014","venue":"Proc. of 28th AAAI Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Gerding et al., 2019] Enrico H. Gerding, Alvaro Perez- Diaz, Haris Aziz, Serge Gaspers, Antonia Marcu, Nicholas Mattei, and Toby Walsh. Fair online allocation of perish- able goods and its application to electric vehicle charging. In Sarit Kraus, editor, Proc. of 28th Int. Joint Conf. on Ar- tificial Intelligence, 5569-5575, 2019.","title":"Fair online allocation of perishable goods and its application to electric vehicle charging","authors":"Enrico H Gerding, Alvaro Perez-Diaz, Haris Aziz, Serge Gaspers, Antonia Marcu, Nicholas Mattei, Toby Walsh","year":"2019","venue":"Proc. of 28th Int. Joint Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2019/773"},{"position":34,"raw":"[Goldman and Procaccia, 2014] Jonathan R. Goldman and Ariel D. Procaccia. Spliddit: unleashing fair division al- gorithms. SIGecom Exchanges, 13(2):41-46, 2014.","title":"Spliddit: unleashing fair division algorithms","authors":"Jonathan R Goldman, Ariel D Procaccia","year":"2014","venue":"SIGecom Exchanges","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[He et al., 2019] Jiafan He, Ariel D. Procaccia, Alexandros Psomas, and David Zeng. Achieving a fairer future by changing the past. In Sarit Kraus, editor, Proc. of 28th Int. Joint Conf. on Artificial Intelligence, 343-349, 2019.","title":"Achieving a fairer future by changing the past","authors":"He","year":"2019","venue":"Proc. of 28th Int. Joint Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2019/49"},{"position":36,"raw":"[Kalinowski et al., 2013a] T. Kalinowski, N. Narodytska, and T. Walsh. A social welfare optimal sequential allo- cation procedure. In Proc. of the 23rd Int. Joint Conf. on Artificial Intelligence (IJCAI-2013). 2013.","title":"A social welfare optimal sequential allocation procedure","authors":"Kalinowski","year":"2013","venue":"Proc. of the 23rd Int. Joint Conf. on Artificial Intelligence (IJCAI-2013)","doi":null,"url":null,"internal_url":"/proceedings/2013/43"},{"position":37,"raw":"[Kalinowski et al., 2013b] T. Kalinowski, N. Narodytska, T. Walsh, and L. Xia. Strategic behavior when allocat- ing indivisible goods sequentially. In Proc. of 27th AAAI Conf. on Artificial Intelligence (AAAI 2013). AAAI Press, 2013.","title":"Strategic behavior when allocating indivisible goods sequentially","authors":"Kalinowski","year":"2013","venue":"Proc. of 27th AAAI Conf. on Artificial Intelligence (AAAI 2013)","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Kash et al., 2014] Ian A. Kash, Ariel D. Procaccia, and Nis- arg Shah. No agent left behind: Dynamic fair division of multiple resources. J. Artif. Intell. Res., 51:579-603, 2014.","title":"No agent left behind: Dynamic fair division of multiple resources","authors":"Ian A Kash, Ariel D Procaccia, Nisarg Shah","year":"2014","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Lipton et al., 2004] R.J. Lipton, E. Markakis, E. Mossel, and A. Saberi. On approximately fair allocations of in- divisible goods. In J.S. Breese, J. Feigenbaum, and M.I. Seltzer, editors, Proc. 5th ACM Conf. on Electronic Com- merce (EC-2004), 125-131. ACM, 2004.","title":"On approximately fair allocations of indivisible goods","authors":"R J Lipton, E Markakis, E Mossel, A Saberi","year":"2004","venue":"Proc. 5th ACM Conf. on Electronic Commerce (EC-2004)","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Mattei and Walsh, 2013] N. Mattei and T. Walsh. PrefLib: A library of preference data. In Algorithmic Decision The- ory, 3rd Int. Conf., (ADT 2013), LNAI. Springer, 2013.","title":"PrefLib: A library of preference data","authors":"N Mattei, T Walsh","year":"2013","venue":"Algorithmic Decision Theory, 3rd Int. Conf","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Mattei et al., 2017] N. Mattei, A. Saffidine, and T. Walsh. Mechanisms for online organ matching. In Proc. of 26th Int. Joint Conf. on Artificial Intelligence, IJCAI 2017, 345- 351, 2017.","title":"Mechanisms for online organ matching","authors":"N Mattei, A Saffidine, T Walsh","year":"2017","venue":"Proc. of 26th Int. Joint Conf. on Artificial Intelligence, IJCAI 2017","doi":null,"url":null,"internal_url":"/proceedings/2017/49"},{"position":42,"raw":"[Mattei et al., 2018] N. Mattei, A. Saffidine, and T. Walsh. Fairness in deceased organ matching. In Proc. of 1st AAAI/ACM Conf. on AI, Ethics, and Society, 2018.","title":"Fairness in deceased organ matching","authors":"N Mattei, A Saffidine, T Walsh","year":"2018","venue":"Proc. of 1st AAAI/ACM Conf. on AI","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Nguyen et al., 2014] Nhan-Tam Nguyen, Trung Thanh Nguyen, Magnus Roos, and Jörg Rothe. Computational complexity and approximability of social welfare opti- mization in multiagent resource allocation. Autonomous Agents and Multi-Agent Systems, 28(2):256-289, 2014.","title":"Computational complexity and approximability of social welfare optimization in multiagent resource allocation","authors":"Nhan-Tam Nguyen, Trung, Thanh Nguyen, Magnus Roos, Jörg Rothe","year":"2014","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Plaut and Roughgarden, 2019] B. Plaut and T. Roughgar- den. Communication complexity of discrete fair division. In Proc. of 13th Annual ACM-SIAM Symposium on Dis- crete Algorithms, SODA '19, 2014-2033, USA, 2019.","title":"Communication complexity of discrete fair division","authors":"B Plaut, T Roughgarden","year":"2019","venue":"Proc. of 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '19","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Steinhaus, 1948] H. Steinhaus. The problem of fair divi- sion. Econometrica, 16:101-104, 1948.","title":"The problem of fair division","authors":"H Steinhaus","year":"1948","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Walsh, 2014] T. Walsh. Allocation in practice. In Proc. of 37th German Conf. on Artificial Intelligence (KI-2014), LNAI, 13-24. Springer, 2014.","title":"Allocation in practice","authors":"T Walsh","year":"2014","venue":"Proc. of 37th German Conf. on Artificial Intelligence (KI-2014)","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Walsh, 2015] T. Walsh. Challenges in resource and cost al- location. In Proc. of 29th AAAI Conf. on AI, 25-30. Asso- ciation for Advancement of Artificial Intelligence, 2015.","title":"Challenges in resource and cost allocation","authors":"T Walsh","year":"2015","venue":"Proc. of 29th AAAI Conf. on AI","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Walsh, 2016] T. Walsh. Strategic behaviour when allocating indivisible goods. In D. Schuurmans and M. Wellman, editors, Proc. of 30th AAAI Conf. on Artificial Intelligence, 4177-4183. AAAI Press, 2016.","title":"Strategic behaviour when allocating indivisible goods","authors":"T Walsh","year":"2016","venue":"Proc. of 30th AAAI Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[Xiao and Ling, 2020] M. Xiao and J. Ling. Algorithms for manipulating sequential allocation. In Proc. of 34th AAAI Conf. on Artificial Intelligence. AAAI Press, 2020.","title":"Algorithms for manipulating sequential allocation","authors":"M Xiao, J Ling","year":"2020","venue":"Proc. of 34th AAAI Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}