Introduction to higher order categorical logic
Introduction to higher order categorical logic
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Alternating-time temporal logic
Journal of the ACM (JACM)
Petri Nets, Event Structures and Domains
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part II
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Concurrent Omega-Regular Games
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
The Winning Ways of Concurrent Games
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Asynchronous games: innocence without alternation
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Distributed Probabilistic and Quantum Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The paper considers an extension of concurrent games with a payoff, i.e. a numerical value resulting from the interaction of two players. We extend a recent determinacy result on concurrent games [Pierre Clairambault, Julian Gutierrez, and Glynn Winskel. The winning ways of concurrent games. In LICS. IEEE Computer Society, 2012] to a value theorem, i.e. a value that both players can get arbitrarily close to, whatever the behaviour of their opponent. This value is not reached in general, i.e. there is not always an optimal strategy for one of the players (there is for finite games). However when they exist, we show that optimal strategies are closed under composition, which opens up the possibility of computing optimal strategies for complex games compositionally from optimal strategies for their component games.