Concurrent games and semi-random determinacy
From MaRDI portal
Recommendations
Cites work
- Average-energy games
- Borel determinacy
- Bounded fairness
- CONCUR 2005 – Concurrency Theory
- Concurrent games with tail objectives
- Energy parity games
- Extending finite-memory determinacy to multi-player games
- Finitary winning in \({\omega}\)-regular games
- From winning strategy to Nash equilibrium
- Half-Positional Determinacy of Infinite Games
- scientific article; zbMATH DE number 6862142 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- Infinite sequential games with real-valued payoffs
- Infinite sequential Nash equilibrium
- Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy
- Looking at mean-payoff and total-payoff through windows
- On the positional determinacy of edge-labeled games
- On the reachability problem for 5-dimensional vector addition systems
- Parallel program schemata
- Solving simple stochastic tail games
- The determinacy of Blackwell games
- Window parity games: an alternative approach toward parity games with time bounds
Cited in
(19)- When does a random Robin Hood win?
- Time-aware uniformization of winning strategies
- Dicing on the Streett
- On the determinacy of concurrent games on event structures with infinite winning sets
- A Mathematical Game Semantics of Concurrency and Nondeterminism
- Borel determinacy of concurrent games
- Fair adversaries and randomization in two-player games
- Derandomized parallel repetition theorems for free games
- scientific article; zbMATH DE number 1948169 (Why is no real title available?)
- Sequentiality vs. concurrency in games and logic
- On the complexity of branching games with regular conditions
- scientific article; zbMATH DE number 7559480 (Why is no real title available?)
- Admissiblity in concurrent games
- Quantitative fairness games
- scientific article; zbMATH DE number 7327943 (Why is no real title available?)
- Determinacy in discrete-bidding infinite-duration games
- Recursive Concurrent Stochastic Games
- Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies
- Randomness for free
This page was built for publication: Concurrent games and semi-random determinacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005142)
