{"type":"ScholarlyArticle","title":"Computing an Approximately Optimal Agreeable Set of Items","authors":[{"name":"Pasin Manurangsi","slug":"pasin-manurangsi","given":"Pasin","family":"Manurangsi","affiliation":"UC Berkeley"},{"name":"Warut Suksompong","slug":"warut-suksompong","given":"Warut","family":"Suksompong","affiliation":"Stanford University"}],"abstract":"We study the problem of finding a small subset of items that is agreeable to all agents, meaning that all agents value the subset at least as much as its complement. Previous work has shown worst-case bounds, over all instances with a given number of agents and items, on the number of items that may need to be included in such a subset. Our goal in this paper is to efficiently compute an agreeable subset whose size approximates the size of the smallest agreeable subset for a given instance. We consider three well-known models for representing the preferences of the agents: ordinal preferences on single items, the value oracle model, and additive utilities. In each of these models, we establish virtually tight bounds on the approximation ratio that can be obtained by algorithms running in polynomial time.","doi":"10.24963/ijcai.2017/48","url":"https://ijcai.org/proceedings/2017/48","pdf":"https://ijcai.org/proceedings/2017/0048.pdf","markdown":"https://ijcai.org/proceedings/2017/48.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/48","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":48,"pages":{"first":338,"last":344},"keywords":["Agent-based and Multi-agent Systems: Social Choice Theory","Agent-based and Multi-agent Systems: Economic paradigms, auctions and market-based systems"],"videos":[],"references":[{"position":1,"raw":"[Alon et al., 2006] Noga Alon, Dana Moshkovitz, and Shmuel Safra. Algorithmic construction of sets for k- restrictions. ACM Transactions on Algorithms, 2(2):153- 177, 2006.","title":"Algorithmic construction of sets for krestrictions","authors":"Noga Alon, Dana Moshkovitz, Shmuel Safra","year":"2006","venue":"ACM Transactions on Algorithms","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Amanatidis et al., 2015] Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, and Amin Saberi. Approxima- tion algorithms for computing maximin share allocations. In ICALP, pages 39-51, 2015.","title":"Approximation algorithms for computing maximin share allocations","authors":"Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi","year":"2015","venue":"ICALP","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Aziz et al., 2015] Haris Aziz, Serge Gaspers, Simon Mackenzie, and Toby Walsh. Fair assignment of in- divisible objects under ordinal preferences. Artificial Intelligence, 227:71-92, 2015.","title":"Fair assignment of indivisible objects under ordinal preferences","authors":"Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh","year":"2015","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bouveret and Lemaître, 2016] Sylvain Bouveret and Michel Lemaître. Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Autonomous Agents and Multi-Agent Systems, 30(2):1321-1328, 2016.","title":"Characterizing conflicts in fair division of indivisible goods using a scale of criteria","authors":"Lemaître Bouveret, Sylvain Bouveret, Michel Lemaître","year":"2016","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bouveret et al., 2010] Sylvain Bouveret, Ulle Endriss, and Jérôme Lang. Fair division under ordinal preferences: Computing envy-free allocations of indivisible goods. In ECAI, pages 387-392, 2010.","title":"Fair division under ordinal preferences: Computing envy-free allocations of indivisible goods","authors":"Sylvain Bouveret, Ulle Endriss, Jérôme Lang","year":"2010","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Brams and Fishburn, 2000] Steven J. Brams and Peter C. Fishburn. Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity. Social Choice and Welfare, 17(2):247-267, 2000.","title":"Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity","authors":"Steven J Brams, Peter C Fishburn","year":"2000","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brams et al., 2012] Steven J. Brams, D. Marc Kilgour, and Christian Klamler. The undercut procedure: An algo- rithm for the envy-free division of indivisible items. Social Choice and Welfare, 39(2-3):615-631, 2012.","title":"The undercut procedure: An algorithm for the envy-free division of indivisible items","authors":"Steven J Brams, D Marc Kilgour, Christian Klamler","year":"2012","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Caragiannis et al., 2016] Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, and Junxing Wang. The unreasonable fairness of maximum Nash welfare. In EC, pages 305-322, 2016.","title":"The unreasonable fairness of maximum Nash welfare","authors":"Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D Procaccia, Nisarg Shah, Junxing Wang","year":"2016","venue":"EC","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dinur and Steurer, 2014] Irit Dinur and David Steurer. An- alytical approach to parallel repetition. In STOC, pages 624-633, 2014.","title":"Analytical approach to parallel repetition","authors":"Steurer Dinur, Irit Dinur, David Steurer","year":"2014","venue":"STOC","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Erdős and Szekeres, 1935] Paul Erdős and George Szek- eres. A combinatorial problem in geometry. Compositio Mathematica, 2:463-470, 1935.","title":"Paul Erdős and George Szekeres. A combinatorial problem in geometry","authors":"Szekeres Erdős","year":"1935","venue":"Compositio Mathematica","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Feige et al., 2011] Uriel Feige, Vahab S. Mirrokni, and Jan Vondrák. Maximizing non-monotone submodular func- tions. SIAM Journal on Computing, 40(4):1133-1153, 2011.","title":"Maximizing non-monotone submodular functions","authors":"Uriel Feige, S Vahab, Jan Mirrokni, Vondrák","year":"2011","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Feige, 1998] Uriel Feige. A threshold of ln n for approx- imating set cover. Journal of the ACM, 45(4):634-652, 1998.","title":"A threshold of ln n for approximating set cover","authors":"Uriel Feige","year":"1998","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Foley, 1967] Duncan K. Foley. Resource allocation and the public sector. Yale Economics Essays, 7(1):45-98, 1967.","title":"Resource allocation and the public sector","authors":"Duncan K Foley","year":"1967","venue":"Yale Economics Essays","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gordon et al., 1996] Daniel M. Gordon, Oren Patashnik, Greg Kuperberg, and Joel H. Spencer. Asymptotically op- timal covering designs. Journal of Combinatorial Theory, Series A, 75(2):270-280, 1996.","title":"Asymptotically optimal covering designs","authors":"M Daniel, Oren Gordon, Greg Patashnik, Joel H Kuperberg, Spencer","year":"1996","venue":"Journal of Combinatorial Theory, Series A","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Johnson, 1974] David S. Johnson. Approximation algo- rithms for combinatorial problems. Journal of Computer and System Sciences, 9(3):256-278, 1974.","title":"Approximation algorithms for combinatorial problems","authors":"David S Johnson","year":"1974","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Karp, 1972] Richard M. Karp. Reducibility among combi- natorial problems. In Proceedings of Complexity of Com- puter Computations, pages 85-103, 1972.","title":"Reducibility among combinatorial problems","authors":"Richard M Karp","year":"1972","venue":"Proceedings of Complexity of Computer Computations","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Khintchine, 1924] Aleksandr Khintchine. Über einen Satz der Wahrscheinlichkeitsrechnung. Fundamenta Mathe- maticae, 1(6):9-20, 1924.","title":"Über einen Satz der Wahrscheinlichkeitsrechnung","authors":"Aleksandr Khintchine","year":"1924","venue":"Fundamenta Mathematicae","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kohler and Chandrasekaran, 1971] David A. Kohler and R. Chandrasekaran. A class of sequential games. Oper- ations Research, 19(2):270-277, 1971.","title":"A class of sequential games","authors":"David A Kohler, R Chandrasekaran","year":"1971","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kolliopoulos and Young, 2005] Stavros G. Kolliopoulos and Neal E. Young. Approximation algorithms for covering/packing integer programs. Journal of Computer and System Sciences, 71(4):495-505, 2005.","title":"Approximation algorithms for covering/packing integer programs","authors":"Stavros G Kolliopoulos, Neal E Young","year":"2005","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Kolmogoroff, 1929] A. Kolmogoroff. Über das Gesetz des iterierten Logarithmus. Mathematische Annalen, 101(1):126-135, 1929.","title":"Über das Gesetz des iterierten Logarithmus","authors":"A Kolmogoroff","year":"1929","venue":"Mathematische Annalen","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lovász, 1975] László Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13(4):383-390, 1975.","title":"On the ratio of optimal integral and fractional covers","authors":"László Lovász, Lovász","year":"1975","venue":"Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lund and Yannakakis, 1994] Carsten Lund and Mihalis Yannakakis. On the hardness of approximating minimiza- tion problems. Journal of the ACM, 41(5):960-981, 1994.","title":"On the hardness of approximating minimization problems","authors":"Yannakakis Lund, Carsten Lund, Mihalis Yannakakis","year":"1994","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Manurangsi and Suksompong, 2017] Pasin Manurangsi and Warut Suksompong. Computing an approximately optimal agreeable set of items. Preprint, 2017. http://arxiv.org/abs/1705.02748.","title":"Pasin Manurangsi and Warut Suksompong. Computing an approximately optimal agreeable set of items","authors":"Suksompong Manurangsi","year":"2017","venue":null,"doi":null,"url":"http://arxiv.org/abs/1705.02748","internal_url":null},{"position":24,"raw":"[Moshkovitz, 2015] Dana Moshkovitz. The Projection Games Conjecture and the NP-hardness of ln n- approximating set-cover. Theory of Computing, 11:221- 235, 2015.","title":"The Projection Games Conjecture and the NP-hardness of ln napproximating set-cover","authors":"Dana Moshkovitz","year":"2015","venue":"Theory of Computing","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Raz and Safra, 1997] Ran Raz and Shmuel Safra. A sub- constant error-probability low-degree test, and a sub- constant error-probability PCP characterization of NP. In STOC, pages 475-484, 1997.","title":"Ran Raz and Shmuel Safra. A subconstant error-probability low-degree test, and a subconstant error-probability PCP characterization of NP","authors":"Safra Raz","year":"1997","venue":"STOC","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Rees et al., 1999] Rolf S. Rees, Douglas R. Stinson, Ruizhong Wei, and G. H. John van Rees. An application of covering designs: Determining the maximum consistent set of shares in a threshold scheme. Ars Combinatoria, 53, 1999.","title":"An application of covering designs: Determining the maximum consistent set of shares in a threshold scheme","authors":"Rolf S Rees, Douglas R Stinson, Ruizhong Wei, G H John Van Rees","year":"1999","venue":"Ars Combinatoria","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Steinhaus, 1948] H. Steinhaus. The problem of fair divi- sion. Econometrica, 16(1):101-104, 1948.","title":"The problem of fair division","authors":"H Steinhaus","year":"1948","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Suksompong, 2016] Warut Suksompong. Assigning a small envy-free set of indivisible items to multiple players. In IJCAI, pages 489-495, 2016.","title":"Warut Suksompong. Assigning a small envy-free set of indivisible items to multiple players","authors":"Suksompong","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"Hal R. Varian. Equity, envy, and efficiency. Journal of Economic Theory, 9:63-91, 1974.","title":"Equity, envy, and efficiency","authors":"Hal R Varian","year":"1974","venue":"Journal of Economic Theory","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}