{"type":"ScholarlyArticle","title":"Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types","authors":[{"name":"Trung Thanh Nguyen","slug":"trung-thanh-nguyen","given":"Trung Thanh","family":"Nguyen","affiliation":"ORLab , Faculty of Computer Science , Phenikaa University , Hanoi 12116 , Vietnam"},{"name":"Jörg Rothe","slug":"jorg-rothe","given":"Jörg","family":"Rothe","affiliation":"Institut für Informatik , Heinrich-Heine-Universität Düsseldorf , 40225 Düsseldorf , Germany"}],"abstract":"In fair division of indivisible goods, finding an allocation that satisfies fairness and efficiency simultaneously is highly desired but\r\ncomputationally hard.  We solve this problem approximately in polynomial time by modeling it as a bi-criteria optimization problem\r\nthat can be solved efficiently by determining an approximate Pareto set of bounded size. We focus on two criteria: max-min fairness and\r\nutilitarian efficiency, and study this problem for the setting when there are only a few item types or a few agent types.  We show in both cases that one can construct an approximate Pareto set in time polynomial in the input size, either by designing a dynamic programming scheme, or a linear-programming algorithm.  Our techniques strengthen known methods and can be potentially applied to other notions of fairness and efficiency as well.","doi":"10.24963/ijcai.2020/41","url":"https://ijcai.org/proceedings/2020/41","pdf":"https://ijcai.org/proceedings/2020/0041.pdf","markdown":"https://ijcai.org/proceedings/2020/41.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/41","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":"Agent-based and Multi-agent Systems","track":"Main track","number":41,"pages":{"first":290,"last":296},"keywords":["Agent-based and Multi-agent Systems: Resource Allocation","Agent-based and Multi-agent Systems: Computational Social Choice","Agent-based and Multi-agent Systems: Economic Paradigms, Auctions and Market-Based Systems"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/25022/file_25022.m3u8","length_sec":279,"provider":"hls"}],"references":[{"position":1,"raw":"[Alon et al., 1998] Noga Alon, Yossi Azar, Gerhard Woegin- ger, and Tal Yadid. Approximation schemes for scheduling on parallel machines. J. Scheduling, 1(1):55-66, 1998.","title":"Approximation schemes for scheduling on parallel machines","authors":"Yossi Noga Alon, Gerhard Azar, Tal Woeginger, Yadid","year":"1998","venue":"J. Scheduling","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Aumann and Dombb, 2015] Yonatan Aumann and Yair Dombb. The efficiency of fair division with connected pieces. ACM Trans. Economics and Comput., 3(4):23:1- 23:16, 2015.","title":"Yonatan Aumann and Yair Dombb. The efficiency of fair division with connected pieces","authors":"Dombb Aumann","year":"2015","venue":"ACM Trans. Economics and Comput","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Aziz et al., 2019] Haris Aziz, Xin Huang, Nicholas Mat- tei, and Erel Segal-Halevi. The constrained round robin algorithm for fair and efficient allocation. CoRR, abs/1908.00161, 2019.","title":"The constrained round robin algorithm for fair and efficient allocation","authors":"Haris Aziz, Xin Huang, Nicholas Mattei, Erel Segal-Halevi","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Barman et al., 2018] Siddharth Barman, Sanath Krishna- murthy, and Rohit Vaish. Finding fair and efficient allo- cations. In Proc. 18th ACM Conference on Economics and Computation, pages 557-574, 2018.","title":"Finding fair and efficient allocations","authors":"Siddharth Barman, Sanath Krishnamurthy, Rohit Vaish","year":"2018","venue":"Proc. 18th ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bei et al., 2019] Xiaohui Bei, Xinhang Lu, Pasin Manu- rangsi, and Warut Suksompong. The price of fairness for indivisible goods. In Proc. 28th International Joint Con- ference on Artificial Intelligence, pages 81-87, 2019.","title":"The price of fairness for indivisible goods","authors":"Xiaohui Bei, Xinhang Lu, Pasin Manurangsi, Warut Suksompong","year":"2019","venue":"Proc. 28th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2019/12"},{"position":6,"raw":"[Bertsimas et al., 2011] Dimitris Bertsimas, Vivek Farias, and Nikolaos Trichakis. The price of fairness. Operations Research, 59(1):17-31, 2011.","title":"The price of fairness","authors":"Dimitris Bertsimas, Vivek Farias, Nikolaos Trichakis","year":"2011","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bliem et al., 2016] Bernhard Bliem, Robert Bredereck, and Rolf Niedermeier. Complexity of efficient and envy-free resource allocation: Few agents, resources, or utility lev- els. In Proc. 25th International Joint Conference on Arti- ficial Intelligence, pages 102-108, 2016.","title":"Complexity of efficient and envy-free resource allocation: Few agents, resources, or utility levels","authors":"Bernhard Bliem, Robert Bredereck, Rolf Niedermeier","year":"2016","venue":"Proc. 25th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2016/22"},{"position":8,"raw":"[Bouveret et al., 2016] Sylvain Bouveret, Yann Chevaleyre, and Nicolas Maudet. Fair allocation of indivisible goods. In Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel Procaccia, editors, Handbook of Compu- tational Social Choice, chapter 12, pages 284-310. Cam- bridge University Press, 2016.","title":"Fair allocation of indivisible goods","authors":"Sylvain Bouveret, Yann Chevaleyre, Nicolas Maudet","year":"2016","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bouveret et al., 2017] Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, and Do- minik Peters. Fair division of a graph. In Proc. 26th International Joint Conference on Artificial Intelligence, pages 135-141, 2017.","title":"Fair division of a graph","authors":"Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, Dominik Peters","year":"2017","venue":"Proc. 26th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Brânzei et al., 2016] Simina Brânzei, Yuezhou Lv, and Ruta Mehta. To give or not to give: Fair division for single minded valuations. In Proc. 25th International Joint Con- ference on Artificial Intelligence, pages 123-129, 2016.","title":"To give or not to give: Fair division for single minded valuations","authors":"Simina Brânzei, Yuezhou Lv, Ruta Mehta","year":"2016","venue":"Proc. 25th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2016/25"},{"position":11,"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 Proc. 19th ACM Conference on Economics and Computation, pages 505-523, 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. 19th ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Brown, 1979] J. Randall Brown. The knapsack sharing problem. Operations Research, 27(2):341-355, 1979.","title":"The knapsack sharing problem","authors":"J Randall Brown","year":"1979","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Caragiannis et al., 2012] Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and Maria Ky- ropoulou. The efficiency of fair division. Theory Comput. Syst., 50(4):589-610, 2012.","title":"The efficiency of fair division","authors":"Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou","year":"2012","venue":"Theory Comput. Syst","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Caragiannis et al., 2016] Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel Procaccia, Nisarg Shah, and Junxing Wang. The unreasonable fairness of max- imum Nash welfare. In Proc. 16th ACM Conference on Economics and Computation, pages 305-322, 2016.","title":"The unreasonable fairness of maximum Nash welfare","authors":"Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel Procaccia, Nisarg Shah, Junxing Wang","year":"2016","venue":"Proc. 16th ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Escoffier et al., 2013] Bruno Escoffier, Laurent Gourvès, and Jérôme Monnot. Fair solutions for some multiagent optimization problems. Autonomous Agents and Multi- Agent Systems, 26(2):184-201, 2013.","title":"Fair solutions for some multiagent optimization problems","authors":"Bruno Escoffier, Laurent Gourvès, Jérôme Monnot","year":"2013","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Galil and Megiddo, 1979] Zvi Galil and Nimrod Megiddo. A fast selection algorithm and the problem of optimum distribution of effort. J. ACM, 26(1):58-64, 1979.","title":"Zvi Galil and Nimrod Megiddo. A fast selection algorithm and the problem of optimum distribution of effort","authors":"Megiddo Galil","year":"1979","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Goel et al., 2001] Ashish Goel, Adam Meyerson, and Serge Plotkin. Combining fairness with throughput: Online rout- ing with multiple objectives. Journal of Computer and System Sciences, 63(1):62-79, 2001.","title":"Combining fairness with throughput: Online routing with multiple objectives","authors":"Ashish Goel, Adam Meyerson, Serge Plotkin","year":"2001","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Igarashi and Peters, 2019] Ayumi Igarashi and Dominik Pe- ters. Pareto-optimal allocation of indivisible goods with connectivity constraints. In Proc. 33rd AAAI Conference on Artificial Intelligence, pages 2045-2052. AAAI Press, 2019.","title":"Ayumi Igarashi and Dominik Peters. Pareto-optimal allocation of indivisible goods with connectivity constraints","authors":"Peters Igarashi","year":"2019","venue":"Proc. 33rd AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Jansen and Maack, 2019] Klaus Jansen and Marten Maack. An EPTAS for scheduling on unrelated machines of few different types. Algorithmica, 81(10):4134-4164, 2019.","title":"An EPTAS for scheduling on unrelated machines of few different types","authors":"Maack Jansen, Klaus Jansen, Marten Maack","year":"2019","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Kleinberg et al., 2001] Jon Kleinberg, Yuval Rabani, and Éva Tardos. Fairness in routing and load balancing. Jour- nal of Computer and System Sciences, 63(1):2-20, 2001.","title":"Fairness in routing and load balancing","authors":"Jon Kleinberg, Yuval Rabani, Éva Tardos","year":"2001","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Kones and Levin, 2019] Ishai Kones and Asaf Levin. A uni- fied framework for designing EPTAS for load balancing on parallel machines. Algorithmica, 81(7):3025-3046, 2019.","title":"A unified framework for designing EPTAS for load balancing on parallel machines","authors":"Levin ; Kones, Ishai Kones, Asaf Levin","year":"2019","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Krysta et al., 2013] Piotr Krysta, Orestis Telelis, and Carmine Ventre. Mechanisms for multi-unit combinatorial auctions with a few distinct goods. In Proc. 12th Interna- tional Conference on Autonomous Agents and Multiagent Systems, pages 691-698. IFAAMAS, 2013.","title":"Mechanisms for multi-unit combinatorial auctions with a few distinct goods","authors":"Piotr Krysta, Orestis Telelis, Carmine Ventre","year":"2013","venue":"Proc. 12th International Conference on Autonomous Agents and Multiagent Systems","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lang and Rothe, 2015] Jérôme Lang and Jörg Rothe. Fair division of indivisible goods. In Jörg Rothe, editor, Eco- nomics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Di- vision, Springer Texts in Business and Economics, chap- ter 8, pages 493-550. Springer, 2015.","title":"Fair division of indivisible goods","authors":"Lang, Rothe ;, Jérôme Lang, Jörg Rothe","year":"2015","venue":"Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Lenstra Jr., 1983] Hendrik Lenstra Jr. Integer programming with a fixed number of variables. Mathematics of Opera- tions Research, 8(4):538-548, 1983.","title":"Integer programming with a fixed number of variables","authors":"Lenstra, Hendrik Lenstra","year":"1983","venue":"Mathematics of Operations Research","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Lesmana et al., 2019] Nixie Lesmana, Xuan Zhang, and Xi- aohui Bei. Balancing efficiency and fairness in on-demand ridesourcing. In Proc. 33rd Neural Information Process- ing Systems (NeurIPS), pages 5310-5320, 2019.","title":"Balancing efficiency and fairness in on-demand ridesourcing","authors":"Nixie Lesmana, Xuan Zhang, Xiaohui Bei","year":"2019","venue":"Proc. 33rd Neural Information Processing Systems (NeurIPS)","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Suksompong, 2019] Warut Suksompong. Fairly allocating contiguous blocks of indivisible items. Discrete Applied Mathematics, 260:227-236, 2019.","title":"Warut Suksompong. Fairly allocating contiguous blocks of indivisible items","authors":"Suksompong","year":"2019","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Woeginger, 1997] Gerhard Woeginger. A polynomial-time approximation scheme for maximizing the minimum ma- chine completion time. Operations Research Letters, 20(4):149-154, 1997.","title":"A polynomial-time approximation scheme for maximizing the minimum machine completion time","authors":"Gerhard Woeginger","year":"1997","venue":"Operations Research Letters","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}