IDEAS home Printed from https://ideas.repec.org/a/spr/sochwe/v48y2017i1d10.1007_s00355-015-0915-2.html
   My bibliography  Save this article

Implementation in stochastic dominance Nash equilibria

Author

Listed:
  • Eun Jeong Heo

    (Vanderbilt University)

  • Vikram Manjunath

    (Texas A&M University)

Abstract

We study solutions that choose lotteries for profiles of preferences defined over sure alternatives. We define Nash equilibria based on “stochastic dominance” comparisons and study the implementability of solutions in such equilibria. We show that a Maskin-style invariance condition is necessary and sufficient for implementability. Our results apply to an abstract Arrovian environment as well as a broad class of economic environments.

Suggested Citation

  • Eun Jeong Heo & Vikram Manjunath, 2017. "Implementation in stochastic dominance Nash equilibria," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 5-30, January.
    • Handle: RePEc:spr:sochwe:v:48:y:2017:i:1:d:10.1007_s00355-015-0915-2
    DOI: 10.1007/s00355-015-0915-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00355-015-0915-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00355-015-0915-2?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. Stergios Athanassoglou & Jay Sethuraman, 2011. "House allocation with fractional endowments," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(3), pages 481-513, August.
    2. Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
    3. Myerson, Roger B, 1979. "Incentive Compatibility and the Bargaining Problem," Econometrica, Econometric Society, vol. 47(1), pages 61-73, January.
    4. Eric Maskin, 1999. "Nash Equilibrium and Welfare Optimality," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 66(1), pages 23-38.
    5. Ehlers, Lars & Masso, Jordi, 2007. "Incomplete information and singleton cores in matching markets," Journal of Economic Theory, Elsevier, vol. 136(1), pages 587-600, September.
    6. Benoît, Jean-Pierre & Ok, Efe A., 2008. "Nash implementation without no-veto power," Games and Economic Behavior, Elsevier, vol. 64(1), pages 51-67, September.
    7. Heo, Eun Jeong, 2014. "Probabilistic assignment problem with multi-unit demands: A generalization of the serial rule and its characterization," Journal of Mathematical Economics, Elsevier, vol. 54(C), pages 40-47.
    8. Harris Milton & Townsend, Robert M, 1981. "Resource Allocation under Asymmetric Information," Econometrica, Econometric Society, vol. 49(1), pages 33-64, January.
    9. Olivier Bochet, 2007. "Nash Implementation with Lottery Mechanisms," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 28(1), pages 111-125, January.
    10. Hylland, Aanund & Zeckhauser, Richard, 1979. "The Efficient Allocation of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 87(2), pages 293-314, April.
    11. Eric Budish & Yeon-Koo Che & Fuhito Kojima & Paul Milgrom, 2013. "Designing Random Allocation Mechanisms: Theory and Applications," American Economic Review, American Economic Association, vol. 103(2), pages 585-623, April.
    12. William Thomson, 1999. "Monotonic extensions on economic domains," Review of Economic Design, Springer;Society for Economic Design, vol. 4(1), pages 13-33.
    13. Matsushima, Hitoshi, 1988. "A new approach to the implementation problem," Journal of Economic Theory, Elsevier, vol. 45(1), pages 128-144, June.
    14. Pais, Joana, 2008. "Incentives in decentralized random matching markets," Games and Economic Behavior, Elsevier, vol. 64(2), pages 632-649, November.
    15. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
    16. Gibbard, Allan, 1977. "Manipulation of Schemes That Mix Voting with Chance," Econometrica, Econometric Society, vol. 45(3), pages 665-681, April.
    17. Eric Budish, 2011. "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes," Journal of Political Economy, University of Chicago Press, vol. 119(6), pages 1061-1103.
    18. Partha Dasgupta & Peter Hammond & Eric Maskin, 1979. "The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 46(2), pages 185-216.
    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. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
    2. Eduardo M Azevedo & Eric Budish, 2019. "Strategy-proofness in the Large," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 86(1), pages 81-116.
    3. Haris Aziz & Yoichi Kasajima, 2017. "Impossibilities for probabilistic assignment," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 255-275, August.
    4. Ortega, Josué, 2020. "Multi-unit assignment under dichotomous preferences," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 15-24.
    5. Onur Kesten & Morimitsu Kurino & Alexander S. Nesterov, 2017. "Efficient lottery design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 31-57, January.
    6. Maskin, Eric & Sjostrom, Tomas, 2002. "Implementation theory," Handbook of Social Choice and Welfare,in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 1, chapter 5, pages 237-288 Elsevier.
    7. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    8. Han, Xiang, 2024. "A theory of fair random allocation under priorities," Theoretical Economics, Econometric Society, vol. 19(3), July.
    9. Nguyen, Thành & Peivandi, Ahmad & Vohra, Rakesh, 2016. "Assignment problems with complementarities," Journal of Economic Theory, Elsevier, vol. 165(C), pages 209-241.
    10. Hashimoto, Tadashi, 2018. "The generalized random priority mechanism with budgets," Journal of Economic Theory, Elsevier, vol. 177(C), pages 708-733.
    11. Laslier, Jean-François & Núñez, Matías & Remzi Sanver, M., 2021. "A solution to the two-person implementation problem," Journal of Economic Theory, Elsevier, vol. 194(C).
    12. Mezzetti, Claudio & Renou, Ludovic, 2012. "Implementation in mixed Nash equilibrium," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2357-2375.
    13. Aziz, Haris & Brandl, Florian, 2022. "The vigilant eating rule: A general approach for probabilistic economic design with constraints," Games and Economic Behavior, Elsevier, vol. 135(C), pages 168-187.
    14. Wonki Jo Cho, 2018. "Probabilistic assignment: an extension approach," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(1), pages 137-162, June.
    15. Haris Aziz & Florian Brandl, 2020. "The Vigilant Eating Rule: A General Approach for Probabilistic Economic Design with Constraints," Papers 2008.08991, arXiv.org, revised Jul 2021.
    16. Thanh Nguyen & Ahmad Peivandi & Rakesh Vohra, 2014. "One-Sided Matching with Limited Complementarities," PIER Working Paper Archive 14-030, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    17. Basteck, Christian, 2018. "Fair solutions to the random assignment problem," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 163-172.
    18. Afacan, Mustafa Oǧuz, 2018. "The object allocation problem with random priorities," Games and Economic Behavior, Elsevier, vol. 110(C), pages 71-89.
    19. Daniel Kornbluth & Alexey Kushnir, 2024. "Undergraduate Course Allocation through Competitive Markets," Papers 2412.05691, arXiv.org.
    20. Andrew McLennan & Shino Takayama & Yuki Tamura, 2024. "An Efficient, Computationally Tractable School Choice Mechanism," Discussion Papers Series 668, School of Economics, University of Queensland, Australia.

    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:spr:sochwe:v:48:y:2017:i:1:d:10.1007_s00355-015-0915-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.