Borel determinacy of concurrent games
Just as traditional games can be represented by trees, so concurrent games can be represented by event structures. We show the determinacy of such concurrent games with Borel sets of configurations as winning conditions, provided they are race-free and bounded-concurrent. Both properties are shown n...
Main Authors: | Gutierrez, J, Winskel, G |
---|---|
Format: | Conference item |
Published: |
Springer, Berlin, Heidelberg
2013
|
Similar Items
-
On the determinacy of concurrent games on event structures with infinite winning sets
by: Gutierrez, J, et al.
Published: (2014) -
The winning ways of concurrent games
by: Clairambault, P, et al.
Published: (2012) -
Imperfect information in logic and concurrent games
by: Clairambault, P, et al.
Published: (2013) -
On strong determinacy of countable stochastic games
by: Kiefer, S, et al.
Published: (2017) -
Pétrus Borel
by: Bovee, E
Published: (1999)