scientific article; zbMATH DE number 7533335
From MaRDI portal
Publication:5079732
DOI10.4230/LIPIcs.CSL.2018.10MaRDI QIDQ5079732
Nicolas Basset, Arno Pauly, Ismaël Jecker, Bogaard Marie van Den, Jean-François Raskin
Publication date: 28 May 2022
Full work available at URL: https://arxiv.org/abs/1805.11608
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dominated strategiesorder theoryreactive synthesissafety gamesadmissible strategiescofinalgames played on finite graphsreachability games
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The computational complexity of iterated elimination of dominated strategies
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
- Chess-like games may have no uniform Nash equilibria even in mixed strategies
- Assume-admissible synthesis
- On the minimal cofinal subsets of a directed quasi-ordered set
- Positional strategies for mean payoff games
- Fast growing functions based on Ramsey theorems
- Chain-complete posets and directed sets with applications
- Extending finite-memory determinacy to multi-player games
- Non-Zero Sum Games for Reactive Synthesis
- Nash Equilibrium in Generalised Muller Games.
- From winning strategy to Nash equilibrium
- Admissible Strategies in Infinite Games over Graphs
- Equilibria in Quantitative Reachability Games
- Admissibility in Infinite Games
- The complexity of admissibility in Omega-regular games
- Admissiblity in Concurrent Games
- On High-Quality Synthesis
This page was built for publication:
