IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v52y2014icp123-127.html
   My bibliography  Save this article

Probabilistic strategy-proof rules over single-peaked domains

Author

Listed:
  • Peters, Hans
  • Roy, Souvik
  • Sen, Arunava
  • Storcken, Ton

Abstract

It is proved that every strategy-proof, peaks-only or unanimous, probabilistic rule defined over a minimally rich domain of single-peaked preferences is a probability mixture of strategy-proof, peaks-only or unanimous, deterministic rules over the same domain. The proof employs Farkas’ Lemma and the max-flow min-cut theorem for capacitated networks.

Suggested Citation

  • Peters, Hans & Roy, Souvik & Sen, Arunava & Storcken, Ton, 2014. "Probabilistic strategy-proof rules over single-peaked domains," Journal of Mathematical Economics, Elsevier, vol. 52(C), pages 123-127.
  • Handle: RePEc:eee:mateco:v:52:y:2014:i:c:p:123-127
    DOI: 10.1016/j.jmateco.2014.03.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406814000470
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.jmateco.2014.03.008?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
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. John Weymark, 2011. "A unified approach to strategy-proofness for single-peaked preferences," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 2(4), pages 529-550, December.
    2. Chatterji, Shurojit & Sen, Arunava & Zeng, Huaxia, 2014. "Random dictatorship domains," Games and Economic Behavior, Elsevier, vol. 86(C), pages 212-236.
    3. H. Moulin, 1980. "On strategy-proofness and single peakedness," Public Choice, Springer, vol. 35(4), pages 437-455, January.
    4. Ehlers, Lars & Peters, Hans & Storcken, Ton, 2002. "Strategy-Proof Probabilistic Decision Schemes for One-Dimensional Single-Peaked Preferences," Journal of Economic Theory, Elsevier, vol. 105(2), pages 408-434, August.
    5. Barbera Salvador & Gul Faruk & Stacchetti Ennio, 1993. "Generalized Median Voter Schemes and Committees," Journal of Economic Theory, Elsevier, vol. 61(2), pages 262-289, December.
    6. Kim C. Border & J. S. Jordan, 1983. "Straightforward Elections, Unanimity and Phantom Voters," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 50(1), pages 153-170.
    7. Duggan, John, 1996. "A Geometric Proof of Gibbard's Random Dictatorship Theorem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 7(2), pages 365-369, February.
    8. Chatterji, Shurojit & Roy, Souvik & Sen, Arunava, 2012. "The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences," Journal of Mathematical Economics, Elsevier, vol. 48(6), pages 353-366.
    9. Picot, Jérémy & Sen, Arunava, 2012. "An extreme point characterization of random strategy-proof social choice functions: The two alternative case," Economics Letters, Elsevier, vol. 115(1), pages 49-52.
    10. Gibbard, Allan, 1977. "Manipulation of Schemes That Mix Voting with Chance," Econometrica, Econometric Society, vol. 45(3), pages 665-681, April.
    11. Arunava Sen, 2011. "The Gibbard random dictatorship theorem: a generalization and a new proof," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 2(4), pages 515-527, December.
    12. Pycia, Marek & Ünver, M. Utku, 2015. "Decomposing random mechanisms," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 21-33.
    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. Chatterji, Shurojit & Zeng, Huaxia, 2018. "On random social choice functions with the tops-only property," Games and Economic Behavior, Elsevier, vol. 109(C), pages 413-435.
    2. Chatterji, Shurojit & Sen, Arunava & Zeng, Huaxia, 2016. "A characterization of single-peaked preferences via random social choice functions," Theoretical Economics, Econometric Society, vol. 11(2), May.
    3. Chatterji, Shurojit & Zeng, Huaxia, 2019. "Random mechanism design on multidimensional domains," Journal of Economic Theory, Elsevier, vol. 182(C), pages 25-105.
    4. Roy, Souvik & Sadhukhan, Soumyarup, 2021. "A unified characterization of the randomized strategy-proof rules," Journal of Economic Theory, Elsevier, vol. 197(C).
    5. Souvik Roy & Soumyarup Sadhukhan, 2019. "A characterization of random min–max domains and its applications," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(4), pages 887-906, November.
    6. Pycia, Marek & Ünver, M. Utku, 2015. "Decomposing random mechanisms," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 21-33.
    7. Peters, Hans & Roy, Souvik & Sadhukhan, Soumyarup & Storcken, Ton, 2017. "An extreme point characterization of strategy-proof and unanimous probabilistic rules over binary restricted domains," Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 84-90.
    8. Chatterji, Shurojit & Roy, Souvik & Sadhukhan, Soumyarup & Sen, Arunava & Zeng, Huaxia, 2022. "Probabilistic fixed ballot rules and hybrid domains," Journal of Mathematical Economics, Elsevier, vol. 100(C).
    9. Peters, Hans & Roy, Souvik & Sadhukhan, Soumyarup, 2018. "Random social choice functions for single-peaked domains on trees," Research Memorandum 004, Maastricht University, Graduate School of Business and Economics (GSBE).
    10. Chatterji, Shurojit & Sen, Arunava & Zeng, Huaxia, 2014. "Random dictatorship domains," Games and Economic Behavior, Elsevier, vol. 86(C), pages 212-236.
    11. Hans Peters & Souvik Roy & Soumyarup Sadhukhan, 2021. "Unanimous and Strategy-Proof Probabilistic Rules for Single-Peaked Preference Profiles on Graphs," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 811-833, May.
    12. Felix Brand & Patrick Lederer & Sascha Tausch, 2023. "Strategyproof Social Decision Schemes on Super Condorcet Domains," Papers 2302.12140, arXiv.org.
    13. Felix Brandt & Patrick Lederer & René Romen, 2024. "Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(1), pages 19-55, August.
    14. Gaurav, Abhishek & Picot, Jérémy & Sen, Arunava, 2017. "The decomposition of strategy-proof random social choice functions on dichotomous domains," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 28-34.
    15. 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.
    16. Bonifacio, Agustín G. & Massó, Jordi, 2020. "On strategy-proofness and semilattice single-peakedness," Games and Economic Behavior, Elsevier, vol. 124(C), pages 219-238.
    17. Felix Brandt & Patrick Lederer & Ren'e Romen, 2022. "Relaxed Notions of Condorcet-Consistency and Efficiency for Strategyproof Social Decision Schemes," Papers 2201.10418, arXiv.org.
    18. John A. Weymark, 2008. "Strategy‐Proofness and the Tops‐Only Property," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 10(1), pages 7-26, February.
    19. Aziz, Haris & Chan, Hau & Lee, Barton E. & Parkes, David C., 2020. "The capacity constrained facility location problem," Games and Economic Behavior, Elsevier, vol. 124(C), pages 478-490.
    20. Barbera, S. & Masso, J. & Serizawa, S., 1998. "Strategy-Proof Voting on Compact Ranges," Games and Economic Behavior, Elsevier, vol. 25(2), pages 272-291, November.

    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:eee:mateco:v:52:y:2014:i:c:p:123-127. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    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.