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

Ordinally Bayesian incentive compatible probabilistic voting rules

Author

Listed:
  • Majumdar, Dipjyoti
  • Roy, Souvik

Abstract

We study probabilistic voting rules in a two-voter model. The notion of incentive compatibility we consider is ordinal Bayesian incentive compatibility (OBIC) as introduced in d’Aspremont and Peleg (1988). We show that there exist anonymous and ex-post efficient probabilistic voting rules that are not random dictatorships and at the same time are OBIC with respect to an independently distributed generic prior. This contrasts with the results obtained for deterministic voting mechanisms obtained in Majumdar and Sen (2004) and in Mishra (2016). In case of neutral and efficient rules, there are two kinds of results. First we show that imposing OBIC with respect to some generic prior leads to random dictatorship when there are three alternatives. Second, we show that the result is no longer true when there are four or more alternatives and consequently we provide sufficient conditions on the priors for the result to be true.

Suggested Citation

  • Majumdar, Dipjyoti & Roy, Souvik, 2021. "Ordinally Bayesian incentive compatible probabilistic voting rules," Mathematical Social Sciences, Elsevier, vol. 114(C), pages 11-27.
    • Handle: RePEc:eee:matsoc:v:114:y:2021:i:c:p:11-27
    DOI: 10.1016/j.mathsocsci.2021.09.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489621001001
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2021.09.002?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. d’ASPREMONT, C. & PELEG, B., 1986. "Ordinal Bayesian incentive compatible representations of committees," LIDAM Discussion Papers CORE 1986042, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Mishra, Debasis, 2016. "Ordinal Bayesian incentive compatibility in restricted domains," Journal of Economic Theory, Elsevier, vol. 163(C), pages 925-954.
    3. Dipjyoti Majumdar & Arunava Sen, 2004. "Ordinally Bayesian Incentive Compatible Voting Rules," Econometrica, Econometric Society, vol. 72(2), pages 523-540, March.
    4. Gibbard, Allan, 1977. "Manipulation of Schemes That Mix Voting with Chance," Econometrica, Econometric Society, vol. 45(3), pages 665-681, April.
    5. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    6. Karmokar, Madhuparna & Roy, Souvik, 2020. "The structure of (local) ordinal Bayesian incentive compatible random rules," MPRA Paper 103494, University Library of Munich, Germany.
    7. Sulagna Dasgupta & Debasis Mishra, 2020. "Ordinal Bayesian incentive compatibility in random assignment model," Papers 2009.13104, arXiv.org, revised May 2021.
    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. Madhuparna Karmokar & Souvik Roy, 2023. "The structure of (local) ordinal Bayesian incentive compatible random rules," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(1), pages 111-152, July.

    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. Sulagna Dasgupta & Debasis Mishra, 2022. "Ordinal Bayesian incentive compatibility in random assignment model," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 651-664, December.
    2. Karmokar, Madhuparna & Roy, Souvik, 2020. "The structure of (local) ordinal Bayesian incentive compatible random rules," MPRA Paper 103494, University Library of Munich, Germany.
    3. Madhuparna Karmokar & Souvik Roy, 2023. "The structure of (local) ordinal Bayesian incentive compatible random rules," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(1), pages 111-152, July.
    4. Sulagna Dasgupta & Debasis Mishra, 2020. "Ordinal Bayesian incentive compatibility in random assignment model," Papers 2009.13104, arXiv.org, revised May 2021.
    5. 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.
    6. Miho Hong & Semin Kim, 2023. "Unanimity and local incentive compatibility in sparsely connected domains," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 61(2), pages 385-411, August.
    7. Roy, Souvik & Sadhukhan, Soumyarup, 2022. "On the equivalence of strategy-proofness and upper contour strategy-proofness for randomized social choice functions," Journal of Mathematical Economics, Elsevier, vol. 99(C).
    8. Dipjyoti Majumdar & Arunava Sen, 2021. "Robust incentive compatibility of voting rules with positively correlated beliefs," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(1), pages 63-95, July.
    9. Mishra, Debasis, 2016. "Ordinal Bayesian incentive compatibility in restricted domains," Journal of Economic Theory, Elsevier, vol. 163(C), pages 925-954.
    10. Miho Hong & Semin Kim, 2018. "Unanimity and Local Incentive Compatibility," Working papers 2018rwp-138, Yonsei University, Yonsei Economics Research Institute.
    11. Yasunori Okumura, 2021. "Rank-dominant strategy and sincere voting," Theory and Decision, Springer, vol. 90(1), pages 117-145, February.
    12. 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.
    13. Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.
    14. Nozomu Muto & Shin Sato, 2016. "A decomposition of strategy-proofness," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(2), pages 277-294, August.
    15. Mukherjee, Saptarshi & Muto, Nozomu & Ramaekers, Eve & Sen, Arunava, 2019. "Implementation in undominated strategies by bounded mechanisms: The Pareto correspondence and a generalization," Journal of Economic Theory, Elsevier, vol. 180(C), pages 229-243.
    16. Xu Lang & Debasis Mishra, 2022. "Symmetric reduced form voting," Papers 2207.09253, arXiv.org, revised Apr 2023.
    17. 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.
    18. 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.
    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. Pycia, Marek & Ünver, M. Utku, 2015. "Decomposing random mechanisms," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 21-33.

    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:114:y:2021:i:c:p:11-27. 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.