Skip to main content
SpringerLink
Log in

Payoffs, Intensionality and Abstraction in Games

  • Chapter
Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7860))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S., Hankin, C. (eds.): Abstract Interpretation of Declarative Languages. Ellis Horwood (1987)

    Google Scholar 

  2. 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)

    Chapter  Google Scholar 

  3. Abramsky, S.: Abstract Interpretation, Logical Relations and Kan Extensions. J. Log. Comput. 1(1), 5–40 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  4. Abramsky, S., Jagadeesan, R.: Game Semantics for Access Control. Electr. Notes Theor. Comput. Sci. 249, 135–156 (2009)

    Article  MATH  Google Scholar 

  5. Abramsky, S., Jagadeesan, R., Malacaria, P.: Full Abstraction for PCF. Inf. and Comput. 163(2), 409–470 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Alpcan, T., Basar, T.: Network Security: A Decision and Game Theoretic Approach. Cambridge University Press (2011)

    Google Scholar 

  7. Burn, G.L., Hankin, C., Abramsky, S.: Strictness Analysis for Higher-Order Functions. Sci. Comput. Program. 7(3), 249–278 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chatterjee, K., Jagadeesan, R., Pitcher, C.: Games for Controls. In: CSFW 2006, pp. 70–84 (2006)

    Google Scholar 

  9. Clairambault, P., Winskel, G.: On concurrent games with payoff, http://www.cl.cam.ac.uk/~cdt25/ecsym/Publications/

  10. Di Pierro, A., Hankin, C., Wiklicky, H.: Measuring the confinement of probabilistic systems. Theor. Comput. Sci. 340(1), 3–56 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ghica, D.R.: Slot games: a quantitative model of computation. In: Proc. POPL 2005, pp. 85–97 (2005)

    Google Scholar 

  12. Ghica, D.R.: Applications of Game Semantics: From Program Analysis to Hardware Synthesis. In: LICS 2009, pp. 17–26. IEEE Computer Society (2009)

    Google Scholar 

  13. Hyland, M., Ong, L.: On Full Abstraction for PCF: I, II, and III. Inf. and Comput. 163(2), 285–408 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Jensen, T.P.: Strictness Analysis in Logical Form. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol. 523, pp. 352–366. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  15. Malacaria, P., Hankin, C.: Non-Deterministic Games and Program Analysis: An Application to Security. In: LICS 1999, pp. 443–452. IEEE Computer Society (1999)

    Google Scholar 

  16. 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)

    Chapter  Google Scholar 

  17. 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)

    Google Scholar 

  18. 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

    Article  MathSciNet  MATH  Google Scholar 

  19. von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Security Science and Technology, Imperial College London, UK

    Chris Hankin

  2. School of Electrical Engineering and Computer Science, Queen Mary University of London, UK

    Pasquale Malacaria

Authors
  1. Chris Hankin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pasquale Malacaria
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Oxford, Parks Road, Wolfson Building, OX1 3QD, Oxford, UK

    Bob Coecke  & Luke Ong  & 

  2. Department of Computer Science, McGill University, 3480 Rue University, H3A 0E9, Montréal, QC, Canada

    Prakash Panangaden

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation