{"type":"ScholarlyArticle","title":"Multi-Winner Social Choice with Incomplete Preferences","authors":[{"name":"Tyler Lu","slug":"tyler-lu","given":"Tyler","family":"Lu","affiliation":"University of Toronto Department of Computer Science"},{"name":"Craig Boutilier","slug":"craig-boutilier","given":"Craig","family":"Boutilier","affiliation":"University of Toronto Department of Computer Science"}],"abstract":"Multi-winner social choice considers the problem of selecting a slate of K options to realize some social objective. It has found application in the construction of political legislatures and committees, product recommendation, and related problems, and has recently attracted attention from a computational perspective. We address the multi-winner problem when facing incomplete voter preferences, using the notion of minimax regret to determine a robust slate of options in the presence of preference uncertainty. We analyze the complexity of this problem and develop new exact and greedy robust optimization algorithms for its solution. Using these techniques, we also develop preference elicitation heuristics which, in practice, allow us to find near-optimal slates with considerable savings in the preference information required vis-a-vis complete votes.","doi":null,"url":"https://ijcai.org/proceedings/2013/48","pdf":"https://ijcai.org/proceedings/2013/0048.pdf","markdown":"https://ijcai.org/proceedings/2013/48.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/48","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":48,"pages":{"first":263,"last":269},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Betzler et al., 2011] Nadja Betzler, Arkadii Slinko, and Jo- hannes Uhlmann. On the computation of fully propor- tional representation. SSRN: 1952497, 2011.","title":"On the computation of fully proportional representation","authors":"Nadja Betzler, Arkadii Slinko, Johannes Uhlmann","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Boutilier et al., 2006] Craig Boutilier, Relu Patrascu, Pas- cal Poupart, and Dale Schuurmans. Constraint-based opti- mization and utility elicitation using the minimax decision criterion. Artifical Intelligence, 170(8-9):686-713, 2006.","title":"Constraint-based optimization and utility elicitation using the minimax decision criterion","authors":"Craig Boutilier, Relu Patrascu, Pascal Poupart, Dale Schuurmans","year":"2006","venue":"Artifical Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Braziunas and Boutilier, 2010] Darius Braziunas and Craig Boutilier. Assessing regret-based preference elicitation with the UTPREF recommendation system. In Proceed- ings of the Eleventh ACM Conference on Electronic Com- merce (EC'10), pages 219-228, Cambridge, MA, 2010.","title":"Assessing regret-based preference elicitation with the UTPREF recommendation system","authors":"Boutilier Braziunas, Darius Braziunas, Craig Boutilier","year":"2010","venue":"Proceed-ings of the Eleventh ACM Conference on Electronic Commerce (EC'10)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Chamberlin and Courant, 1983] John R. Chamberlin and Paul N. Courant. Representative deliberations and rep- resentative decisions: Proportional representation and the Borda rule. The American Political Science Review, 77(3):718-733, 1983.","title":"Representative deliberations and representative decisions: Proportional representation and the Borda rule","authors":"John R Chamberlin, Paul N Courant","year":"1983","venue":"The American Political Science Review","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cohen and Katzir, 2008] Reuven Cohen and Liran Katzir. The generalized maximum coverage problem. Inf. Pro- cess. Lett., 108(1):15-22, 2008.","title":"The generalized maximum coverage problem","authors":"Katzir Cohen, Reuven Cohen, Liran Katzir","year":"2008","venue":"Inf. Process. Lett","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Conitzer and Sandholm, 2005] Vincent Conitzer and Tuo- mas Sandholm. Communication complexity of common voting rules. In Proceedings of the Sixth ACM Conference on Electronic Commerce (EC'05), pages 78-87, Vancou- ver, 2005.","title":"Communication complexity of common voting rules","authors":"Sandholm Conitzer","year":"2005","venue":"Proceedings of the Sixth ACM Conference on Electronic Commerce (EC'05)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Drummond and Boutilier, 2013] Joanna Drummond and Craig Boutilier. Elicitation and approximately stable matching with partial preferences. In Proceedings of the Twenty-third International Joint Conference on Artificial Intelligence (IJCAI-13), Beijing, 2013. to appear.","title":"Elicitation and approximately stable matching with partial preferences","authors":"Joanna Drummond, Craig Boutilier","year":"2013","venue":"Proceedings of the Twenty-third International Joint Conference on Artificial Intelligence (IJCAI-13)","doi":null,"url":null,"internal_url":"/proceedings/2013/26"},{"position":8,"raw":"[Goundan and Schulz, 2007] Pranava R. Goundan and An- dreas S. Schulz. Revisiting the greedy approach to sub- modular set function maximization. Optimization Online, 2007.","title":"Revisiting the greedy approach to submodular set function maximization","authors":"R Pranava, Andreas S Goundan, Schulz","year":"2007","venue":"Optimization Online","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Hajiaghayi et al., 2003] Mohammad Taghi Hajiaghayi, Mo- hammad Mahdian, and Vahab S. Mirrokni. The facility location problem with general cost functions. Networks, 42(1):42-47, 2003.","title":"The facility location problem with general cost functions","authors":"Mohammad Taghi, Hajiaghayi, Mohammad Mahdian, Vahab S Mirrokni","year":"2003","venue":"Networks","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Kalech et al., 2011] Meir Kalech, Sarit Kraus, Gal A. Kaminka, and Claudia V. Goldman. Practical voting rules with partial information. Journal of Autonomous Agents and Multi-Agent Systems, 22(1):151-182, 2011.","title":"Practical voting rules with partial information","authors":"Meir Kalech, Sarit Kraus, Gal A Kaminka, Claudia V Goldman","year":"2011","venue":"Journal of Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Kamishima et al., 2005] Toshihiro Kamishima, Hideto Kazawa, and Shotaro Akaho. Supervised ordering: An empirical survey. In IEEE International Conference on Data Mining, pages 673-676, Los Alamitos, CA, USA, 2005. IEEE Computer Society.","title":"Supervised ordering: An empirical survey","authors":"Kamishima","year":"2005","venue":"IEEE International Conference on Data Mining","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Kleinberg et al., 2004] Jon Kleinberg, Christos Papadim- itriou, and Prabhakar Raghavan. Segmentation problems. Journal of the ACM, 51:263-280, 2004.","title":"Jon Kleinberg, Christos Papadimitriou, and Prabhakar Raghavan","authors":"Kleinberg","year":"2004","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Konczak and Lang, 2005] Kathrin Konczak and Jérôme Lang. Voting procedures with incomplete preferences. In IJCAI-05 Workshop on Advances in Preference Handling, pages 124-129, Edinburgh, 2005.","title":"Voting procedures with incomplete preferences","authors":"Kathrin Konczak, Jérôme Lang","year":"2005","venue":"IJCAI-05 Workshop on Advances in Preference Handling","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Lu and Boutilier, 2011a] Tyler Lu and Craig Boutilier. Bud- geted social choice: From consensus to personalized de- cision making. In Proceedings of the Twenty-second International Joint Conference on Artificial Intelligence (IJCAI-11), pages 280-286, Barcelona, 2011.","title":"Budgeted social choice: From consensus to personalized decision making","authors":"Lu, Boutilier, Tyler Lu, Craig Boutilier","year":"2011","venue":"Proceedings of the Twenty-second International Joint Conference on Artificial Intelligence (IJCAI-11)","doi":null,"url":null,"internal_url":"/proceedings/2011/57"},{"position":15,"raw":"[Lu and Boutilier, 2011b] Tyler Lu and Craig Boutilier. Ro- bust approximation and incremental elicitation in voting protocols. In Proceedings of the Twenty-second Interna- tional Joint Conference on Artificial Intelligence (IJCAI- 11), pages 287-293, Barcelona, 2011.","title":"Robust approximation and incremental elicitation in voting protocols","authors":"Lu, Boutilier, Tyler Lu, Craig Boutilier","year":"2011","venue":"Proceedings of the Twenty-second International Joint Conference on Artificial Intelligence (IJCAI-11)","doi":null,"url":null,"internal_url":"/proceedings/2011/58"},{"position":16,"raw":"[Lu and Boutilier, 2011c] Tyler Lu and Craig Boutilier. Vote elicitation with probabilistic preference models: Empiri- cal estimation and cost tradeoffs. In Proceedings of the Second International Conference on Algorithmic Decision Theory (ADT-11), pages 135-149, Piscataway, NJ, 2011.","title":"Vote elicitation with probabilistic preference models: Empirical estimation and cost tradeoffs","authors":"Lu, Boutilier, Tyler Lu, Craig Boutilier","year":"2011","venue":"Proceedings of the Second International Conference on Algorithmic Decision Theory (ADT-11)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lucier and Oren, 2012] Brendan Lucier and Joel Oren. On- line (budgeted) social choice. In Proceedings of the Fourth International Workshop on Computational Social Choice (COMSOC-2012), Kraków, Poland, 2012.","title":"Online (budgeted) social choice","authors":"Brendan Lucier, Joel Oren","year":"2012","venue":"Proceedings of the Fourth International Workshop on Computational Social Choice (COMSOC-2012)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Mallows, 1957] Colin L. Mallows. Non-null ranking mod- els. Biometrika, 44:114-130, 1957.","title":"Non-null ranking models","authors":"Colin L Mallows","year":"1957","venue":"Biometrika","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Marden, 1995] John I. Marden. Analyzing and Modeling Rank Data. Chapman and Hall, London, 1995.","title":"Analyzing and Modeling Rank Data","authors":"John I Marden","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Meir et al., 2008] Reshef Meir, Ariel D. Procaccia, Jef- frey S. Rosenschein, and Aviv Zohar. Complexity of strategic behavior in multi-winner elections. Journal of Artificial Intelligence Research (JAIR), 33:149-178, 2008.","title":"Complexity of strategic behavior in multi-winner elections","authors":"Reshef Meir, Ariel D Procaccia, Jeffrey S Rosenschein, Aviv Zohar","year":"2008","venue":"Journal of Artificial Intelligence Research (JAIR)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Monroe, 1995] Burt L. Monroe. Fully proportional rep- resentation. The American Political Science Review, 89(4):925-940, 1995.","title":"Fully proportional representation","authors":"L Burt, Monroe","year":"1995","venue":"The American Political Science Review","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Oren et al., 2013] Joel Oren, Yuval Filmus, and Craig Boutilier. Efficient vote elicitation under candidate un- certainty. In Proceedings of the Twenty-third Interna- tional Joint Conference on Artificial Intelligence (IJCAI- 13), Beijing, 2013. to appear.","title":"Efficient vote elicitation under candidate uncertainty","authors":"Joel Oren, Yuval Filmus, Craig Boutilier","year":"2013","venue":"Proceedings of the Twenty-third International Joint Conference on Artificial Intelligence (IJCAI-13)","doi":null,"url":null,"internal_url":"/proceedings/2013/54"},{"position":23,"raw":"[Potthoff and Brams, 1998] Richard F. Potthoff and Steven J. Brams. Proportional representation: Broadening the op- tions. Journal of Theoretical Politics, 10(2):147-178, 1998.","title":"Proportional representation: Broadening the options","authors":"Richard F Potthoff, Steven J Brams","year":"1998","venue":"Journal of Theoretical Politics","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Procaccia et al., 2008] Ariel D. Procaccia, Jeffrey S. Rosen- schein, and Aviv Zohar. On the complexity of achieving proportional representation. Social Choice and Welfare, 30:353-362, 2008.","title":"On the complexity of achieving proportional representation","authors":"Ariel D Procaccia, Jeffrey S Rosenschein, Aviv Zohar","year":"2008","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Skowron et al., 2013] Piotr Skowron, Piotr Faliszewski, and Arkadii Slinko. Achieving proportional representation is easy in practice. In Proceedings of the Twelfth Interna- tional Joint Conference on Autonomous Agents and Mul- tiagent Systems (AAMAS-13), St.","title":"Achieving proportional representation is easy in practice","authors":"Piotr Skowron, Piotr Faliszewski, Arkadii Slinko","year":null,"venue":"Proceedings of the Twelfth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-13)","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"Paul, MN, 2013. To ap- pear.","title":null,"authors":"M N Paul","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Xia and Conitzer, 2008] Lirong Xia and Vincent Conitzer. Determining possible and necessary winners under com- mon voting rules given partial orders. In Proceedings of the Twenty-third AAAI Conference on Artificial Intel- ligence (AAAI-08), pages 202-207, Chicago, 2008.","title":"Determining possible and necessary winners under common voting rules given partial orders","authors":"Lirong Xia, Vincent Conitzer","year":"2008","venue":"Proceedings of the Twenty-third AAAI Conference on Artificial Intelligence (AAAI-08)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}