IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-03834512.html
   My bibliography  Save this paper

Optimized Distortion and Proportional Fairness in Voting

Author

Listed:
  • Soroush Ebadian

    (DCS - Department of Computer Science [University of Toronto] - University of Toronto)

  • Anson Kahng

    (Department of Computer Science [Rochester] - University of Rochester [USA])

  • Dominik Peters

    (LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision - Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres - CNRS - Centre National de la Recherche Scientifique)

  • Nisarg Shah

    (DCS - Department of Computer Science [University of Toronto] - University of Toronto)

Abstract

A voting rule decides on a probability distribution over a set of m alternatives, based on rankings of those alternatives provided by agents. We assume that agents have cardinal utility functions over the alternatives, but voting rules have access to only the rankings induced by these utilities. We evaluate how well voting rules do on measures of social welfare and of proportional fairness, computed based on the hidden utility functions. In particular, we study the distortion of voting rules, which is a worst-case measure. It is an approximation ratio comparing the utilitarian social welfare of the optimum outcome to the social welfare produced by the outcome selected by the voting rule, in the worst case over possible input profiles and utility functions that are consistent with the input. The previous literature has studied distortion with unit-sum utility functions (which are normalized to sum to 1), and left a small asymptotic gap in the best possible distortion. Using tools from the theory of fair multi-winner elections, we propose the first voting rule which achieves the optimal distortion Θ(√ m) for unit-sum utilities. Our voting rule also achieves optimum Θ(√ m) distortion for a larger class of utilities, including unit-range and approval (0/1) utilities. We then take a similar worst-case approach to a quantitative measure of the fairness of a voting rule, called proportional fairness. Informally, it measures whether the influence of cohesive groups of agents on the voting outcome is proportional to the group size. We show that there is a voting rule which, without knowledge of the utilities, can achieve an O(log m)-approximation to proportional fairness, which is the best possible approximation. As a consequence of its proportional fairness, we show that this voting rule achieves O(log m) distortion with respect to the Nash welfare, and selects a distribution that is approximately stable by being an O(log m)-approximation to the core, making it interesting for applications in participatory budgeting.

Suggested Citation

  • Soroush Ebadian & Anson Kahng & Dominik Peters & Nisarg Shah, 2022. "Optimized Distortion and Proportional Fairness in Voting," Post-Print hal-03834512, HAL.
  • Handle: RePEc:hal:journl:hal-03834512
    DOI: 10.1145/3490486.3538339
    Note: View the original document on HAL open archive server: https://hal.science/hal-03834512
    as

    Download full text from publisher

    File URL: https://hal.science/hal-03834512/document
    Download Restriction: no

    File URL: https://libkey.io/10.1145/3490486.3538339?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Duddy, Conal, 2015. "Fair sharing under dichotomous preferences," Mathematical Social Sciences, Elsevier, vol. 73(C), pages 1-5.
    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. Tom Demeulemeester & Dries Goossens & Ben Hermans & Roel Leus, 2023. "Fair integer programming under dichotomous and cardinal preferences," Papers 2306.13383, arXiv.org, revised Apr 2024.
    2. Gogulapati Sreedurga & Soumyarup Sadhukhan & Souvik Roy & Yadati Narahari, 2022. "Characterization of Group-Fair Social Choice Rules under Single-Peaked Preferences," Papers 2207.07984, arXiv.org.
    3. Brandl, Florian & Brandt, Felix & Greger, Matthias & Peters, Dominik & Stricker, Christian & Suksompong, Warut, 2022. "Funding public projects: A case for the Nash product rule," Journal of Mathematical Economics, Elsevier, vol. 99(C).
    4. Freeman, Rupert & Pennock, David M. & Peters, Dominik & Wortman Vaughan, Jennifer, 2021. "Truthful aggregation of budget proposals," Journal of Economic Theory, Elsevier, vol. 193(C).
    5. Felix Brandt & Matthias Greger & Erel Segal-Halevi & Warut Suksompong, 2023. "Balanced Donor Coordination," Papers 2305.10286, arXiv.org.
    6. Markus Brill & Paul Gölz & Dominik Peters & Ulrike Schmidt-Kraepelin & Kai Wilker, 2022. "Approval-based apportionment," Post-Print hal-03816043, HAL.
    7. Haris Aziz & Xinhang Lu & Mashbat Suzuki & Jeremy Vollen & Toby Walsh, 2023. "Best-of-Both-Worlds Fairness in Committee Voting," Papers 2303.03642, arXiv.org, revised Dec 2023.
    8. Florian Brandl & Felix Brandt & Matthias Greger & Dominik Peters & Christian Stricker & Warut Suksompong, 2020. "Funding Public Projects: A Case for the Nash Product Rule," Papers 2005.07997, arXiv.org, revised Oct 2021.
    9. Xiaohui Bei & Guangda Huzhang & Warut Suksompong, 2018. "Truthful Fair Division without Free Disposal," Papers 1804.06923, arXiv.org, revised Apr 2020.
    10. Xiaohui Bei & Guangda Huzhang & Warut Suksompong, 2020. "Truthful fair division without free disposal," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 55(3), pages 523-545, October.
    11. Florian Brandl & Felix Brandt & Matthias Greger & Dominik Peters & Christian Stricker & Warut Suksompong, 2022. "Funding public projects: A case for the Nash product rule," Post-Print hal-03818329, HAL.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:hal:journl:hal-03834512. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.