Memory requirements in non-zero-sum games
From MaRDI portal
Cites work
- Algorithms, games, and the internet
- An Antichain Algorithm for LTL Realizability
- Arena-independent memory bounds for Nash equilibria in reachability games
- As soon as possible but rationally
- Borel determinacy
- Bounded Synthesis
- Equilibrium points in n -person games
- Games with trading of control
- Graph Games and Reactive Synthesis
- How to play optimally for regular objectives?
- scientific article; zbMATH DE number 3139273 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 3084669 (Why is no real title available?)
- scientific article; zbMATH DE number 7830368 (Why is no real title available?)
- Modalities for model checking: Branching time logic strikes back
- On Nash equilibria in stochastic games
- On the synthesis of strategies in infinite games
- Positional-player games
- Rational synthesis
- Reachability games and friends: a journey through the Lens of memory and complexity (invited talk)
- Robust equilibria in mean-payoff games
- Synthesis with rational environments
- Temporal synthesis for bounded systems and environments
- The Complexity of Nash Equilibria in Infinite Multiplayer Games
- The complexity of rational synthesis
- The non-cooperative rational synthesis problem for SPEs and -regular objectives
- The price of stability for network design with fair cost allocation
- Worst-case equilibria
This page was built for publication: Memory requirements in non-zero-sum games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445689)