This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Games

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Ehud Kalai

Additional information is available for the following registered author(s):

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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

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

Publisher Info
Paper provided by Northwestern University, Center for Mathematical Studies in Economics and Management Science in its series Discussion Papers with number 1141.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: Oct 1995
Date of revision:
Handle: RePEc:nwu:cmsems:1141

Contact details of provider:
Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014
Phone: 847/491-3527
Fax: 847/491-2530
Email:
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC

Order Information:
Email:

For technical questions regarding this item, or to correct its listing, contact: (Fran Walker).

Related research
Keywords:

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

  1. Chaim Fershtman & Ehud Kalai, 1993. "Complexity Considerations and Market Behavior," RAND Journal of Economics, The RAND Corporation, vol. 24(2), pages 224-235, Summer. [Downloadable!] (restricted)
    Other versions:
  2. Gilboa, Itzhak & Zemel, Eitan, 1989. "Nash and correlated equilibria: Some complexity considerations," Games and Economic Behavior, Elsevier, vol. 1(1), pages 80-93, March. [Downloadable!] (restricted)
    Other versions:
  3. Shapley, Lloyd S. & Shubik, Martin, 1969. "On market games," Journal of Economic Theory, Elsevier, vol. 1(1), pages 9-25, June. [Downloadable!] (restricted)
  4. Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-81, November. [Downloadable!] (restricted)
  5. 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. [Downloadable!] (restricted)
  6. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229. [Downloadable!] (restricted)
  7. 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. [Downloadable!] (restricted)
  8. Mount, Kenneth R & Reiter, Stanley, 1996. "A Lower Bound on Computational Complexity Given by Revelation Mechanisms," Economic Theory, Springer, vol. 7(2), pages 237-66, February.
    Other versions:
  9. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March. [Downloadable!] (restricted)
    Other versions:
  10. Megiddo, Nimrod, 1989. "On computable beliefs of rational machines," Games and Economic Behavior, Elsevier, vol. 1(2), pages 144-169, June. [Downloadable!] (restricted)
  11. Aumann, Robert J. & Sorin, Sylvain, 1989. "Cooperation and bounded recall," Games and Economic Behavior, Elsevier, vol. 1(1), pages 5-39, March. [Downloadable!] (restricted)
  12. 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. [Downloadable!] (restricted)
    Other versions:
  13. 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. [Downloadable!]
  14. 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. [Downloadable!] (restricted)
  15. 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. [Downloadable!] (restricted)
  16. Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October. [Downloadable!] (restricted)
  17. Monderer, Dov & Samet, Dov, 1989. "Approximating common knowledge with common beliefs," Games and Economic Behavior, Elsevier, vol. 1(2), pages 170-190, June. [Downloadable!] (restricted)
  18. Radner, Roy, 1993. "The Organization of Decentralized Information Processing," Econometrica, Econometric Society, vol. 61(5), pages 1109-46, September. [Downloadable!] (restricted)
  19. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June. [Downloadable!] (restricted)
  20. Lipman, Barton L. & Srivastava, Sanjay, 1990. "Computation as a correlation device," Games and Economic Behavior, Elsevier, vol. 2(2), pages 154-172, June. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? RePEc data is maintained by each archive holder on its own website. Nothing is held centrally.

This page was last updated on 2009-11-25.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.