Abstract
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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abramsky, S., Hankin, C. (eds.): Abstract Interpretation of Declarative Languages. Ellis Horwood (1987)
Abramsky, S.: Strictness analysis and polymorphic invariance. In: Ganzinger, H., Jones, N.D. (eds.) Programs as Data Objects. LNCS, vol. 217, pp. 1–23. Springer, Heidelberg (1986)
Abramsky, S.: Abstract Interpretation, Logical Relations and Kan Extensions. J. Log. Comput. 1(1), 5–40 (1990)
Abramsky, S., Jagadeesan, R.: Game Semantics for Access Control. Electr. Notes Theor. Comput. Sci. 249, 135–156 (2009)
Abramsky, S., Jagadeesan, R., Malacaria, P.: Full Abstraction for PCF. Inf. and Comput. 163(2), 409–470 (2000)
Alpcan, T., Basar, T.: Network Security: A Decision and Game Theoretic Approach. Cambridge University Press (2011)
Burn, G.L., Hankin, C., Abramsky, S.: Strictness Analysis for Higher-Order Functions. Sci. Comput. Program. 7(3), 249–278 (1986)
Chatterjee, K., Jagadeesan, R., Pitcher, C.: Games for Controls. In: CSFW 2006, pp. 70–84 (2006)
Clairambault, P., Winskel, G.: On concurrent games with payoff, http://www.cl.cam.ac.uk/~cdt25/ecsym/Publications/
Di Pierro, A., Hankin, C., Wiklicky, H.: Measuring the confinement of probabilistic systems. Theor. Comput. Sci. 340(1), 3–56 (2005)
Ghica, D.R.: Slot games: a quantitative model of computation. In: Proc. POPL 2005, pp. 85–97 (2005)
Ghica, D.R.: Applications of Game Semantics: From Program Analysis to Hardware Synthesis. In: LICS 2009, pp. 17–26. IEEE Computer Society (2009)
Hyland, M., Ong, L.: On Full Abstraction for PCF: I, II, and III. Inf. and Comput. 163(2), 285–408 (2000)
Jensen, T.P.: Strictness Analysis in Logical Form. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol. 523, pp. 352–366. Springer, Heidelberg (1991)
Malacaria, P., Hankin, C.: Non-Deterministic Games and Program Analysis: An Application to Security. In: LICS 1999, pp. 443–452. IEEE Computer Society (1999)
Ong, C.-H.L.: Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract). In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 31–40. Springer, Heidelberg (2006)
Pass, R., Halpern, J.: Game theory with costly computation: formulation and application to protocol security. In: Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions. ACM (2010)
Rosenthal, R.: Games of Perfect Information, Predatory Pricing, and the Chain Store. Journal of Economic Theory 25(1), 92–100 (1981), doi:10.1016/0022-0531(81)90018-1
von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hankin, C., Malacaria, P. (2013). Payoffs, Intensionality and Abstraction in Games. In: Coecke, B., Ong, L., Panangaden, P. (eds) Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky. Lecture Notes in Computer Science, vol 7860. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38164-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-38164-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38163-8
Online ISBN: 978-3-642-38164-5
eBook Packages: Computer ScienceComputer Science (R0)