On concurrent games with payoff

DOI10.1016/J.ENTCS.2013.09.008zbMath1334.68148OpenAlexW2008634862WikidataQ113317968 ScholiaQ113317968MaRDI QIDQ265795

Pierre Clairambault, Glynn Winskel

Publication date: 12 April 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2013.09.008

zbMATH Keywords

determinacygame semanticsconcurrent games

Mathematics Subject Classification ID

2-person games (91A05) Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Strategies as concurrent processes ⋮ Payoffs, Intensionality and Abstraction in Games ⋮ Distributed Strategies Made Easy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed probabilistic and quantum strategies
• A survey of stochastic \(\omega \)-regular games
• Borel determinacy
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• The Winning Ways of Concurrent Games
• Alternating-time temporal logic
• Asynchronous Games: Innocence Without Alternation
• The determinacy of Blackwell games
• Probabilistic and Quantum Event Structures

This page was built for publication: On concurrent games with payoff