An approach to innocent strategies as graphs
Information and Computation
Bicategories of concurrent games
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Winning, losing and drawing in concurrent games with perfect or imperfect information
Logic and Program Semantics
The Winning Ways of Concurrent Games
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Borel determinacy of concurrent games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
On Concurrent Games with Payoff
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed Probabilistic and Quantum Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
A bi category of very general nondeterministic concurrent games and strategies is presented. The intention is to formalize distributed games in which both Player (or a team of players) and Opponent (or a team of opponents) can interact in highly distributed fashion, without, for instance, enforcing that their moves alternate.