IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v90y2017icp28-34.html
   My bibliography  Save this article

The decomposition of strategy-proof random social choice functions on dichotomous domains

Author

Listed:
  • Gaurav, Abhishek
  • Picot, Jérémy
  • Sen, Arunava

Abstract

A feature of strategy-proof and efficient random social choice functions (RSCFs) defined over several important domains is that they are fixed probability distributions over deterministic strategy-proof and efficient social choice functions. We call such domains deterministic extreme point (DEP) domains. Examples of DEP domains are the domain of all strict preferences and the domain of single-peaked preferences. We show that the dichotomous domain introduced in Bogomolnaia et al. (2005) is not a DEP domain. We find a necessary condition for a strategy-proof RSCF to be written as a fixed probability distribution of deterministic strategy proof social choice functions. We show that this condition is compatible with efficiency. We also show that the condition is sufficient for decomposability in a special case.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:matsoc:v:90:y:2017:i:c:p:28-34
    DOI: 10.1016/j.mathsocsci.2017.03.004
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.mathsocsci.2017.03.004?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Chatterji, Shurojit & Sen, Arunava & Zeng, Huaxia, 2014. "Random dictatorship domains," Games and Economic Behavior, Elsevier, vol. 86(C), pages 212-236.
    2. 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.
    3. 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.
    4. Anna Bogomolnaia & Herve Moulin, 2004. "Random Matching Under Dichotomous Preferences," Econometrica, Econometric Society, vol. 72(1), pages 257-279, January.
    5. Gibbard, Allan, 1977. "Manipulation of Schemes That Mix Voting with Chance," Econometrica, Econometric Society, vol. 45(3), pages 665-681, April.
    6. Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April.
    7. Bogomolnaia, Anna & Moulin, Herve & Stong, Richard, 2005. "Collective choice under dichotomous preferences," Journal of Economic Theory, Elsevier, vol. 122(2), pages 165-184, June.
    8. 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.
    9. Pycia, Marek & Ünver, M. Utku, 2015. "Decomposing random mechanisms," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 21-33.
    10. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nicolò, Antonio & Sen, Arunava & Yadav, Sonal, 2019. "Matching with partners and projects," Journal of Economic Theory, Elsevier, vol. 184(C).
    2. Shurojit Chatterji & Souvik Roy & Soumyarup Sadhukhan & Arunava Sen & Huaxia Zeng, 2021. "Probabilistic Fixed Ballot Rules and Hybrid Domains," Papers 2105.10677, arXiv.org, revised Jan 2022.

    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. Pycia, Marek & Ünver, M. Utku, 2015. "Decomposing random mechanisms," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 21-33.
    3. Ehlers, Lars & Majumdar, Dipjyoti & Mishra, Debasis & Sen, Arunava, 2020. "Continuity and incentive compatibility in cardinal mechanisms," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 31-41.
    4. 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.
    5. Aziz, Haris & Brandl, Florian & Brandt, Felix & Brill, Markus, 2018. "On the tradeoff between efficiency and strategyproofness," Games and Economic Behavior, Elsevier, vol. 110(C), pages 1-18.
    6. EHLERS, Lars & MAJUMDAR, Dipjyoti & MISHRA, Debasis & SEN, Arunava, 2016. "Continuity and incentive compatibility," Cahiers de recherche 2016-04, Universite de Montreal, Departement de sciences economiques.
    7. Lars EHLERS & Dipjyoti MAJUMDAR & Debasis MISHRA & Arunava SEN, 2016. "Continuity and Incentive Compatibility in Cardinal Voting Mechanisms," Cahiers de recherche 04-2016, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    8. Felix Brand & Patrick Lederer & Sascha Tausch, 2023. "Strategyproof Social Decision Schemes on Super Condorcet Domains," Papers 2302.12140, arXiv.org.
    9. 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.
    10. 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.
    11. 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.
    12. Lê Nguyên Hoang, 2017. "Strategy-proofness of the randomized Condorcet voting system," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(3), pages 679-701, March.
    13. Chatterji, Shurojit & Sen, Arunava & Zeng, Huaxia, 2014. "Random dictatorship domains," Games and Economic Behavior, Elsevier, vol. 86(C), pages 212-236.
    14. Morimoto, Shuhei, 2022. "Group strategy-proof probabilistic voting with single-peaked preferences," Journal of Mathematical Economics, Elsevier, vol. 102(C).
    15. 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.
    16. Roy, Souvik & Sadhukhan, Soumyarup, 2021. "A unified characterization of the randomized strategy-proof rules," Journal of Economic Theory, Elsevier, vol. 197(C).
    17. Brandt, Felix & Saile, Christian & Stricker, Christian, 2022. "Strategyproof social choice when preferences and outcomes may contain ties," Journal of Economic Theory, Elsevier, vol. 202(C).
    18. 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.
    19. Jérémy Picot, 2012. "Random aggregation without the Pareto principle," Review of Economic Design, Springer;Society for Economic Design, vol. 16(1), pages 1-13, March.
    20. 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).

    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:eee:matsoc:v:90:y:2017:i:c:p:28-34. 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/inca/505565 .

    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.