{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T04:09:38Z","timestamp":1768709378990,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031521126","type":"print"},{"value":"9783031521133","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_25","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"355-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Apportionment with\u00a0Thresholds: Strategic Campaigns are Easy in\u00a0the\u00a0Top-Choice but\u00a0Hard in\u00a0the\u00a0Second-Chance Mode"],"prefix":"10.1007","author":[{"given":"Christian","family":"Lau\u00dfmann","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2604-264X","authenticated-orcid":false,"given":"Tessa","family":"Seeger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"issue":"7","key":"25_CR1","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1080\/00029890.1975.11993911","volume":"82","author":"M Balinski","year":"1975","unstructured":"Balinski, M., Young, H.: The quota method of apportionment. Am. Math. Mon. 82(7), 701\u2013730 (1975)","journal-title":"Am. Math. Mon."},{"key":"25_CR2","volume-title":"Fair Representation: Meeting the Ideal of One Man, One Vote","author":"M Balinski","year":"1982","unstructured":"Balinski, M., Young, H.: Fair Representation: Meeting the Ideal of One Man, One Vote. Yale University Press, New Haven (1982)"},{"issue":"8\/9","key":"25_CR3","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":"25_CR4","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Hogrebe, T., Rey, L.: Generalized distance bribery. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence, pp. 1764\u20131771. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33011764"},{"key":"25_CR5","series-title":"Springer Texts in Business and Economics","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-662-47904-9_4","volume-title":"Economics and Computation","author":"D Baumeister","year":"2016","unstructured":"Baumeister, D., Rothe, J.: Preference aggregation by voting. In: Rothe, J. (ed.) Economics and Computation. STBE, pp. 197\u2013325. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-47904-9_4"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Faliszewski, P., Furdyna, M., Kaczmarczyk, A., Lackner, M.: Strategic campaign management in apportionment elections. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence, pp. 103\u2013109. ijcai.org (2020)","DOI":"10.24963\/ijcai.2020\/15"},{"key":"25_CR7","first-page":"529","volume":"42","author":"E Elkind","year":"2011","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Cloning in elections: finding the possible winners. J. Artif. Intell. Res. 42, 529\u2013573 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485\u2013532 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: The complexity of manipulative attacks in nearly single-peaked electorates. In: Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 228\u2013237. ACM Press (2011)","DOI":"10.1145\/2000378.2000406"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ic.2010.09.001","volume":"209","author":"P Faliszewski","year":"2011","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: The shield that never was: societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. 209(2), 89\u2013107 (2011)","journal-title":"Inf. Comput."},{"key":"25_CR11","doi-asserted-by":"crossref","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, chap. 7, pp. 146\u2013168. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.008"},{"issue":"5\u20136","key":"25_CR12","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."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"25_CR14","unstructured":"Neveling, M., Rothe, J.: The complexity of cloning candidates in multiwinner elections. In: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, pp. 922\u2013930. IFAAMAS (2020)"},{"key":"25_CR15","doi-asserted-by":"publisher","unstructured":"Oelbermann, K.F., Pukelsheim, F.: The European Elections of May 2019: electoral systems and outcomes (2020). https:\/\/doi.org\/10.2861\/129510. Study for the European Parliamentary Research Service","DOI":"10.2861\/129510"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.electstud.2013.07.008","volume":"33","author":"M Pellicer","year":"2014","unstructured":"Pellicer, M., Wegner, E.: The mechanical and psychological effects of legal thresholds. Elect. Stud. 33, 258\u2013266 (2014)","journal-title":"Elect. Stud."},{"key":"25_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64707-4","volume-title":"Proportional Representation","author":"F Pukelsheim","year":"2017","unstructured":"Pukelsheim, F.: Proportional Representation. Springer, Heidelberg (2017)"},{"issue":"3","key":"25_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF00433944","volume":"4","author":"N Tideman","year":"1987","unstructured":"Tideman, N.: Independence of clones as a criterion for voting rules. Soc. Choice Welfare 4(3), 185\u2013206 (1987)","journal-title":"Soc. Choice Welfare"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:04:59Z","timestamp":1711569899000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","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":"33","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.11","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":"7","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)"}}]}}