A computer scientist looks at game theory
AbstractI consider issues in distributed computation that should be of relevance to game theory. In particular, I focus on (a) representing knowledge and uncertainty, (b) dealing with failures, and (c) specification of mechanisms.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 45 (2003)
Issue (Month): 1 (October)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Other versions of this item:
- D80 - Microeconomics - - Information, Knowledge, and Uncertainty - - - General
- D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search, Learning, and Information
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.:
- Rubinstein, Ariel, 1989. "The Electronic Mail Game: Strategic Behavior under "Almost Common Knowledge."," American Economic Review, American Economic Association, vol. 79(3), pages 385-91, June.
- Monderer, Dov & Tennenholtz, Moshe, 1999. "Distributed Games," Games and Economic Behavior, Elsevier, vol. 28(1), pages 55-72, July.
- Halpern, Joseph Y., 1997. "On Ambiguities in the Interpretation of Game Trees," Games and Economic Behavior, Elsevier, vol. 20(1), pages 66-96, July.
- Eliaz, K., 1999.
"Fault Tolerant Implementation,"
21-99, Tel Aviv.
- Rubinstein, Ariel, 1995.
"On the Interpretation of Decision Problems with Imperfect Recall,"
Mathematical Social Sciences,
Elsevier, vol. 30(3), pages 324-324, December.
- Piccione, Michele & Rubinstein, Ariel, 1997. "On the Interpretation of Decision Problems with Imperfect Recall," Games and Economic Behavior, Elsevier, vol. 20(1), pages 3-24, July.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Rubinstein, Ariel, 1986.
"Finite automata play the repeated prisoner's dilemma,"
Journal of Economic Theory,
Elsevier, vol. 39(1), pages 83-96, June.
- Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
- Ronald Fagin & Joseph Y. Halpern & Yoram Moses & Moshe Y. Vardi, 2003. "Reasoning About Knowledge," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262562006, June.
- Martin Shubik, 2011.
"The Present and Future of Game Theory,"
Cowles Foundation Discussion Papers
1808, Cowles Foundation for Research in Economics, Yale University.
- Martin Shubik, 2012. "What is a Solution to a Matrix Game," Levine's Working Paper Archive 786969000000000541, David K. Levine.
- Gradwohl, Ronen & Reingold, Omer, 2010. "Partial exposure in large games," Games and Economic Behavior, Elsevier, vol. 68(2), pages 602-613, March.
- F. Forges & B. von Stengel, 2002. "Computionally Efficient Coordination in Games Trees," THEMA Working Papers 2002-05, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If references are entirely missing, you can add them using this form.