Payoffs, Intensionality and Abstraction in Games

We discuss some fundamental concepts in Game Theory: the concept of payoffs and the relation between rational solutions to games like Nash equilibrium and real world behaviour. We sketch some connections between Game Theory and Game Semantics by exploring some possible uses of Game Semantics strategies enriched with payoffs. Finally we discuss potential contributions of Abstract Interpretation to Game Theory in addressing the state explosion problem of game models of real world systems.

[1]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[2]  Dan R. Ghica.  Applications of Game Semantics: From Program Analysis to Hardware Synthesis , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[3]  Glynn Winskel,et al.  On Concurrent Games with Payoff , 2013, MFPS.

[4]  Krishnendu Chatterjee,et al.  Games for controls , 2006, 19th IEEE Computer Security Foundations Workshop (CSFW'06).

[5]  Samson Abramsky,et al.  Strictness analysis and polymorphic invariance , 1985, Programs as Data Objects.

[6]  Joseph Y. Halpern,et al.  Game theory with costly computation: formulation and application to protocol security , 2010, ICS.

[7]  Radha Jagadeesan,et al.  Game Semantics for Access Control , 2009, MFPS.

[8]  Chris Hankin,et al.  Non-deterministic games and program analysis: An application to security , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[9]  Chris Hankin,et al.  Measuring the confinement of probabilistic systems , 2005, Theor. Comput. Sci..

[10]  Thomas P. Jensen,et al.  Strictness Analysis in Logical Form , 1991, FPCA.

[11]  Dan R. Ghica,et al.  Slot games: a quantitative model of computation , 2005, POPL '05.

[12]  Chris Hankin,et al.  Abstract Interpretation of Declarative Languages , 1987 .

[13]  C.-H. Luke Ong,et al.  Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract) , 2006, CSL.

[14]  R. Rosenthal.  Games of perfect information, predatory pricing and the chain-store paradox , 1981 .

[15]  Chris Hankin,et al.  Strictness Analysis for Higher-Order Functions , 1986, Sci. Comput. Program..

[16]  Harald Ganzinger,et al.  Programs as Data Objects , 1986, Lecture Notes in Computer Science.

[17]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[18]  Tansu Alpcan,et al.  Network Security , 2010 .

[19]  Samson Abramsky,et al.  Abstract Interpretation, Logical Relations and Kan Extensions , 1990, J. Log. Comput..

[20]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[21]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..