Payoffs, Intensionality and Abstraction in Games

DOI10.1007/978-3-642-38164-5_6zbMath1264.91034OpenAlexW110688484MaRDI QIDQ4922074

Pasquale Malacaria, Chris Hankin

Publication date: 28 May 2013

Published in: Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38164-5_6

Mathematics Subject Classification ID

Applications of game theory (91A80) Other game-theoretic models (91A40) Rationality and learning in game theory (91A26) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

The regular-language semantics of second-order idealized ALGOL ⋮ Game Semantics for Access Control ⋮ Definability and Full Abstraction

Cites Work

• Unnamed Item
• Unnamed Item
• On concurrent games with payoff
• Measuring the confinement of probabilistic systems
• Strictness analysis for higher-order functions
• Games of perfect information, predatory pricing and the chain-store paradox
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Game Semantics for Access Control
• Abstract Interpretation, Logical Relations, and Kan Extensions
• Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract)
• Slot games

This page was built for publication: Payoffs, Intensionality and Abstraction in Games