IDEAS home Printed from https://ideas.repec.org/p/alo/isipdp/03-01.html
   My bibliography  Save this paper

Ordinally Bayesian incentive-compatible voting schemes

Author

Listed:
  • Dipjyoti Majumdar

    (Indian Statistical Institute, New Delhi)

  • Arunava Sen

    (Indian Statistical Institute, New Delhi)

Abstract

We study strategic voting after weakening the notion of strategy-proofness to Ordinal Bayesian Incentive Compatibility (OBIC). Under OBIC, truthelling is required to maximize the expected utility being computed with respect to the voter's prior beliefs and under the assumption that everybody else is also telling the truth. We show that for a special type of priors i.e., the uniform priors there exists a large class of social choice functions that are OBIC. However, for priors which are generic in the set of independent beliefs a social choice function is OBIC only if it is dictatorial. This result underlines the robustness of the Gibbard-Satterthwaite Theorem.

Suggested Citation

  • Dipjyoti Majumdar & Arunava Sen, 2003. "Ordinally Bayesian incentive-compatible voting schemes," Discussion Papers 03-01, Indian Statistical Institute, Delhi.
    • Handle: RePEc:alo:isipdp:03-01
    as

    Download full text from publisher

    File URL: http://www.isid.ac.in/~pu/dispapers/dp03-01.pdf
    Download Restriction: no
    ---><---

    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. Sen, Arunava, 2001. "Another direct proof of the Gibbard-Satterthwaite Theorem," Economics Letters, Elsevier, vol. 70(3), pages 381-385, March.
    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. Dipjyoti Majumdar, 2003. "Ordinally Bayesian Incentive Compatible Stable Matchings," Working Papers 05001, Concordia University, Department of Economics.

    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. Salvador Barberà, 2003. "A Theorem on Preference Aggregation," UFAE and IAE Working Papers 601.03, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
    3. Miller, Michael K., 2009. "Social choice theory without Pareto: The pivotal voter approach," Mathematical Social Sciences, Elsevier, vol. 58(2), pages 251-255, September.
    4. Bonifacio, Agustín G., 2024. "Trade-off between manipulability and dictatorial power: A proof of the Gibbard–Satterthwaite Theorem," Mathematical Social Sciences, Elsevier, vol. 130(C), pages 1-3.
    5. Majumdar, Dipjyoti & Roy, Souvik, 2021. "Ordinally Bayesian incentive compatible probabilistic voting rules," Mathematical Social Sciences, Elsevier, vol. 114(C), pages 11-27.
    6. repec:cte:werepe:we081207 is not listed on IDEAS
    7. Priscilla Man & Shino Takayama, 2013. "A unifying impossibility theorem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 54(2), pages 249-271, October.
    8. Gopakumar Achuthankutty & Souvik Roy, 2018. "Dictatorship on top-circular domains," Theory and Decision, Springer, vol. 85(3), pages 479-493, October.
    9. Shin Sato, 2010. "Circular domains," Review of Economic Design, Springer;Society for Economic Design, vol. 14(3), pages 331-342, September.
    10. Shurojit Chatterji & Arunava Sen, 2011. "Tops-only domains," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 46(2), pages 255-282, February.
    11. Alexander Reffgen, 2011. "Generalizing the Gibbard–Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 37(1), pages 39-59, June.
    12. Campbell, Donald E. & Kelly, Jerry S., 2006. "Social welfare functions generating social choice rules that are invulnerable to manipulation," Mathematical Social Sciences, Elsevier, vol. 51(1), pages 81-89, January.
    13. Mishra, Debasis, 2016. "Ordinal Bayesian incentive compatibility in restricted domains," Journal of Economic Theory, Elsevier, vol. 163(C), pages 925-954.
    14. 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.
    15. Baryshnikov, Yuliy & Root, Joseph, 2024. "A topological proof of the Gibbard–Satterthwaite theorem," Economics Letters, Elsevier, vol. 234(C).
    16. Chatterji, Shurojit & Zeng, Huaxia, 2023. "A taxonomy of non-dictatorial unidimensional domains," Games and Economic Behavior, Elsevier, vol. 137(C), pages 228-269.
    17. Joana Pais, 2008. "Random matching in the college admissions problem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 35(1), pages 99-116, April.
    18. EHLERS, Lars & MASSO, Jordi, 2018. "Robust design in monotonic matching markets: A case for firm-proposing deferred-acceptance," Cahiers de recherche 2018-02, Universite de Montreal, Departement de sciences economiques.
    19. Anup Pramanik, 2015. "Further results on dictatorial domains," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 45(2), pages 379-398, September.
    20. Arunava Sen, 2002. "Ordinally Bayesian Incentive-Compatible Voting Schemes joint with Dipjyoti Majumdar," Theory workshop papers 357966000000000090, UCLA Department of Economics.
    21. Shurojit Chatterji & Huaxia Zeng, 2023. "Decomposability and Strategy-proofness in Multidimensional Models," Papers 2303.10889, arXiv.org, revised Nov 2023.

    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:alo:isipdp:03-01. 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: Debasis Mishra (email available below). General contact details of provider: https://edirc.repec.org/data/isindin.html .

    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.