{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:05:01Z","timestamp":1743055501453,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030579791"},{"type":"electronic","value":"9783030579807"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-57980-7_18","type":"book-chapter","created":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T23:04:10Z","timestamp":1599519850000},"page":"275-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Line-Up Elections: Parallel Voting with Shared Candidate Pool"],"prefix":"10.1007","author":[{"given":"Niclas","family":"Boehmer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Bredereck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Faliszewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Kaczmarczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,8]]},"reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"volume-title":"Handbook of Social Choice and Welfare","year":"2010","key":"18_CR2","unstructured":"Arrow, K.J., Sen, A., Suzumura, K. (eds.): Handbook of Social Choice and Welfare, vol. 2. Elsevier, Amsterdam (2010)"},{"issue":"4","key":"18_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1002\/net.3230130404","volume":"13","author":"D Avis","year":"1983","unstructured":"Avis, D.: A survey of heuristics for the weighted matching problem. Networks 13(4), 475\u2013493 (1983)","journal-title":"Networks"},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00355-016-1019-3","volume":"48","author":"H Aziz","year":"2017","unstructured":"Aziz, H., Brill, M., Conitzer, V., Elkind, E., Freeman, R., Walsh, T.: Justified representation in approval-based committee voting. Soc. Choice Welf. 48(2), 461\u2013485 (2017)","journal-title":"Soc. Choice Welf."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Aziz, H., Lee, B.E.: Sub-committee approval voting and generalized justified representation axioms. In: AIES 2018, pp. 3\u20139 (2018)","DOI":"10.1145\/3278721.3278739"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00355-007-0268-6","volume":"31","author":"S Barber\u00e0","year":"2008","unstructured":"Barber\u00e0, S., Coelho, D.: How to choose a non-controversial list with $$k$$ names. Soc. Choice Welf. 31(1), 79\u201396 (2008)","journal-title":"Soc. Choice Welf."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Boehmer, N., Bredereck, R., Faliszewski, P., Kaczmarczyk, A., Niedermeier, R.: Line-up elections: parallel voting with shared candidate pool. arXiv preprint arXiv:2007.04960 [cs.GT] (2020)","DOI":"10.1007\/978-3-030-57980-7_18"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Fishburn, P.C.: Voting procedures. In: Handbook of Social Choice and Welfare, chap. 4, pp. 173\u2013236 (2002)","DOI":"10.1016\/S1574-0110(02)80008-X"},{"key":"18_CR9","unstructured":"EA Sports: FIFA 19. [CD-ROM] (2018)"},{"issue":"3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s00355-017-1026-z","volume":"48","author":"E Elkind","year":"2017","unstructured":"Elkind, E., Faliszewski, P., Skowron, P., Slinko, A.: Properties of multiwinner voting rules. Soc. Choice Welf. 48(3), 599\u2013632 (2017)","journal-title":"Soc. Choice Welf."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Elkind, E., Ismaili, A.: OWA-based extensions of the Chamberlin-Courant rule. In: ADT 2015, pp. 486\u2013502 (2015)","DOI":"10.1007\/978-3-319-23114-3_29"},{"key":"18_CR12","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Multiwinner voting: a new challenge for social choice theory. In: Trends in Computational Social Choice, pp. 27\u201347 (2017)"},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0166-218X(82)90070-1","volume":"4","author":"PC Fishburn","year":"1982","unstructured":"Fishburn, P.C.: Monotonicity paradoxes in the theory of elections. Discrete Appl. Math. 4(2), 119\u2013134 (1982)","journal-title":"Discrete Appl. Math."},{"key":"18_CR14","unstructured":"Gadiya, K.: FIFA 19 complete player dataset (2019). https:\/\/www.kaggle.com\/karangadiya\/fifa19"},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"issue":"7","key":"18_CR16","doi-asserted-by":"publisher","first-page":"1747","DOI":"10.1287\/opre.19.7.1747","volume":"19","author":"RS Garfinkel","year":"1971","unstructured":"Garfinkel, R.S.: Technical note - an improved algorithm for the bottleneck assignment problem. Oper. Res. 19(7), 1747\u20131751 (1971)","journal-title":"Oper. Res."},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00453-009-9386-0","volume":"58","author":"N Garg","year":"2010","unstructured":"Garg, N., Kavitha, T., Kumar, A., Mehlhorn, K., Mestre, J.: Assigning papers to referees. Algorithmica 58(1), 119\u2013136 (2010)","journal-title":"Algorithmica"},{"key":"18_CR18","unstructured":"Golden, B., Perny, P.: Infinite order Lorenz dominance for fair multiagent optimization. In: AAMAS 2010, pp. 383\u2013390 (2010)"},{"key":"18_CR19","unstructured":"Goldsmith, J., Sloan, R.: The AI conference paper assignment problem. In: MPREF 2007 (2007)"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. In: 50 Years of Integer Programming, pp. 29\u201347 (2010)","DOI":"10.1007\/978-3-540-68279-0_2"},{"issue":"3","key":"18_CR21","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.mathsocsci.2008.12.010","volume":"57","author":"J Lang","year":"2009","unstructured":"Lang, J., Xia, L.: Sequential composition of voting rules in multi-issue domains. Math. Soc. Sci. 57(3), 304\u2013324 (2009)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"18_CR22","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/s00453-018-0434-5","volume":"81","author":"J Lesca","year":"2019","unstructured":"Lesca, J., Minoux, M., Perny, P.: The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases. Algorithmica 81(1), 98\u2013123 (2019)","journal-title":"Algorithmica"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Lian, J.W., Mattei, N., Noble, R., Walsh, T.: The conference paper assignment problem: using order weighted averages to assign indivisible goods. In: AAAI 2018, pp. 1138\u20131145 (2018)","DOI":"10.1609\/aaai.v32i1.11484"},{"key":"18_CR24","unstructured":"Murphy, R.: FIFA player ratings explained (2018). https:\/\/www.goal.com\/en-ae\/news\/fifa-player-ratings-explained-how-are-the-card-number-stats\/1hszd2fgr7wgf1n2b2yjdpgynu. Accessed 08 July 2020"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.artint.2016.09.003","volume":"241","author":"P Skowron","year":"2016","unstructured":"Skowron, P., Faliszewski, P., Lang, J.: Finding a collective set of items: from proportional multirepresentation to group recommendation. Artif. Intell. 241, 191\u2013216 (2016)","journal-title":"Artif. Intell."},{"issue":"1","key":"18_CR26","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/21.87068","volume":"18","author":"RR Yager","year":"1988","unstructured":"Yager, R.R.: On ordered weighted averaging aggregation operators in multicriteria decisionmaking. IEEE Trans. Syst. Man Cybern. Syst. 18(1), 183\u2013190 (1988)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"1","key":"18_CR27","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0022-0531(74)90073-8","volume":"9","author":"H Young","year":"1974","unstructured":"Young, H.: An axiomatization of Borda\u2019s rule. J. Econ. Theory 9(1), 43\u201352 (1974)","journal-title":"J. Econ. Theory"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Zwicker, W.S.: Introduction to the theory of voting. In: Handbook of Computational Social Choice, pp. 23\u201356 (2016)","DOI":"10.1017\/CBO9781107446984.003"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57980-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T04:19:30Z","timestamp":1668658770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57980-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030579791","9783030579807"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57980-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Augsburg","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-augsburg.de\/de\/fakultaet\/mntf\/math\/prof\/opt\/team\/harks\/sagt2020\/","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","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":"21","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":"40% - 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":"8","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}