Equilibria in quantitative reachability games
From MaRDI portal
(Redirected from Publication:3569732)
Recommendations
Cited in
(22)- Reachability is decidable in the numbers game
- Extending finite-memory determinacy to multi-player games
- On equilibria in quantitative games with reachability/safety objectives
- A note on the Nash equilibria of some multi-player reachability/safety games
- Computing branching distances with quantitative games
- Equilibria in multi-player multi-outcome infinite sequential games
- Robust equilibria in mean-payoff games
- Subgame perfection for equilibria in quantitative reachability games
- Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
- Quantitative games with interval objectives
- Reachability games for linear hybrid systems
- Measuring Permissivity in Finite Games
- An existence theorem of Nash equilibrium in Coq and Isabelle
- Multiplayer cost games with simple Nash equilibria
- Nash equilibria for reachability objectives in multi-player timed games
- Computing equilibria in two-player timed games via turn-based finite games
- Incentive Stackelberg mean-payoff games
- On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
- Beyond admissibility: dominance between chains of strategies
- Alternating Reachability Games with Behavioral and Revenue Objectives
- scientific article; zbMATH DE number 6767615 (Why is no real title available?)
- Equilibria for games with combined qualitative and quantitative objectives
This page was built for publication: Equilibria in quantitative reachability games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569732)