{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:33:47Z","timestamp":1770064427112,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10458-020-09445-y","type":"journal-article","created":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T15:45:16Z","timestamp":1582040716000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Computing and testing Pareto optimal committees"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9757-4956","authenticated-orcid":false,"given":"Haris","family":"Aziz","sequence":"first","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,17]]},"reference":[{"key":"9445_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00355-019-01208-3","volume":"54","author":"H Aziz","year":"2020","unstructured":"Aziz, H., & Lee, B. E. (2020). The expanding approvals rule: Improving proportional representation and monotonicity. Social Choice and Welfare, 54, 1\u201345.","journal-title":"Social Choice and Welfare"},{"key":"9445_CR2","unstructured":"Aziz, H., & Savani, R. (2016). Hedonic games. In F.\u00a0Brandt, V.\u00a0Conitzer, U.\u00a0Endriss, J.\u00a0Lang, & A.\u00a0D. Procaccia (Eds.), Handbook of computational social choice, chapter\u00a015. Cambridge: Cambridge University Press."},{"issue":"3","key":"9445_CR3","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.econlet.2013.09.006","volume":"121","author":"H Aziz","year":"2013","unstructured":"Aziz, H., Brandt, F., & Brill, M. (2013a). The computational complexity of random serial dictatorship. Economics Letters, 121(3), 341\u2013345.","journal-title":"Economics Letters"},{"key":"9445_CR4","unstructured":"Aziz, H., Brandt, F., & Brill, M. (2013b) On the tradeoff between economic efficiency and strategyproofness in randomized social choice. In Proceedings of the 12th international conference on autonomous agents and multi-agent systems (AAMAS) (pp. 455\u2013462). IFAAMAS."},{"key":"9445_CR5","unstructured":"Aziz, H., Lang, J., & Monnot, J. (2016). Computing pareto optimal committees. In Proceedings of the 25th international joint conference on artificial intelligence (IJCAI) (pp. 60\u201366)."},{"key":"9445_CR6","doi-asserted-by":"crossref","unstructured":"Aziz, H., Elkind, E., Faliszewski, P., Lackner, M., & Skowron, P. (2017). The Condorcet principle for multiwinner elections: From shortlisting to proportionality. In Proceedings of the 26th international joint conference on artificial intelligence (IJCAI).","DOI":"10.24963\/ijcai.2017\/13"},{"key":"9445_CR7","unstructured":"Aziz, H., Brandt, F., Elkind, E., & Skowron, P. (2018). Computational social choice: The first ten years and beyond. In B.\u00a0Steffen & G.\u00a0Woeginger (Eds.), Computing and software science, volume 10000 of Lecture notes in computer science (LNCS). Berlin: Springer."},{"key":"9445_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2019.05.011","volume":"790","author":"H Aziz","year":"2019","unstructured":"Aziz, H., Biro, P., Lang, J., Lesca, J., & Monnot, J. (2019). Efficient reallocation under additive and ordinal preferences. Theoretical Computer Science, 790, 1\u201315.","journal-title":"Theoretical Computer Science"},{"key":"9445_CR9","unstructured":"Barber\u00e0, S., Bossert, W., & Pattanaik, P.K. (2004). Ranking sets of objects. In S.\u00a0Barber\u00e0, P.\u00a0J. Hammond, & C.\u00a0Seidl (Eds.), Handbook of utility theory (Vol. II, chapter\u00a017, pp. 893\u2013977). Dordrecht: Kluwer Academic Publishers."},{"issue":"2","key":"9445_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.geb.2010.02.010","volume":"70","author":"J-P Beno\u00eet","year":"2010","unstructured":"Beno\u00eet, J.-P., & Kornhauser, L. (2010). Only a dictatorship is efficient. Games and Economic Behavior, 70(2), 261\u2013270.","journal-title":"Games and Economic Behavior"},{"key":"9445_CR11","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1613\/jair.3896","volume":"47","author":"N Betzler","year":"2013","unstructured":"Betzler, N., Slinko, A., & Uhlmann, J. (2013). On the computation of fully proportional representation. Journal of Artificial Intelligence Research, 47, 475\u2013519.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9445_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01082056","volume":"39","author":"W Bossert","year":"1995","unstructured":"Bossert, W. (1995). Preference extension rules for ranking sets of alternatives with a fixed cardinality. Theory and Decision, 39, 301\u2013317.","journal-title":"Theory and Decision"},{"issue":"132","key":"9445_CR13","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s11127-007-9165-x","volume":"3\u20134","author":"S Brams","year":"2007","unstructured":"Brams, S., Kilgour, D., & Sanver, R. (2007). A minimax procedure for electing committees. Public Choice, 3\u20134(132), 401\u2013420.","journal-title":"Public Choice"},{"key":"9445_CR14","unstructured":"Brandl, F. (2013). Efficiency and incentives in randomized social choice. Master\u2019s thesis, Technische Universit\u00e4t M\u00fcnchen."},{"key":"9445_CR15","doi-asserted-by":"crossref","unstructured":"Brandt, F., & Brill, M. (2011). Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions. In Proceedings of the 13th conference on theoretical aspects of rationality and knowledge (TARK) (pp. 136\u2013142). ACM Press.","DOI":"10.1145\/2000378.2000394"},{"key":"9445_CR16","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kalaitzis, D., & Markakis, E. (2010). Approximation algorithms and mechanism design for minimax approval voting. In Proceedings of the 24th AAAI conference on artificial intelligence (AAAI) (pp. 737\u2013742).","DOI":"10.1609\/aaai.v24i1.7615"},{"key":"9445_CR17","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/978-0-387-30162-4_397","volume-title":"Encyclopedia of algorithms","author":"K Cechl\u00e1rov\u00e1","year":"2008","unstructured":"Cechl\u00e1rov\u00e1, K. (2008). Stable partition problem. In M.-Y. Kao (Ed.), Encyclopedia of algorithms (pp. 885\u2013888). Berlin: Springer."},{"issue":"3","key":"9445_CR18","doi-asserted-by":"publisher","first-page":"718","DOI":"10.2307\/1957270","volume":"77","author":"JR Chamberlin","year":"1983","unstructured":"Chamberlin, J. R., & Courant, P. N. (1983). Representative deliberations and representative decisions: proportional representation and the Borda rule. American Political Science Review, 77(3), 718\u2013733.","journal-title":"American Political Science Review"},{"key":"9445_CR19","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.geb.2015.12.003","volume":"95","author":"WJ Cho","year":"2016","unstructured":"Cho, W. J. (2016). Incentive properties for ordinal mechanisms. Games and Economic Behavior, 95, 168\u2013177.","journal-title":"Games and Economic Behavior"},{"issue":"4","key":"9445_CR20","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s11238-011-9286-z","volume":"72","author":"T Cuhadaro\u01e7lu","year":"2012","unstructured":"Cuhadaro\u01e7lu, T., & Lain\u00e9, J. (2012). Pareto efficiency in multiple referendum. Theory and Decision, 72(4), 525\u2013536.","journal-title":"Theory and Decision"},{"issue":"3","key":"9445_CR21","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.mathsocsci.2013.06.004","volume":"66","author":"A Darmann","year":"2013","unstructured":"Darmann, A. (2013). How hard is it to tell which is a condorcet committee? Mathematical Social Sciences, 66(3), 282\u2013292. https:\/\/doi.org\/10.1016\/j.mathsocsci.2013.06.004.","journal-title":"Mathematical Social Sciences"},{"key":"9445_CR22","doi-asserted-by":"crossref","unstructured":"de Keijzer, B., Bouveret, S., Klos, T., & Zhang, Y. (2009). On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences. In Proceedings of the 1st international conference on algorithmic decision theory (pp. 98\u2013110).","DOI":"10.1007\/978-3-642-04428-1_9"},{"key":"9445_CR23","doi-asserted-by":"crossref","unstructured":"Elkind, E., & Ismaili, A. (2015) OWA-based extensions of the Chamberlin-Courant rule. In Proceedings of the 4th international conference on algorithmic decision theory (ADT) (pp. 486\u2013502). Berlin: Springer.","DOI":"10.1007\/978-3-319-23114-3_29"},{"key":"9445_CR24","unstructured":"Elkind, E., Faliszewski, P., Skowron, P., & Slinko, A. (2014). Properties of multiwinner voting rules. In Proceedings of the 13th international conference on autonomous agents and multi-agent systems (AAMAS) (pp. 53\u201360)."},{"issue":"3","key":"9445_CR25","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s00355-014-0853-4","volume":"44","author":"E Elkind","year":"2015","unstructured":"Elkind, E., Lang, J., & Saffidine, A. (2015). Condorcet winning sets. Social Choice and Welfare, 44(3), 493\u2013517.","journal-title":"Social Choice and Welfare"},{"key":"9445_CR26","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., & Talmon, N. (2016). Multiwinner analogues of the plurality rule: Axiomatic and algorithmic views. In Proceedings of the 28th AAAI conference on artificial intelligence (AAAI).","DOI":"10.1609\/aaai.v30i1.10031"},{"key":"9445_CR27","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., & Talmon, N. (2017) Multiwinner voting: A new challenge for social choice theory. In U.\u00a0Endriss (Ed.), Trends in computational social choice, chapter\u00a02."},{"key":"9445_CR28","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W.H. Freeman."},{"issue":"1","key":"9445_CR29","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.mathsocsci.2011.11.006","volume":"64","author":"C Klamler","year":"2012","unstructured":"Klamler, C., Pferschy, U., & Ruzika, S. (2012). Committee selection under weight constraints. Mathematical Social Sciences, 64(1), 48\u201356.","journal-title":"Mathematical Social Sciences"},{"key":"9445_CR30","doi-asserted-by":"crossref","unstructured":"Lang, J., Mengin, J., & Xia, L. (2012). Aggregating conditionally lexicographic preferences on multi-issue domains. In Proceedings of the international conference on principles and practice of constraint programming (pp. 973\u2013987).","DOI":"10.1007\/978-3-642-33558-7_69"},{"key":"9445_CR31","unstructured":"Lu, T., & Boutilier, C. (2011). Budgeted social choice: From consensus to personalized decision making. In Proceedings of the 22nd international joint conference on artificial intelligence (IJCAI) (pp. 280\u2013286). AAAI Press."},{"issue":"4","key":"9445_CR32","doi-asserted-by":"publisher","first-page":"925","DOI":"10.2307\/2082518","volume":"89","author":"BL Monroe","year":"1995","unstructured":"Monroe, B. L. (1995). Fully proportional representation. The American Political Science Review, 89(4), 925\u2013940.","journal-title":"The American Political Science Review"},{"key":"9445_CR33","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2954.001.0001","volume-title":"Fair division and collective welfare","author":"H Moulin","year":"2003","unstructured":"Moulin, H. (2003). Fair division and collective welfare. Cambridge: The MIT Press."},{"key":"9445_CR34","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00355-006-0101-7","volume":"27","author":"\u0130 \u00d6zkal-Sanver","year":"2006","unstructured":"\u00d6zkal-Sanver, \u0130., & Sanver, R. (2006). Ensuring Pareto-optimality by referendum voting. Social Choice and Welfare, 27, 211\u2013219.","journal-title":"Social Choice and Welfare"},{"key":"9445_CR35","unstructured":"Peters, D. (2018). Proportionality and strategyproofness in multiwinner elections. In Proceedings of the 17th international conference on autonomous agents and multi-agent systems (AAMAS) (vol. 1549\u20131557)."},{"key":"9445_CR36","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00355-007-0235-2","volume":"30","author":"AD Procaccia","year":"2008","unstructured":"Procaccia, A. D., Rosenschein, J. S., & Zohar, A. (2008). On the complexity of achieving proportional representation. Social Choice and Welfare, 30, 353\u2013362.","journal-title":"Social Choice and Welfare"},{"key":"9445_CR37","doi-asserted-by":"publisher","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-sided matching: A study in game theoretic modelling and analysis","author":"AE Roth","year":"1990","unstructured":"Roth, A. E., & Sotomayor, M. A. O. (1990). Two-sided matching: A study in game theoretic modelling and analysis. Cambridge: Cambridge University Press."},{"key":"9445_CR38","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.artint.2015.01.003","volume":"222","author":"P Skowron","year":"2015","unstructured":"Skowron, P., Faliszewski, P., & Slinko, A. (2015a). Achieving fully proportional representation: Approximability results. Artificial Intelligence, 222, 67\u2013103.","journal-title":"Artificial Intelligence"},{"key":"9445_CR39","doi-asserted-by":"crossref","unstructured":"Skowron, P.\u00a0K., Faliszewski, P., & Lang, J. (2015b). Finding a collective set of items: From proportional multirepresentation to group recommendation. In Proceedings of the 23rd international joint conference on artificial intelligence (IJCAI) (pp. 2131\u20132137). AAAI Press","DOI":"10.1609\/aaai.v29i1.9431"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-020-09445-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-020-09445-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-020-09445-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T22:00:40Z","timestamp":1665871240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-020-09445-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,17]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["9445"],"URL":"https:\/\/doi.org\/10.1007\/s10458-020-09445-y","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,17]]},"assertion":[{"value":"17 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"24"}}