A Computer Scientist Looks at Game Theory
I 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.
|Date of creation:||05 Nov 2004|
|Note:||Type of Document - ps; pages: 21. In Games and Economic Behavior 45:1, 2003, pp. 114-132|
|Contact details of provider:|| Web page: http://econwpa.repec.org|
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-391, June.
- Ariel Rubinstein, 1997.
"Finite automata play the repeated prisioners dilemma,"
Levine's Working Paper Archive
1639, David K. Levine.
- Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
- 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," Papers 21-99, Tel Aviv.
- Monderer, Dov & Tennenholtz, Moshe, 1999. "Distributed Games," Games and Economic Behavior, Elsevier, vol. 28(1), pages 55-72, July.
- 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.
- Rubinstein, Ariel, 1995. "On the Interpretation of Decision Problems with Imperfect Recall," Mathematical Social Sciences, Elsevier, vol. 30(3), pages 324-324, December.
- 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.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpga:0411002. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA)
If references are entirely missing, you can add them using this form.