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

Symmetric reduced form voting

Author

Listed:
  • Debasis Mishra

    (Indian Statistical Institute, Delhi)

  • Xu Lang

    (Southwest University of Finance and Economics)

Abstract

We study a model of voting with two alternatives in a symmetric environment. We characterize the interim allocation probabilities that can be implemented by a symmetric voting rule. We show that every such interim allocation probabilities can be implemented as a convex combination of two families of deterministic voting rules: qualified majority and qualified anti-majority. We also provide analogous results by requiring implementation by a unanimous voting rule. A consequence of our results is that if the prior is indepenent, every symmetric and orinally Bayesian incentive compatible voting rule is reduced (interim) form equivalent to a symmetric and strategy-proof voting rule.

Suggested Citation

  • Debasis Mishra & Xu Lang, 2022. "Symmetric reduced form voting," Discussion Papers 22-03, Indian Statistical Institute, Delhi.
    • Handle: RePEc:alo:isipdp:22-03
    as

    Download full text from publisher

    File URL: https://www.isid.ac.in/~epu/dispapers/dp22_03.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sergiu Hart & Philip J. Reny, 2015. "Implementation of reduced form mechanisms: a simple approach and a new characterization," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 3(1), pages 1-8, April.
    2. Tymofiy Mylovanov & Andriy Zapechelnyuk, 2017. "Optimal Allocation with Ex Post Verification and Limited Penalties," American Economic Review, American Economic Association, vol. 107(9), pages 2666-2694, September.
    3. Rahul Deb & Mallesh M. Pai, 2017. "Discrimination via Symmetric Auctions," American Economic Journal: Microeconomics, American Economic Association, vol. 9(1), pages 275-314, February.
    4. Dipjyoti Majumdar & Arunava Sen, 2004. "Ordinally Bayesian Incentive Compatible Voting Rules," Econometrica, Econometric Society, vol. 72(2), pages 523-540, March.
    5. Matthews, Steven A, 1984. "On the Implementability of Reduced Form Auctions," Econometrica, Econometric Society, vol. 52(6), pages 1519-1522, November.
    6. Border, Kim C, 1991. "Implementation of Reduced Form Auctions: A Geometric Approach," Econometrica, Econometric Society, vol. 59(4), pages 1175-1187, July.
    7. Xu Lang & Zaifu Yang, 2021. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints," Discussion Papers 21/04, Department of Economics, University of York.
    8. Goeree, Jacob K. & Kushnir, Alexey, 2016. "Reduced form implementation for environments with value interdependencies," Games and Economic Behavior, Elsevier, vol. 99(C), pages 250-256.
    9. Erya Yang, 2021. "Reduced-form mechanism design and ex post fairness constraints," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 9(2), pages 269-293, October.
    10. Yeon‐Koo Che & Jinwoo Kim & Konrad Mierendorff, 2013. "Generalized Reduced‐Form Auctions: A Network‐Flow Approach," Econometrica, Econometric Society, vol. 81(6), pages 2487-2520, November.
    11. Xu Lang, 2022. "Reduced-form budget allocation with multiple public alternatives," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(2), pages 335-359, August.
    12. Mishra, Debasis, 2016. "Ordinal Bayesian incentive compatibility in restricted domains," Journal of Economic Theory, Elsevier, vol. 163(C), pages 925-954.
    13. Nehring, Klaus, 2004. "The veil of public ignorance," Journal of Economic Theory, Elsevier, vol. 119(2), pages 247-270, December.
    14. Pai, Mallesh M. & Vohra, Rakesh, 2014. "Optimal auctions with financially constrained buyers," Journal of Economic Theory, Elsevier, vol. 150(C), pages 383-425.
    15. Xu Lang & Zaifu Yang, 2021. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints: A Revision," Discussion Papers 21/05, Department of Economics, University of York.
    16. Saeed Alaei & Hu Fu & Nima Haghpanah & Jason Hartline & Azarakhsh Malekian, 2019. "Efficient Computation of Optimal Auctions via Reduced Forms," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 1058-1086, August.
    17. Maskin, Eric S & Riley, John G, 1984. "Optimal Auctions with Risk Averse Buyers," Econometrica, Econometric Society, vol. 52(6), pages 1473-1518, November.
    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. Xu Lang & Debasis Mishra, 2022. "Symmetric reduced form voting," Papers 2207.09253, arXiv.org, revised Apr 2023.
    2. Lang, Xu & Mishra, Debasis, 0. "Symmetric reduced form voting," Theoretical Economics, Econometric Society.
    3. Xu Lang & Zaifu Yang, 2023. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints," Discussion Papers 23/02, Department of Economics, University of York.
    4. Xu Lang, 2022. "Reduced-form budget allocation with multiple public alternatives," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(2), pages 335-359, August.
    5. Xu Lang, 2022. "Reduced-Form Allocations with Complementarity: A 2-Person Case," Papers 2202.06245, arXiv.org, revised Feb 2022.
    6. Goeree, Jacob K. & Kushnir, Alexey, 2016. "Reduced form implementation for environments with value interdependencies," Games and Economic Behavior, Elsevier, vol. 99(C), pages 250-256.
    7. Xu Lang & Zaifu Yang, 2021. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints: A Revision," Discussion Papers 21/05, Department of Economics, University of York.
    8. Xu Lang & Zaifu Yang, 2021. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints," Discussion Papers 21/04, Department of Economics, University of York.
    9. Li, Yunan, 2019. "Efficient mechanisms with information acquisition," Journal of Economic Theory, Elsevier, vol. 182(C), pages 279-328.
    10. Yunan Li, 2017. "Mechanism Design with Costly Verification and Limited Punishments, Third Version," PIER Working Paper Archive 16-009, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 28 Sep 2017.
    11. Yunan Li, 2017. "Efficient Mechanisms with Information Acquisition," PIER Working Paper Archive 16-007, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 23 Jun 2017.
    12. Xu Lang, 2023. "A Belief-Based Characterization of Reduced-Form Auctions," Papers 2307.04070, arXiv.org.
    13. Erya Yang, 2021. "Reduced-form mechanism design and ex post fairness constraints," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 9(2), pages 269-293, October.
    14. Li, Yunan, 2020. "Mechanism design with costly verification and limited punishments," Journal of Economic Theory, Elsevier, vol. 186(C).
    15. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    16. Sergiu Hart & Philip J. Reny, 2015. "Implementation of reduced form mechanisms: a simple approach and a new characterization," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 3(1), pages 1-8, April.
    17. Alex Gershkov & Benny Moldovanu & Philipp Strack & Mengxi Zhang, 2021. "A Theory of Auctions with Endogenous Valuations," Journal of Political Economy, University of Chicago Press, vol. 129(4), pages 1011-1051.
    18. Pai, Mallesh M. & Vohra, Rakesh, 2014. "Optimal auctions with financially constrained buyers," Journal of Economic Theory, Elsevier, vol. 150(C), pages 383-425.
    19. Saeed Alaei & Hu Fu & Nima Haghpanah & Jason Hartline & Azarakhsh Malekian, 2019. "Efficient Computation of Optimal Auctions via Reduced Forms," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 1058-1086, August.
    20. Andreas Kleiner & Benny Moldovanu & Philipp Strack, 2021. "Extreme Points and Majorization: Economic Applications," Econometrica, Econometric Society, vol. 89(4), pages 1557-1593, July.

    More about this item

    Keywords

    reduced form voting; unanimous voting; ordinal Bayesian incentive compatibility;
    All these keywords.

    JEL classification:

    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    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:alo:isipdp:22-03. 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.