Beyond admissibility: dominance between chains of strategies
From MaRDI portal
Publication:5079732
Recommendations
Cites work
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 6862070 (Why is no real title available?)
- Admissibility in Infinite Games
- Admissible Strategies in Infinite Games over Graphs
- Admissiblity in concurrent games
- Assume-admissible synthesis
- Chain-complete posets and directed sets with applications
- Chess-like games may have no uniform Nash equilibria even in mixed strategies
- Equilibria in quantitative reachability games
- Extending finite-memory determinacy to multi-player games
- Fast growing functions based on Ramsey theorems
- From winning strategy to Nash equilibrium
- Nash equilibrium in generalised Muller games
- Non-zero sum games for reactive synthesis
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
- On high-quality synthesis
- On the minimal cofinal subsets of a directed quasi-ordered set
- Positional strategies for mean payoff games
- The complexity of admissibility in omega-regular games
- The computational complexity of iterated elimination of dominated strategies
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)