IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2610.08435.html

Strategy-proof voting schemes under single-peaked preferences over intervals

Author

Listed:
  • Hao Yu

Abstract

When a subset of alternatives is allowed to be the collective choice, one approach is to study the social choice correspondence defined on agents' preferences over alternatives. This paper considers a different approach. We argue that agents should have preferences directly over outcomes. We consider the social choice problem on a closed real interval, and assume a single-peaked domain over intervals. Our focus is on the peak-only social choice function, referred to as the voting scheme. The leftright scheme, which generalizes the minmax scheme, is the only strategy-proof voting scheme. Adding anonymity, it reduces to the generalized median scheme. For an odd number of agents, the median scheme is the only voting scheme satisfying efficiency, anonymity, and strategy-proofness.

Suggested Citation

  • Hao Yu, 2026. "Strategy-proof voting schemes under single-peaked preferences over intervals," Papers 2610.08435, arXiv.org.
    • Handle: RePEc:arx:papers:2610.08435
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Block, Veronica, 2010. "Efficient and strategy-proof voting over connected coalitions: A possibility result," Economics Letters, Elsevier, vol. 108(1), pages 1-3, July.
    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. Tobias Rachidi, 2021. "Optimal Voting Mechanisms on Generalized Single-Peaked Domains," CRC TR 224 Discussion Paper Series crctr224_2020_214v2, University of Bonn and University of Mannheim, Germany.
    2. Marco LiCalzi & M. Alperen Yasar, 2024. "Vocabulary aggregation," Working Papers 06, Venice School of Management - Department of Management, Università Ca' Foscari Venezia.
    3. Tobias Rachidi, 2020. "Optimal Voting Mechanisms on Generalized Single-Peaked Domains," CRC TR 224 Discussion Paper Series crctr224_2020_214, University of Bonn and University of Mannheim, Germany.
    4. Carmelo Rodríguez à lvarez, 2026. "Strategy-Proof Interval Selection," Documentos de Trabajo del ICAE 2026-01, Universidad Complutense de Madrid, Facultad de Ciencias Económicas y Empresariales, Instituto Complutense de Análisis Económico.

    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:arx:papers:2610.08435. 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: https://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.