IDEAS home Printed from https://ideas.repec.org/p/nwu/cmsems/1141.html
   My bibliography  Save this paper

Games

Author

Listed:
  • Ehud Kalai

Abstract

The scientific interaction of game theory with computer science and operations research is broad and fundamental. It covers a large variety of applications in all three fields, and it transfes concepts, language, and results across fields. Listing all the areas of overlap will be long and tedious. I will therefore restrict myself to discuss a few, easy to present examples, where the cross-fertilization of ideas was successful, and point to a need for further research.

Suggested Citation

  • Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    • Handle: RePEc:nwu:cmsems:1141
    as

    Download full text from publisher

    File URL: http://www.kellogg.northwestern.edu/research/math/papers/1141.pdf
    File Function: main text
    Download Restriction: no
    File URL: http://www.kellogg.northwestern.edu/research/math/papers/1141.pdf
    File Function: main text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ben-porath, Elchanan, 1990. "The complexity of computing a best response automaton in repeated games with mixed strategies," Games and Economic Behavior, Elsevier, vol. 2(1), pages 1-12, March.
    2. Linial, Nathan, 1994. "Game-theoretic aspects of computing," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 2, chapter 38, pages 1339-1395, Elsevier.
    3. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
    4. Gilboa, Itzhak & Samet, Dov, 1989. "Bounded versus unbounded rationality: The tyranny of the weak," Games and Economic Behavior, Elsevier, vol. 1(3), pages 213-221, September.
    5. Aumann, Robert J. & Sorin, Sylvain, 1989. "Cooperation and bounded recall," Games and Economic Behavior, Elsevier, vol. 1(1), pages 5-39, March.
    6. Gilboa, Itzhak & Zemel, Eitan, 1989. "Nash and correlated equilibria: Some complexity considerations," Games and Economic Behavior, Elsevier, vol. 1(1), pages 80-93, March.
    7. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
    8. Banks, Jeffrey S. & Sundaram, Rangarajan K., 1990. "Repeated games, finite automata, and complexity," Games and Economic Behavior, Elsevier, vol. 2(2), pages 97-117, June.
    9. Kalai, Ehud & Postlewaite, Andrew & Roberts, John, 1978. "Barriers to trade and disadvantageous middlemen: Nonmonotonicity of the core," Journal of Economic Theory, Elsevier, vol. 19(1), pages 200-209, October.
    10. Lipman, Barton L. & Srivastava, Sanjay, 1990. "Computation as a correlation device," Games and Economic Behavior, Elsevier, vol. 2(2), pages 154-172, June.
    11. Chaim Fershtman & Ehud Kalai, 1993. "Complexity Considerations and Market Behavior," RAND Journal of Economics, The RAND Corporation, vol. 24(2), pages 224-235, Summer.
    12. Shapley, Lloyd S. & Shubik, Martin, 1969. "On market games," Journal of Economic Theory, Elsevier, vol. 1(1), pages 9-25, June.
    13. Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-1281, November.
    14. Mertens,Jean-François & Sorin,Sylvain & Zamir,Shmuel, 2015. "Repeated Games," Cambridge Books, Cambridge University Press, number 9781107030206.
      • Mertens,Jean-François & Sorin,Sylvain & Zamir,Shmuel, 2015. "Repeated Games," Cambridge Books, Cambridge University Press, number 9781107662636.
    15. Kenneth R. Mount & Stanley Reiter, 1996. "A lower bound on computational complexity given by revelation mechanisms (*)," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 7(2), pages 237-266.
    16. Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
    17. Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October.
    18. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
    19. Piccione, Michele, 1992. "Finite automata equilibria with discounting," Journal of Economic Theory, Elsevier, vol. 56(1), pages 180-193, February.
    20. Itzhak Gilboa & Ehud Kalai & Eitan Zemel, 1989. "The Complexity of Eliminating Dominated Strategies," Discussion Papers 853, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    21. Monderer, Dov & Samet, Dov, 1989. "Approximating common knowledge with common beliefs," Games and Economic Behavior, Elsevier, vol. 1(2), pages 170-190, June.
    22. Itzhak Gilboa & Ehud Kalai & Eitan Zemel, 1993. "The Complexity of Eliminating Dominated Strategies," Mathematics of Operations Research, INFORMS, vol. 18(3), pages 553-565, August.
    23. Gilboa, Itzhak, 1988. "The complexity of computing best-response automata in repeated games," Journal of Economic Theory, Elsevier, vol. 45(2), pages 342-352, August.
    24. Megiddo, Nimrod, 1989. "On computable beliefs of rational machines," Games and Economic Behavior, Elsevier, vol. 1(2), pages 144-169, June.
    25. Simon, Herbert A. & Schaeffer, Jonathan, 1992. "The game of chess," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 1, pages 1-17, Elsevier.
    26. Radner, Roy, 1993. "The Organization of Decentralized Information Processing," Econometrica, Econometric Society, vol. 61(5), pages 1109-1146, September.
    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. Aumann, Robert J., 1997. "Rationality and Bounded Rationality," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 2-14, October.
    2. Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 593-611, August.
    3. Gilboa Itzhak & Schmeidler David, 1994. "Infinite Histories and Steady Orbits in Repeated Games," Games and Economic Behavior, Elsevier, vol. 6(3), pages 370-399, May.
    4. Compte, Olivier & Postlewaite, Andrew, 2015. "Plausible cooperation," Games and Economic Behavior, Elsevier, vol. 91(C), pages 45-59.
    5. Ueda, Masahiko, 2023. "Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners’ dilemma game," Applied Mathematics and Computation, Elsevier, vol. 444(C).
    6. Renault, Jérôme & Scarsini, Marco & Tomala, Tristan, 2008. "Playing off-line games with bounded rationality," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 207-223, September.
    7. René Levínský & Abraham Neyman & Miroslav Zelený, 2020. "Should I remember more than you? Best responses to factored strategies," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(4), pages 1105-1124, December.
    8. David Baron & Ehud Kalai, 1990. "Dividing a Cake by Majority: The Simplest Equilibria," Discussion Papers 919, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    9. Ho, Teck-Hua, 1996. "Finite automata play repeated prisoner's dilemma with information processing costs," Journal of Economic Dynamics and Control, Elsevier, vol. 20(1-3), pages 173-207.
    10. Hernández, Penélope & Solan, Eilon, 2016. "Bounded computational capacity equilibrium," Journal of Economic Theory, Elsevier, vol. 163(C), pages 342-364.
    11. Bavly, Gilad & Peretz, Ron, 2019. "Limits of correlation in repeated games with bounded memory," Games and Economic Behavior, Elsevier, vol. 115(C), pages 131-145.
    12. Westhoff, Frank H. & Yarbrough, Beth V. & Yarbrough, Robert M., 1996. "Complexity, organization, and Stuart Kauffman's The Origins of Order," Journal of Economic Behavior & Organization, Elsevier, vol. 29(1), pages 1-25, January.
    13. Oliver Compte & Andrew Postlewaite, 2010. "Plausible Cooperation, Fourth Version," PIER Working Paper Archive 15-006, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 23 Jan 2015.
    14. Jérôme Renault & Marco Scarsini & Tristan Tomala, 2007. "A Minority Game with Bounded Recall," Mathematics of Operations Research, INFORMS, vol. 32(4), pages 873-889, November.
    15. Olivier Gossner & Penélope Hernández, 2003. "On the Complexity of Coordination," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 127-140, February.
    16. Jehiel, Philippe, 1998. "Learning to Play Limited Forecast Equilibria," Games and Economic Behavior, Elsevier, vol. 22(2), pages 274-298, February.
    17. Olivier Compte & Andrew Postlewaite, 2007. "Effecting Cooperation," PIER Working Paper Archive 09-019, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 29 May 2009.
    18. Nachbar, John H & Zame, William R, 1996. "Non-computable Strategies and Discounted Repeated Games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 103-122, June.
    19. Anderlini, Luca, 1998. "Forecasting errors and bounded rationality: An example," Mathematical Social Sciences, Elsevier, vol. 36(2), pages 71-90, September.
    20. Spiegler, Ran, 2004. "Simplicity of beliefs and delay tactics in a concession game," Games and Economic Behavior, Elsevier, vol. 47(1), pages 200-220, April.

    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:nwu:cmsems:1141. 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: Fran Walker (email available below). General contact details of provider: https://edirc.repec.org/data/cmnwuus.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.