{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:41:58Z","timestamp":1743032518836,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319231136"},{"type":"electronic","value":"9783319231143"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23114-3_28","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T09:01:33Z","timestamp":1440666093000},"page":"469-485","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Winner Determination and Manipulation in Minisum and Minimax Committee Elections"],"prefix":"10.1007","author":[{"given":"Dorothea","family":"Baumeister","sequence":"first","affiliation":[]},{"given":"Sophie","family":"Dennisen","sequence":"additional","affiliation":[]},{"given":"Lisa","family":"Rey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"issue":"3","key":"28_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J Bartholdi III","year":"1989","unstructured":"Bartholdi III, J., Tovey, C., Trick, M.: The computational difficulty of manipulating an election. Soc. Choice Welfare 6(3), 227\u2013241 (1989)","journal-title":"Soc. Choice Welfare"},{"key":"28_CR2","unstructured":"Baumeister, D., Dennisen, S.: Voter dissatisfaction in committee elections. In: Proceedings of the 14th International Joint Conference on Autonomous Agents and Multiagent Systems, IFAAMAS. Extended abstract (2015)"},{"key":"28_CR3","unstructured":"Betzler, N., Niedermeier, R., Woeginger, G.: Unweighted coalitional manipulation under the borda rule is NP-hard. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI, pp. 55\u201360 (2011)"},{"key":"28_CR4","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.: On the computation of fully proportional representation. J. Artif. Intell. Res. 47, 475\u2013519 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"28_CR5","unstructured":"Borda, J.: M\u00e9moire sur les \u00e9lections au scrutin. Histoire de L\u2019Acad\u00e9mie Royale des Sciences, Paris. English translation appears in [19] (1781)"},{"key":"28_CR6","volume-title":"Handbook of Computational Social Choice, Chapter 10","author":"C Boutilier","year":"2015","unstructured":"Boutilier, C., Rosenschein, J.: Incomplete information and communication in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, Chapter 10. Cambridge University Press, Cambridge (2015)"},{"key":"28_CR7","volume-title":"Reasoned Choices: Essays in Honor of Hannu Nurmi","author":"S Brams","year":"2004","unstructured":"Brams, S., Kilgour, D., Sanver, R.: A minimax procedure for negotiating multilateral treaties. In: Wiberg, M. (ed.) Reasoned Choices: Essays in Honor of Hannu Nurmi. Finnish Political Science Association, Turku (2004)"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s11127-007-9165-x","volume":"132","author":"S Brams","year":"2007","unstructured":"Brams, S., Kilgour, D., Sanver, R.: A minimax procedure for electing committees. Public Choice 132, 401\u2013420 (2007)","journal-title":"Public Choice"},{"key":"28_CR9","volume-title":"Diplomacy Games: Formal Models and International Negotiations","author":"S Brams","year":"2007","unstructured":"Brams, S., Kilgour, D., Sanver, R.: A minimax procedure for negotiating multilateral treaties. In: Avenhus, R., Zartmann, I. (eds.) Diplomacy Games: Formal Models and International Negotiations. Springer, Heidelberg (2007)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-13129-0_15","volume-title":"Web and Internet Economics","author":"J Byrka","year":"2014","unstructured":"Byrka, J., Sornat, K.: PTAS for minimax approval voting. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 203\u2013217. Springer, Heidelberg (2014)"},{"key":"28_CR11","volume-title":"Handbook of Computational Social Choice, Chapter 5","author":"I Caragiannis","year":"2015","unstructured":"Caragiannis, I., Hemaspaandra, E., Hemaspaandra, L.: Dodgson\u2019s rule and Young\u2019s rule. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, Chapter 5. Cambridge University Press, Cambridge (2015)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kalaitzis, D., Markakis, E.: Approximation algorithms and mechanism design for minimax approval voting. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence, pp. 737\u2013742, AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7615"},{"issue":"3","key":"28_CR13","doi-asserted-by":"publisher","first-page":"718","DOI":"10.2307\/1957270","volume":"77","author":"J Chamberlin","year":"1983","unstructured":"Chamberlin, J., Courant, P.: Representative deliberations and representative decisions: proportional representation and the Borda rule. Am. Polit. Sci. Rev. 77(3), 718\u2013733 (1983)","journal-title":"Am. Polit. Sci. Rev."},{"issue":"3","key":"28_CR14","doi-asserted-by":"publisher","first-page":"Article 14","DOI":"10.1145\/1236457.1236461","volume":"54","author":"V Conitzer","year":"2007","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? J. ACM 54(3), Article 14 (2007)","journal-title":"J. ACM"},{"key":"28_CR15","volume-title":"Handbook of Computational Social Choice, Chapter 6","author":"V Conitzer","year":"2015","unstructured":"Conitzer, V., Walsh, T.: Barriers to manipulation in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, Chapter 6. Cambridge University Press, Cambridge (2015)"},{"key":"28_CR16","volume-title":"Handbook of Computational Social Choice, Chapter 7","author":"P Faliszewski","year":"2015","unstructured":"Faliszewski, P., Rothe, J.: Control and bribery in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, Chapter 7. Cambridge University Press, Cambridge (2015)"},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/bs.3830340105","volume":"34","author":"D Felsenthal","year":"1989","unstructured":"Felsenthal, D.: On combining approval with disapproval voting. Behav. Sci. 34(1), 53\u201360 (1989)","journal-title":"Behav. Sci."},{"issue":"4","key":"28_CR18","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of voting schemes: a general result. Econometrica 41(4), 587\u2013601 (1973)","journal-title":"Econometrica"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1086\/348187","volume":"44","author":"A Grazia","year":"1953","unstructured":"Grazia, A.: Mathematical deviation of an election system. Isis 44, 41\u201351 (1953)","journal-title":"Isis"},{"issue":"2","key":"28_CR20","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J Bartholdi III","year":"1989","unstructured":"Bartholdi III, J., Tovey, C., Trick, M.: Voting schemes for which it can be difficult to tell who won the election. Soc. Choice Welf. 6(2), 157\u2013165 (1989)","journal-title":"Soc. Choice Welf."},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-35605-3_6","volume-title":"Mathematics and Democracy: Recent Advances in Voting Systems and Collective Choice","author":"D Kilgour","year":"2006","unstructured":"Kilgour, D., Brams, S., Sanver, R.: How to elect a representative committee using approval balloting. In: Pukelsheim, F., Simeone, B. (eds.) Mathematics and Democracy: Recent Advances in Voting Systems and Collective Choice, pp. 83\u201395. Springer, Heidelberg (2006)"},{"key":"28_CR22","volume-title":"Handbook of Computational Social Choice, Chapter 9","author":"J Lang","year":"2015","unstructured":"Lang, J., Xia, L.: Voting in combinatorial domains. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, Chapter 9. Cambridge University Press, Cambridge (2015)"},{"key":"28_CR23","unstructured":"LeGrand, R.: Analysis of the minimax procedure. Technical report WUCSE-2004-67, Department of Computer Science and Engineering, Washington University, St. Louis, Missouri, November 2004"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"LeGrand, R., Markakis, E., Mehta, A.: Some results on approximating the minimax solution in approval voting. In: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1193\u20131195, ACM Press, May 2007","DOI":"10.1145\/1329125.1329365"},{"key":"28_CR25","unstructured":"Lu, T., Boutilier, C.: Budgeted social choice: from consensus to personalized decision making. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 280\u2013286, AAAI Press (2011)"},{"key":"28_CR26","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1613\/jair.2566","volume":"33","author":"R Meir","year":"2008","unstructured":"Meir, R., Procaccia, A., Rosenschein, J., Zohar, A.: Complexity of strategic behavior in multi-winner elections. J. Artif. Intell. Res. 33, 149\u2013178 (2008)","journal-title":"J. Artif. Intell. Res."},{"issue":"4","key":"28_CR27","doi-asserted-by":"publisher","first-page":"925","DOI":"10.2307\/2082518","volume":"89","author":"B Monroe","year":"1995","unstructured":"Monroe, B.: Fully proportional representation. Am. Polit. Sci. Rev. 89(4), 925\u2013940 (1995)","journal-title":"Am. Polit. Sci. Rev."},{"key":"28_CR28","unstructured":"Obraztsova, S., Elkind, E., Hazon, N.: Ties matter: complexity of voting manipulation revisited. In: Proceedings of the 10th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 71\u201378, ACM Press (2011)"},{"key":"28_CR29","unstructured":"Obraztsova, S., Zick, Y., Elkind, E.: On manipulation in multiwinner elections based on scoring rules. In: Proceedings of the 12th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 359\u2013366, IFAAMAS (2013)"},{"key":"28_CR30","volume-title":"Computational Complexity","author":"C Papadimitriou","year":"1995","unstructured":"Papadimitriou, C.: Computational Complexity, 2nd edn. Addison-Wesley, Reading (1995). Reprinted with corrections","edition":"2"},{"key":"28_CR31","unstructured":"Procaccia, A., Rosenschein, J., Zohar, A.: Multi-winner elections: complexity of manipulation, control, and winner-determination. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 1476\u20131481, IJCAI (2007)"},{"key":"28_CR32","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00355-007-0235-2","volume":"30","author":"A Procaccia","year":"2008","unstructured":"Procaccia, A., Rosenschein, J., Zohar, A.: On the complexity of achieving proportional representation. Soc. Choice Welf. 30, 353\u2013362 (2008)","journal-title":"Soc. Choice Welf."},{"issue":"2","key":"28_CR33","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"M Satterthwaite","year":"1975","unstructured":"Satterthwaite, M.: Strategy-proofness and Arrow\u2019s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J. Econ. Theor. 10(2), 187\u2013217 (1975)","journal-title":"J. Econ. Theor."},{"key":"28_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-41392-6_1","volume-title":"Algorithmic Game Theory","author":"P Skowron","year":"2013","unstructured":"Skowron, P., Yu, L., Faliszewski, P., Elkind, E.: The complexity of fully proportional representation for single-crossing electorates. In: V\u00f6cking, B. (ed.) SAGT 2013. LNCS, vol. 8146, pp. 1\u201312. Springer, Heidelberg (2013)"},{"issue":"6","key":"28_CR35","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. Biom. Bull. 1(6), 80\u201383 (1945)","journal-title":"Biom. Bull."},{"key":"28_CR36","volume-title":"Handbook of Computational Social Choice, Chapter 2","author":"W Zwicker","year":"2015","unstructured":"Zwicker, W.: Introduction to the theory of voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, Chapter 2. Cambridge University Press, Cambridge (2015)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23114-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T12:51:57Z","timestamp":1691931117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23114-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231136","9783319231143"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23114-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}