{"type":"ScholarlyArticle","title":"Fair and Efficient Social Choice in Dynamic Settings","authors":[{"name":"Rupert Freeman","slug":"rupert-freeman","given":"Rupert","family":"Freeman","affiliation":"Department of Computer Science Duke University Durham , NC 27708 , USA"},{"name":"Seyed Majid Zahedi","slug":"seyed-majid-zahedi","given":"Seyed Majid","family":"Zahedi","affiliation":"Department of Computer Science Duke University Durham , NC 27708 , USA"},{"name":"Vincent Conitzer","slug":"vincent-conitzer","given":"Vincent","family":"Conitzer","affiliation":"Department of Computer Science Duke University Durham , NC 27708 , USA"}],"abstract":"We study a dynamic social choice problem in which an alternative is chosen at each round according to the reported valuations of a set of agents. In the interests of obtaining a solution that is both efficient and fair, we aim to maximize the long-term Nash social welfare, which is the product of all agents' utilities. We present and analyze two greedy algorithms for this problem, including the classic Proportional Fair (PF) algorithm. We analyze several versions of the algorithms and how they relate, and provide an axiomatization of PF. Finally, we evaluate the algorithms on data gathered from a computer systems application.","doi":"10.24963/ijcai.2017/639","url":"https://ijcai.org/proceedings/2017/639","pdf":"https://ijcai.org/proceedings/2017/0639.pdf","markdown":"https://ijcai.org/proceedings/2017/639.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/639","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":"Uncertainty in AI","track":"Main track","number":639,"pages":{"first":4580,"last":4587},"keywords":["Uncertainty in AI: Sequential Decision Making","Agent-based and Multi-agent Systems: Social Choice Theory"],"videos":[],"references":[{"position":1,"raw":"[Agrawal and Devanur, 2015] Shipra Agrawal and Nikhil R Deva- nur. Fast algorithms for online stochastic convex programming. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Sympo- sium on Discrete Algorithms, pages 1405-1424. SIAM, 2015.","title":"Fast algorithms for online stochastic convex programming","authors":"Shipra Agrawal, Nikhil R Devanur","year":"2015","venue":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Aleksandrov et al., 2015] Martin Aleksandrov, Haris Aziz, Serge Gaspers, and Toby Walsh. Online fair division: analysing a food bank problem. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI-15), 2015.","title":"Online fair division: analysing a food bank problem","authors":"Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh","year":"2015","venue":"Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI-15)","doi":null,"url":null,"internal_url":"/proceedings/2015/360"},{"position":3,"raw":"[Aziz et al., 2017] Haris Aziz, Markus Brill, Vincent Conitzer, Edith Elkind, Rupert Freeman, and Toby Walsh. Justified rep- resentation in approval-based committee voting. Social Choice and Welfare, 48(2):461-485, 2017.","title":"Justified representation in approval-based committee voting","authors":"Haris Aziz, Markus Brill, Vincent Conitzer, Edith Elkind, Rupert Freeman, Toby Walsh","year":"2017","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Boutilier and Procaccia, 2012] Craig Boutilier and Ariel D Pro- caccia. A dynamic rationalization of distance rationalizability. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, pages 1278-1284, 2012.","title":"A dynamic rationalization of distance rationalizability","authors":"Craig Boutilier, Ariel D Procaccia","year":"2012","venue":"Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Brams et al., 2007] Steven J Brams, D Marc Kilgour, and M Remzi Sanver. A minimax procedure for electing committees. Public Choice, 132(3-4):401-420, 2007.","title":"A minimax procedure for electing committees","authors":"D Steven J Brams, M Remzi Marc Kilgour, Sanver","year":"2007","venue":"Public Choice","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Caragiannis et al., 2012] Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, and Jeffrey S. Rosen- schein. On the approximability of Dodgson and Young elections. Artificial Intelligence, 187-188:31-51, 2012.","title":"On the approximability of Dodgson and Young elections","authors":"Ioannis Caragiannis, Jason A Covey, Michal Feldman, Christopher M Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D Procaccia, Jeffrey S Rosenschein","year":"2012","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Caragiannis et al., 2014] Ioannis Caragiannis, Christos Kaklama- nis, Nikos Karanikolas, and Ariel D Procaccia. Socially desirable approximations for Dodgson's voting rule. ACM Transactions on Algorithms, 10(2): article 6, 2014.","title":"Socially desirable approximations for Dodgson's voting rule","authors":"Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D Procaccia","year":"2014","venue":"ACM Transactions on Algorithms","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 Proceedings of the 17th ACM conference on Electronic Com- merce, 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":"Proceedings of the 17th ACM conference on Electronic Commerce","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Chamberlin and Courant, 1983] John R Chamberlin and Paul N Courant. Representative deliberations and representative deci- sions: Proportional representation and the Borda rule. American Political Science Review, 77(03):718-733, 1983.","title":"Representative deliberations and representative decisions: Proportional representation and the Borda rule","authors":"Paul N John R Chamberlin, Courant","year":"1983","venue":"American Political Science Review","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Cole and Gkatzelis, 2015] Richard Cole and Vasilis Gkatzelis. Ap- proximating the Nash social welfare with indivisible items. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, pages 371-380. ACM, 2015.","title":"Approximating the Nash social welfare with indivisible items","authors":"Richard Cole, Vasilis Gkatzelis","year":"2015","venue":"Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Conitzer et al., 2017] Vincent Conitzer, Rupert Freeman, and Nis- arg Shah. Fair public decision making. In Proceedings of the 18th ACM Conference on Electronic Commerce, 2017. Forthcoming.","title":"Fair public decision making","authors":"Conitzer","year":"2017","venue":"Proceedings of the 18th ACM Conference on Electronic Commerce","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Darmann and Schauer, 2015] Andreas Darmann and Joachim Schauer. Maximizing Nash product social welfare in allocating indivisible goods. European Journal of Operational Research, 247(2):548-559, 2015.","title":"Maximizing Nash product social welfare in allocating indivisible goods","authors":"Schauer Darmann, Andreas Darmann, Joachim Schauer","year":"2015","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Elkind et al., 2014] Edith Elkind, Piotr Faliszewski, Piotr Skowron, and Arkadii Slinko. Properties of multiwinner voting rules. In Proceedings of the Thirteenth International Conference on Autonomous Agents and Multiagent Systems, pages 53-60, 2014.","title":"Properties of multiwinner voting rules","authors":"Elkind","year":"2014","venue":"Proceedings of the Thirteenth International Conference on Autonomous Agents and Multiagent Systems","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Ghodsi et al., 2011] Ali Ghodsi, Matei Zaharia, Benjamin Hind- man, Andy Konwinski, Scott Shenker, and Ion Stoica. Dominant resource fairness: Fair allocation of multiple resource types. Pro- ceedings of the 8th USENIX conference on Networked systems design and implementation, pages 24-24, 2011.","title":"Dominant resource fairness: Fair allocation of multiple resource types","authors":"Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, Ion Stoica","year":"2011","venue":"Proceedings of the 8th USENIX conference on Networked systems design and implementation","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Guo et al., 2009] Mingyu Guo, Vincent Conitzer, and Daniel M. Reeves. Competitive repeated allocation without payments. In Proceedings of the Fifth Workshop on Internet and Network Eco- nomics (WINE), pages 244-255, Rome, Italy, 2009.","title":"Competitive repeated allocation without payments","authors":"Mingyu Guo, Vincent Conitzer, Daniel M Reeves","year":"2009","venue":"Proceedings of the Fifth Workshop on Internet and Network Economics (WINE)","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Jalali et al., 2000] A. Jalali, R. Padovani, and R. Pankaj. Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system. In Proceedings of the IEEE Vehicular Technology Conference, pages 1854-1858. IEEE, 2000.","title":"Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system","authors":"A Jalali, R Padovani, R Pankaj","year":"2000","venue":"Proceedings of the IEEE Vehicular Technology Conference","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kash et al., 2014] Ian Kash, Ariel D Procaccia, and Nisarg Shah. No agent left behind: Dynamic fair division of multiple re- sources. Journal of Artificial Intelligence Research, pages 579- 603, 2014.","title":"No agent left behind: Dynamic fair division of multiple resources","authors":"Ian Kash, Ariel D Procaccia, Nisarg Shah","year":"2014","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Monroe, 1995] Burt L Monroe. Fully proportional representation. American Political Science Review, 89(04):925-940, 1995.","title":"Fully proportional representation","authors":"Monroe Burt","year":"1995","venue":"American Political Science Review","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Nash, 1950] John Nash. The bargaining problem. Econometrica, 18(2):155-162, 1950.","title":"John Nash. The bargaining problem","authors":"Nash","year":"1950","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Nemhauser and Wolsey, 1988] George L Nemhauser and Lau- rence A Wolsey. Integer and combinatorial optimization. inter- science series in discrete mathematics and optimization. ed: John Wiley & Sons, 1988.","title":"Integer and combinatorial optimization. interscience series in discrete mathematics and optimization","authors":"L George, Laurence A Nemhauser, Wolsey","year":"1988","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Parkes and Procaccia, 2013] David C Parkes and Ariel D Procac- cia. Dynamic social choice with evolving preferences. In Pro- ceedings of the Twenty-Seventh AAAI Conference on Artificial In- telligence, pages 767-773, 2013.","title":"Dynamic social choice with evolving preferences","authors":"C David, Ariel D Parkes, Procaccia","year":"2013","venue":"Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Parkes et al., 2010] David C Parkes, Ruggiero Cavallo, Florin Constantin, and Satinder Singh. Dynamic incentive mechanisms. AI Magazine, 31(4):79-94, 2010.","title":"Dynamic incentive mechanisms","authors":"Ruggiero David C Parkes, Florin Cavallo, Satinder Constantin, Singh","year":"2010","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Parkes et al., 2012] David C Parkes, Ariel D Procaccia, and Nis- arg Shah. Beyond dominant resource fairness: Extensions, lim- itations, and indivisibilities. In ACM Conference on Electronic Commerce, pages 808-825. ACM, 2012.","title":"Beyond dominant resource fairness: Extensions, limitations, and indivisibilities","authors":"Ariel D David C Parkes, Nisarg Procaccia, Shah","year":"2012","venue":"ACM Conference on Electronic Commerce","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Procaccia, 2013] Ariel D Procaccia. Cake cutting: not just child's play. Communications of the ACM, 56(7):78-87, 2013.","title":"Cake cutting: not just child's play","authors":"D Ariel, Procaccia","year":"2013","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Ramezani and Endriss, 2010] Sara Ramezani and Ulle Endriss. Nash social welfare in multiagent resource allocation. In Agent- Mediated Electronic Commerce. Designing Trading Strate- gies and Mechanisms for Electronic Markets, pages 117-131. Springer, 2010.","title":"Nash social welfare in multiagent resource allocation","authors":"Sara Ramezani, Ulle Endriss","year":"2010","venue":"Agent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Viswanath et al., 2002] Pramod Viswanath, David NC Tse, and Rajiv Laroia. Opportunistic beamforming using dumb anten- nas. IEEE Transactions on Information Theory, 48(6):1277- 1294, 2002.","title":"Opportunistic beamforming using dumb antennas","authors":"Pramod Viswanath, David Nc Tse, Rajiv Laroia","year":"2002","venue":"IEEE Transactions on Information Theory","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Zaharia et al., 2010] Matei Zaharia, Mosharaf Chowdhury, Michael J Franklin, Scott Shenker, and Ion Stoica. Spark: Cluster computing with working sets. In Proceedings of the 2nd USENIX Conference on Hot Topics in Cloud Computing, volume 10, page 10, 2010.","title":"Spark: Cluster computing with working sets","authors":"Matei Zaharia, Mosharaf Chowdhury, J Michael, Scott Franklin, Ion Shenker, Stoica","year":"2010","venue":"Proceedings of the 2nd USENIX Conference on Hot Topics in Cloud Computing","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}