{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:17:45Z","timestamp":1742977065912,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_26","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"355-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Controlling Weighted Voting Games by\u00a0Deleting or\u00a0Adding Players with\u00a0or\u00a0Without Changing the\u00a0Quota"],"prefix":"10.1007","author":[{"given":"Joanna","family":"Kaczmarek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0589-3616","authenticated-orcid":false,"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02576905","volume":"23","author":"G Arcaini","year":"1986","unstructured":"Arcaini, G., Gambarelli, G.: Algorithm for automatic computation of the power variations in share trading. Calcolo 23(1), 13\u201319 (1986)","journal-title":"Calcolo"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1613\/jair.3166","volume":"40","author":"H Aziz","year":"2011","unstructured":"Aziz, H., Bachrach, Y., Elkind, E., Paterson, M.: False-name manipulations in weighted voting games. J. Artif. Intell. Res. 40, 57\u201393 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"26_CR3","unstructured":"Aziz, H., Paterson, M.: False name manipulations in weighted voting games: splitting, merging and annexation. In: Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems, pp. 409\u2013416. IFAAMAS, May 2009"},{"key":"26_CR4","unstructured":"Bachrach, Y., Elkind, E.: Divide and conquer: false-name manipulations in weighted voting games. In: Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems, pp. 975\u2013982. IFAAMAS, May 2008"},{"key":"26_CR5","first-page":"317","volume":"19","author":"J Banzhaf III","year":"1965","unstructured":"Banzhaf, J., III.: Weighted voting doesn\u2019t work: a mathematical analysis. Rutgers Law Rev. 19, 317\u2013343 (1965)","journal-title":"Rutgers Law Rev."},{"issue":"8\/9","key":"26_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J Bartholdi III","year":"1992","unstructured":"Bartholdi, J., III., Tovey, C., Trick, M.: How hard is it to control an election? Math. Comput. Model. 16(8\/9), 27\u201340 (1992)","journal-title":"Math. Comput. Model."},{"key":"26_CR7","unstructured":"Baumeister, D., Rothe, J., Selker, A.: Strategic behavior in judgment aggregation. In: Endriss, U. (ed.) Trends in Computational Social Choice, chap. 8, pp. 145\u2013168. AI Access Foundation (2017)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.): Handbook of Computational Social Choice. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.002"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational Aspects of Cooperative Game Theory. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers (2011)","DOI":"10.2200\/S00355ED1V01Y201107AIM016"},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/moor.4.2.99","volume":"4","author":"P Dubey","year":"1979","unstructured":"Dubey, P., Shapley, L.: Mathematical properties of the Banzhaf power index. Math. Oper. Res. 4(2), 99\u2013131 (1979)","journal-title":"Math. Oper. Res."},{"key":"26_CR11","series-title":"Springer Texts in Business and Economics","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-662-47904-9_3","volume-title":"Economics and Computation","author":"E Elkind","year":"2016","unstructured":"Elkind, E., Rothe, J.: Cooperative game theory. In: Rothe, J. (ed.) Economics and Computation. STBE, pp. 135\u2013193. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-47904-9_3"},{"key":"26_CR12","unstructured":"Endriss, U. (ed.): Trends in Computational Social Choice. AI Access Foundation (2017)"},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2008.09.034","volume":"410","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, L.: The complexity of power-index comparison. Theor. Comput. Sci. 410(1), 101\u2013107 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"26_CR14","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s003550100137","volume":"18","author":"D Felsenthal","year":"2001","unstructured":"Felsenthal, D., Machover, M.: The Treaty of Nice and qualified majority voting. Soc. Choice Welfare 18(2), 431\u2013464 (2001)","journal-title":"Soc. Choice Welfare"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02032761","volume":"51","author":"G Gambarelli","year":"1994","unstructured":"Gambarelli, G.: Power indices for political and financial decision making: a review. Ann. Oper. Res. 51, 163\u2013173 (1994)","journal-title":"Ann. Oper. Res."},{"key":"26_CR16","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979)"},{"issue":"3","key":"26_CR17","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0022-0000(89)90025-1","volume":"39","author":"L Hemachandra","year":"1989","unstructured":"Hemachandra, L.: The strong exponential hierarchy collapses. J. Comput. Syst. Sci. 39(3), 299\u2013322 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5\u20136","key":"26_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.artint.2007.01.005","volume":"171","author":"E Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Anyone but him: the complexity of precluding an alternative. Artif. Intell. 171(5\u20136), 255\u2013285 (2007)","journal-title":"Artif. Intell."},{"issue":"1\u20134","key":"26_CR19","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1023\/A:1016324824094","volume":"109","author":"D Leech","year":"2002","unstructured":"Leech, D.: Voting power in the governance of the international monetary fund. Ann. Oper. Res. 109(1\u20134), 375\u2013397 (2002)","journal-title":"Ann. Oper. Res."},{"key":"26_CR20","volume-title":"Computational Complexity","author":"C Papadimitriou","year":"1995","unstructured":"Papadimitriou, C.: Computational Complexity, 2nd edn. Addison-Wesley, Boston (1995)","edition":"2"},{"issue":"2","key":"26_CR21","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","volume":"28","author":"C Papadimitriou","year":"1984","unstructured":"Papadimitriou, C., Yannakakis, M.: The complexity of facets (and some facets of complexity). J. Comput. Syst. Sci. 28(2), 244\u2013259 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Peleg, B., Sudh\u00f6lter, P.: Introduction to the Theory of Cooperative Games. Kluwer Academic Publishers (2003)","DOI":"10.1007\/978-1-4615-0308-8"},{"issue":"1","key":"26_CR23","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/2981392","volume":"109","author":"L Penrose","year":"1946","unstructured":"Penrose, L.: The elementary statistics of majority voting. J. Roy. Stat. Soc. 109(1), 53\u201357 (1946)","journal-title":"J. Roy. Stat. Soc."},{"key":"26_CR24","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1613\/jair.4293","volume":"50","author":"A Rey","year":"2014","unstructured":"Rey, A., Rothe, J.: False-name manipulation in weighted voting games is hard for probabilistic polynomial time. J. Artif. Intell. Res. 50, 573\u2013601 (2014)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"26_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/bejte-2016-0169","volume":"18","author":"A Rey","year":"2018","unstructured":"Rey, A., Rothe, J.: Structural control in weighted voting games. B.E. J. Theor. Econ. 18(2), 1\u201315 (2018)","journal-title":"B.E. J. Theor. Econ."},{"key":"26_CR26","series-title":"EATCS Texts in Theoretical Computer Science","volume-title":"Complexity Theory and Cryptology. An Introduction to Cryptocomplexity","author":"J Rothe","year":"2005","unstructured":"Rothe, J.: Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science, Springer, Heidelberg (2005)"},{"key":"26_CR27","series-title":"Springer Texts in Business and Economics","volume-title":"Economics and Computation An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division","year":"2015","unstructured":"Rothe, J. (ed.): Economics and Computation An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer Texts in Business and Economics, Springer, Heidelberg (2015)"},{"issue":"3","key":"26_CR28","doi-asserted-by":"publisher","first-page":"787","DOI":"10.2307\/1951053","volume":"48","author":"L Shapley","year":"1954","unstructured":"Shapley, L., Shubik, M.: A method of evaluating the distribution of power in a committee system. Am. Polit. Sci. Rev. 48(3), 787\u2013792 (1954)","journal-title":"Am. Polit. Sci. Rev."},{"key":"26_CR29","volume-title":"Simple Games: Desirability Relations, Trading, Pseudoweightings","author":"A Taylor","year":"1999","unstructured":"Taylor, A., Zwicker, W.: Simple Games: Desirability Relations, Trading, Pseudoweightings. Princeton University Press, Princeton (1999)"},{"issue":"1\u20132","key":"26_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(87)90049-1","volume":"51","author":"K Wagner","year":"1987","unstructured":"Wagner, K.: More complicated questions about maxima and minima, and some closures of NP. Theor. Comput. Sci. 51(1\u20132), 53\u201380 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2011.12.003","volume":"180\u2013181","author":"M Zuckerman","year":"2012","unstructured":"Zuckerman, M., Faliszewski, P., Bachrach, Y., Elkind, E.: Manipulating the quota in weighted voting games. Artif. Intell. 180\u2013181, 1\u201319 (2012)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T17:02:09Z","timestamp":1675702929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}