IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2007.04960.html
   My bibliography  Save this paper

Line-Up Elections: Parallel Voting with Shared Candidate Pool

Author

Listed:
  • Niclas Boehmer
  • Robert Bredereck
  • Piotr Faliszewski
  • Andrzej Kaczmarczyk
  • Rolf Niedermeier

Abstract

We introduce the model of line-up elections which captures parallel or sequential single-winner elections with a shared candidate pool. The goal of a line-up election is to find a high-quality assignment of a set of candidates to a set of positions such that each position is filled by exactly one candidate and each candidate fills at most one position. A score for each candidate-position pair is given as part of the input, which expresses the qualification of the candidate to fill the position. We propose several voting rules for line-up elections and analyze them from an axiomatic and an empirical perspective using real-world data from the popular video game FIFA.

Suggested Citation

  • Niclas Boehmer & Robert Bredereck & Piotr Faliszewski & Andrzej Kaczmarczyk & Rolf Niedermeier, 2020. "Line-Up Elections: Parallel Voting with Shared Candidate Pool," Papers 2007.04960, arXiv.org.
    • Handle: RePEc:arx:papers:2007.04960
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2007.04960
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Robert S. Garfinkel, 1971. "Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem," Operations Research, INFORMS, vol. 19(7), pages 1747-1751, December.
    2. Haris Aziz & Markus Brill & Vincent Conitzer & Edith Elkind & Rupert Freeman & Toby Walsh, 2017. "Justified representation in approval-based committee voting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(2), pages 461-485, February.
    3. Edith Elkind & Piotr Faliszewski & Piotr Skowron & Arkadii Slinko, 2017. "Properties of multiwinner voting rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(3), pages 599-632, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Markus Brill & Jean-François Laslier & Piotr Skowron, 2018. "Multiwinner approval rules as apportionment methods," Journal of Theoretical Politics, , vol. 30(3), pages 358-382, July.
    2. Mostapha Diss & Eric Kamwa & Abdelmonaim Tlidi, 2019. "On some k-scoring rules for committee elections: agreement and Condorcet Principle," Working Papers hal-02147735, HAL.
    3. Mostapha Diss & Eric Kamwa & Abdelmonaim Tlidi, 2018. "The Chamberlin-Courant Rule and the k-Scoring Rules: Agreement and Condorcet Committee Consistency," Working Papers halshs-01817943, HAL.
    4. Davide Grossi, 2021. "Lecture Notes on Voting Theory," Papers 2105.00216, arXiv.org.
    5. Chris Dong & Patrick Lederer, 2023. "Refined Characterizations of Approval-based Committee Scoring Rules," Papers 2312.08799, arXiv.org, revised Mar 2024.
    6. Mostapha Diss & Eric Kamwa & Abdelmonaim Tlidi, 2020. "On Some k -scoring Rules for Committee Elections: Agreement and Condorcet Principle," Revue d'économie politique, Dalloz, vol. 130(5), pages 699-725.
    7. Martin Lackner & Piotr Skowron, 2017. "Consistent Approval-Based Multi-Winner Rules," Papers 1704.02453, arXiv.org, revised Oct 2019.
    8. Skowron, Piotr & Faliszewski, Piotr & Slinko, Arkadii, 2019. "Axiomatic characterization of committee scoring rules," Journal of Economic Theory, Elsevier, vol. 180(C), pages 244-273.
    9. Steven J. Brams & D. Marc Kilgour & Richard F. Potthoff, 2019. "Multiwinner approval voting: an apportionment approach," Public Choice, Springer, vol. 178(1), pages 67-93, January.
    10. Markus Brill & Paul Gölz & Dominik Peters & Ulrike Schmidt-Kraepelin & Kai Wilker, 2022. "Approval-based apportionment," Post-Print hal-03816043, HAL.
    11. Piotr Faliszewski & Piotr Skowron & Arkadii Slinko & Nimrod Talmon, 2018. "Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(3), pages 513-550, October.
    12. David McCune & Erin Martin & Grant Latina & Kaitlyn Simms, 2023. "A Comparison of Sequential Ranked-Choice Voting and Single Transferable Vote," Papers 2306.17341, arXiv.org.
    13. Haris Aziz & Sujit Gujar & Manisha Padala & Mashbat Suzuki & Jeremy Vollen, 2022. "Coordinating Monetary Contributions in Participatory Budgeting," Papers 2206.05966, arXiv.org, revised Feb 2023.
    14. Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
    15. Diss, Mostapha & Mahajne, Muhammad, 2020. "Social acceptability of Condorcet committees," Mathematical Social Sciences, Elsevier, vol. 105(C), pages 14-27.
    16. Haris Aziz & Markus Brill & Vincent Conitzer & Edith Elkind & Rupert Freeman & Toby Walsh, 2017. "Justified representation in approval-based committee voting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(2), pages 461-485, February.
    17. Steven J. Brams & Markus Brill & Anne-Marie George, 2022. "The excess method: a multiwinner approval voting procedure to allocate wasted votes," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 58(2), pages 283-300, February.
    18. Joshua C. Yang & Marcin Korecki & Damian Dailisan & Carina I. Hausladen & Dirk Helbing, 2024. "LLM Voting: Human Choices and AI Collective Decision Making," Papers 2402.01766, arXiv.org.
    19. Egor Ianovski, 2022. "Electing a committee with dominance constraints," Annals of Operations Research, Springer, vol. 318(2), pages 985-1000, November.
    20. Fanrong Xie & Anuj Sharma & Zuoan Li, 2022. "An alternate approach to solve two-level priority based assignment problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 613-656, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2007.04960. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.