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

Nash rationalization of collective choice over lotteries

Author

Listed:
  • Demuynck, Thomas
  • Lauwers, Luc

Abstract

To test the joint hypothesis that players in a noncooperative game (allowing mixtures over pure strategies) consult an independent preference relation and select a Nash equilibrium, it suffices to study the reaction of the revealed collective choice upon changes in the space of strategies available to the players. The joint hypothesis is supported if the revealed choices satisfy an extended version of Richter's congruence axiom together with a contraction-expansion axiom that models the noncooperative behavior. In addition, we provide sufficient and necessary conditions for a binary relation to have an independent ordering extension, and for individual choices over lotteries to be rationalizable by an independent preference relation.

Suggested Citation

  • Demuynck, Thomas & Lauwers, Luc, 2009. "Nash rationalization of collective choice over lotteries," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 1-15, January.
  • Handle: RePEc:eee:matsoc:v:57:y:2009:i:1:p:1-15
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(08)00065-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Clark, Stephen A., 1995. "Indecisive choice theory," Mathematical Social Sciences, Elsevier, vol. 30(2), pages 155-170, October.
    2. Kim, Taesung, 1996. "Revealed preference theory on the choice of lotteries," Journal of Mathematical Economics, Elsevier, vol. 26(4), pages 463-477.
    3. Ray, Indrajit & Zhou, Lin, 2001. "Game Theory via Revealed Preferences," Games and Economic Behavior, Elsevier, vol. 37(2), pages 415-424, November.
    4. Adam Galambos, 2005. "Revealed Preference in Game Theory," 2005 Meeting Papers 776, Society for Economic Dynamics.
    5. Sprumont, Yves, 2000. "On the Testable Implications of Collective Choice Theories," Journal of Economic Theory, Elsevier, vol. 93(2), pages 205-232, August.
    6. Sopher & Narramore, 2000. "Stochastic Choice and Consistency in Decision Making Under Risk: An Experimental Study," Theory and Decision, Springer, vol. 48(4), pages 323-349, June.
    7. Shachat, Jason M., 2002. "Mixed Strategy Play and the Minimax Hypothesis," Journal of Economic Theory, Elsevier, vol. 104(1), pages 189-226, May.
    8. Oliver, Adam, 2003. "A quantitative and qualitative test of the Allais paradox using health outcomes," Journal of Economic Psychology, Elsevier, vol. 24(1), pages 35-48, February.
    9. Conlisk, John, 1989. "Three Variants on the Allais Example," American Economic Review, American Economic Association, vol. 79(3), pages 392-407, June.
    10. Barry Sopher & Mattison Narramore, 2000. "Stochastic Choice and Consistency in Decision Making Under Uncertainty: An Experimental Study," Departmental Working Papers 199626, Rutgers University, Department of Economics.
    11. Amartya K. Sen, 1971. "Choice Functions and Revealed Preference," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 38(3), pages 307-317.
    12. Oliver, Adam, 2003. "A quantitative and qualitative test of the Allais paradox using health outcomes," LSE Research Online Documents on Economics 155, London School of Economics and Political Science, LSE Library.
    13. repec:bla:econom:v:43:y:1976:i:172:p:381-90 is not listed on IDEAS
    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. Ray, Indrajit & Snyder, Susan, 2013. "Observable implications of Nash and subgame-perfect behavior in extensive games," Journal of Mathematical Economics, Elsevier, vol. 49(6), pages 471-477.
    2. Thomas Demuynck, 2014. "The computational complexity of rationalizing Pareto optimal choice behavior," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 529-549, March.
    3. Mabrouk, Mohamed, 2018. "On the Extension and Decomposition of a Preorder under Translation Invariance," MPRA Paper 90537, University Library of Munich, Germany.
    4. Ray, Indrajit & Snyder, Susan, 2013. "Observable implications of Nash and subgame-perfect behavior in extensive games," Journal of Mathematical Economics, Elsevier, vol. 49(6), pages 471-477.
    5. Mabrouk, Mohamed, 2009. "On the extension of a preorder under translation invariance," MPRA Paper 15407, University Library of Munich, Germany.
    6. Mikhail Freer & Cesar Martinelli, 2018. "A Functional Approach to Revealed Preference," Working Papers ECARES 2018-29, ULB -- Universite Libre de Bruxelles.
    7. Mikhail Freer & César Martinelli, 2023. "An algebraic approach to revealed preference," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 75(3), pages 717-742, April.
    8. Athanasios Andrikopoulos, 2017. "Generalizations of Szpilrajn's Theorem in economic and game theories," Papers 1708.04711, arXiv.org.
    9. Lee, SangMok, 2012. "The testable implications of zero-sum games," Journal of Mathematical Economics, Elsevier, vol. 48(1), pages 39-46.
    10. Athanasios Andrikopoulos, 2019. "On the extension of binary relations in economic and game theories," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 42(1), pages 277-285, June.
    11. Mikhail Freer & Cesar Martinelli, 2018. "A Functional Approach to Revealed Preference," Working Papers 1070, George Mason University, Interdisciplinary Center for Economic Science.
    12. Demuynck, Thomas, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.
    13. Rehbeck, John, 2018. "Note on unique Nash equilibrium in continuous games," Games and Economic Behavior, Elsevier, vol. 110(C), pages 216-225.
    14. T. Demuynck, 2009. "Common ordering extensions," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 09/593, Ghent University, Faculty of Economics and Business Administration.

    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. Ray, Indrajit & Snyder, Susan, 2013. "Observable implications of Nash and subgame-perfect behavior in extensive games," Journal of Mathematical Economics, Elsevier, vol. 49(6), pages 471-477.
    2. Carvajal, Andres & Ray, Indrajit & Snyder, Susan, 2004. "Equilibrium behavior in markets and games: testable restrictions and identification," Journal of Mathematical Economics, Elsevier, vol. 40(1-2), pages 1-40, February.
    3. Walter Bossert & Yves Sprumont, 2002. "Core rationalizability in two-agent exchange economies," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 20(4), pages 777-791.
    4. Dillenberger, David & Segal, Uzi, 2017. "Skewed noise," Journal of Economic Theory, Elsevier, vol. 169(C), pages 344-364.
    5. Ray, Indrajit & Snyder, Susan, 2013. "Observable implications of Nash and subgame-perfect behavior in extensive games," Journal of Mathematical Economics, Elsevier, vol. 49(6), pages 471-477.
    6. Rehbeck, John, 2014. "Every choice correspondence is backwards-induction rationalizable," Games and Economic Behavior, Elsevier, vol. 88(C), pages 207-210.
    7. Walter Bossert & Yves Sprumont, 2013. "Every Choice Function Is Backwards‐Induction Rationalizable," Econometrica, Econometric Society, vol. 81(6), pages 2521-2534, November.
    8. Li, Jiangtao & Tang, Rui, 2017. "Every random choice rule is backwards-induction rationalizable," Games and Economic Behavior, Elsevier, vol. 104(C), pages 563-567.
    9. Nishimura, Hiroki, 2021. "Revealed preferences of individual players in sequential games," Journal of Mathematical Economics, Elsevier, vol. 96(C).
    10. T. Demuynck & L. Lauwers, 2005. "Nash rationalizability of collective choice over lotteries," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 05/301, Ghent University, Faculty of Economics and Business Administration.
    11. Bossert, Walter & Sprumont, Yves, 2003. "Efficient and non-deteriorating choice," Mathematical Social Sciences, Elsevier, vol. 45(2), pages 131-142, April.
    12. Oliver, Adam & Sunstein, Cass, 2019. "Does size matter? The Allais paradox and preference reversals with varying outcome magnitudes," Journal of Behavioral and Experimental Economics (formerly The Journal of Socio-Economics), Elsevier, vol. 78(C), pages 45-60.
    13. Xu, Yongsheng & Zhou, Lin, 2007. "Rationalizability of choice functions by game trees," Journal of Economic Theory, Elsevier, vol. 134(1), pages 548-556, May.
    14. Oliver, Adam & Sunstein, Cass, 2019. "Does size matter? The Allais paradox and preference reversals with varying outcome magnitudes," LSE Research Online Documents on Economics 91130, London School of Economics and Political Science, LSE Library.
    15. Lee, SangMok, 2012. "The testable implications of zero-sum games," Journal of Mathematical Economics, Elsevier, vol. 48(1), pages 39-46.
    16. Simone Cerreia‐Vioglio & David Dillenberger & Pietro Ortoleva, 2015. "Cautious Expected Utility and the Certainty Effect," Econometrica, Econometric Society, vol. 83, pages 693-728, March.
    17. Andrés Carvajal, 2003. "Testable Restrictions of Nash Equilibrium in Games with Continuous Domains," Borradores de Economia 229, Banco de la Republica de Colombia.
    18. Simone Cerreia-Vioglio & David Dillenberger & Pietro Ortoleva & Gil Riella, 2019. "Deliberately Stochastic," American Economic Review, American Economic Association, vol. 109(7), pages 2425-2445, July.
      • Simone Cerreia-Vioglio & David Dillenberger & Pietro Ortoleva & Gil Riella, 2012. "Deliberately Stochastic," PIER Working Paper Archive 17-013, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 25 May 2017.
    19. Thomas Demuynck, 2014. "The computational complexity of rationalizing Pareto optimal choice behavior," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 529-549, March.
    20. Soham R. Phade & Venkat Anantharam, 2020. "Black-Box Strategies and Equilibrium for Games with Cumulative Prospect Theoretic Players," Papers 2004.09592, arXiv.org.

    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:57:y:2009:i:1:p:1-15. 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.