Beyond admissibility: dominance between chains of strategies
From MaRDI portal
Publication:5079732
DOI10.4230/LIPICS.CSL.2018.10MaRDI QIDQ5079732FDOQ5079732
Authors: Nicolas Basset, Ismaël Jecker, Arno Pauly, Bogaard Marie van Den, Jean-François Raskin 
Publication date: 28 May 2022
Full work available at URL: https://arxiv.org/abs/1805.11608
Recommendations
dominated strategiesorder theoryreactive synthesissafety gamesadmissible strategiescofinalgames played on finite graphsreachability games
Cites Work
- Chain-complete posets and directed sets with applications
- Positional strategies for mean payoff games
- The computational complexity of iterated elimination of dominated strategies
- Title not available (Why is that?)
- 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
- Admissible Strategies in Infinite Games over Graphs
- Admissibility in Infinite Games
- The complexity of admissibility in omega-regular games
- Assume-admissible synthesis
- On the minimal cofinal subsets of a directed quasi-ordered set
- Fast growing functions based on Ramsey theorems
- Nash equilibrium in generalised Muller games
- Equilibria in quantitative reachability games
- Extending finite-memory determinacy to multi-player games
- On high-quality synthesis
- Non-zero sum games for reactive synthesis
- Title not available (Why is that?)
- Admissiblity in concurrent games
- From winning strategy to Nash equilibrium
Cited In (1)
This page was built for publication: Beyond admissibility: dominance between chains of strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079732)
