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.

[1]  Joseph Y. Halpern.  On Ambiguities in the Interpretation of Game Trees , 1996, TARK.

[2]  Moshe Tennenholtz,et al.  Mechanism design for resource bounded agents , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[3]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[4]  Nathan Linial,et al.  Games Computers Play: Game-Theoretic Aspects of Computing , 1992 .

[5]  Ariel Rubinstein,et al.  On the Interpretation of Decision Problems with Imperfect Recall , 1996, TARK.

[6]  Dov M. Gabbay,et al.  Handbook of logic in artificial intelligence and logic programming (vol. 1) , 1993 .

[7]  Stephan Merz,et al.  Model Checking , 2000 .

[8]  Ronald Fagin,et al.  A formal model of knowledge, action, and communication in distributed systems: preliminary report , 1985, PODC '85.

[9]  Ernst-Rüdiger Olderog,et al.  Verification of Sequential and Concurrent Programs , 1991, Texts and Monographs in Computer Science.

[10]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[11]  F. Poole,et al.  Distributed data bases , 1980 .

[12]  A. Rubinstein.  Finite automata play the repeated prisoner's dilemma , 1986 .

[13]  Ronen I. Brafman,et al.  Modeling Agents as Qualitative Decision Makers , 1997, Artif. Intell..

[14]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[15]  Özalp Babaoglu,et al.  On the reliability of consensus-based fault-tolerant distributed computing systems , 1987, TOCS.

[16]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[17]  N. Malcolm.  On Knowledge and Belief , 1954 .

[18]  Ronald Fagin,et al.  Modelling Knowledge and Action in Distributed Systems , 1988, Concurrency.

[19]  Joseph Y. Halpern,et al.  Reasoning about knowledge: a survey , 1995 .

[20]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[21]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[22]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[23]  Michael J. Fischer,et al.  The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) , 1983, FCT.

[24]  Danny Dolev,et al.  Requirements for Agreement in a Distributed System , 1982, DDB.

[25]  A. Rubinstein.  The Electronic Mail Game: Strategic Behavior Under "Almost Common Knowledge" , 1989 .

[26]  Igor Walukiewicz,et al.  Distributed Games , 2003, FSTTCS.

[27]  Yoram Moses,et al.  Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures , 1986, TARK.

[28]  Pierfrancesco La Mura.  Game Networks , 2000, UAI.

[29]  Ernst-Rüdiger Olderog,et al.  Verification of Sequential and Concurrent Programs , 1997, Graduate Texts in Computer Science.

[30]  K. Eliaz.  Fault Tolerant Implementation , 2002 .

[31]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[32]  Mark E. Deppe,et al.  Distributed Data Bases; A Summary of Research , 1976, Comput. Networks.

[33]  Cynthia Dwork,et al.  Randomization in Byzantine Agreement , 1989, Adv. Comput. Res..

[34]  Moshe Tennenholtz,et al.  Distributed Games: From Mechanisms to Protocols , 1999, AAAI/IAAI.

[35]  A. Neyman.  Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma , 1985 .

[36]  Michael O. Rabin,et al.  Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[37]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.