IDEAS home Printed from https://ideas.repec.org/a/eee/jetheo/v70y1996i1p32-42.html
   My bibliography  Save this article

An Extensive Game as a Guide for Solving a Normal Game

Author

Listed:
  • Glazer, Jacob
  • Rubinstein, Ariel

Abstract

No abstract is available for this item.

Suggested Citation

  • Glazer, Jacob & Rubinstein, Ariel, 1996. "An Extensive Game as a Guide for Solving a Normal Game," Journal of Economic Theory, Elsevier, vol. 70(1), pages 32-42, July.
  • Handle: RePEc:eee:jetheo:v:70:y:1996:i:1:p:32-42
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0022-0531(96)90074-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hitoshi Matsushima, 2017. "Framing Game Theory," CARF F-Series CARF-F-425, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    2. Katok, Elena & Sefton, Martin & Yavas, Abdullah, 2002. "Implementation by Iterative Dominance and Backward Induction: An Experimental Comparison," Journal of Economic Theory, Elsevier, vol. 104(1), pages 89-103, May.
    3. André Schmelzer, 2018. "Strategy-Proofness of Stochastic Assignment Mechanisms," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 3(1), pages 17-50, December.
    4. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    5. Pierpaolo Battigalli & Simone Cerreia-Vioglio & Fabio Maccheroni & Massimo Marinacci, 2017. "Mixed extensions of decision problems under uncertainty," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(4), pages 827-866, April.
    6. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    7. Breitmoser, Yves & Schweighofer-Kodritsch, Sebastian, 2019. "Obviousness around the clock," Discussion Papers, Research Unit: Market Behavior SP II 2019-203, WZB Berlin Social Science Center.
    8. Yutaka Kayaba & Jun Maekawa & Hitoshi Matsushima, 2023. "The Effect of Framing in Sealed-Bid Auctions: Theory and Experiments," CARF F-Series CARF-F-567, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    9. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2020. "On obvious strategy-proofness and single-peakedness," Journal of Economic Theory, Elsevier, vol. 186(C).
    10. Jacob Glazer & Ariel Rubinstein, 2012. "A Model of Persuasion with Boundedly Rational Agents," Journal of Political Economy, University of Chicago Press, vol. 120(6), pages 1057-1082.
    11. Shengwu Li, 2024. "Designing Simple Mechanisms," Papers 2403.18694, arXiv.org, revised Apr 2024.
    12. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    13. Sylvain Chassang & Lucia Del Carpio & Samuel Kapon, 2022. "Using Divide and Conquer to Improve Tax Collection: Theory and Laboratory Evidence," Working Papers 299, Princeton University, Department of Economics, Center for Economic Policy Studies..
    14. Esponda, Ignacio & Vespa, Emanuel, 2023. "Contingent Thinking and the Sure-Thing Principle: Revisiting Classic Anomalies in the Laboratory#," University of California at San Diego, Economics Working Paper Series qt32j4d5z2, Department of Economics, UC San Diego.
    15. Sylvain Chassang & Lucia Del Carpio & Samuel Kapon, 2020. "Making the Most of Limited Government Capacity: Theory and Experiment," Working Papers 2020-7, Princeton University. Economics Department..
    16. Yukio KORIYAMA & Matias Nunez, 2014. "Hybrid Procedures," THEMA Working Papers 2014-02, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    17. Yves Breitmoser & Sebastian Schweighofer-Kodritsch, 2022. "Obviousness around the clock," Experimental Economics, Springer;Economic Science Association, vol. 25(2), pages 483-513, April.
    18. Ohnishi, Kazuhiro, 2018. "Non-Altruistic Equilibria," MPRA Paper 88347, University Library of Munich, Germany.
    19. Chen, Yi-Chun & Sun, Yifei, 2015. "Full implementation in backward induction," Journal of Mathematical Economics, Elsevier, vol. 59(C), pages 71-76.

    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:eee:jetheo:v:70:y:1996:i:1:p:32-42. 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.

    We have no bibliographic references for this item. You can help adding them by using 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/622869 .

    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.