Equilibria in quantitative reachability games
From MaRDI portal
Publication:3569732
DOI10.1007/978-3-642-13182-0_7zbMATH Open1285.91023OpenAlexW149674103MaRDI QIDQ3569732FDOQ3569732
Julie De Pril, Véronique Bruyère, Thomas Brihaye
Publication date: 22 June 2010
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13182-0_7
Recommendations
- On equilibria in quantitative games with reachability/safety objectives
- On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
- Subgame perfection for equilibria in quantitative reachability games
- A note on the Nash equilibria of some multi-player reachability/safety games
- On relevant equilibria in reachability games
Cited In (16)
- Reachability games for linear hybrid systems
- Incentive Stackelberg Mean-Payoff Games
- Equilibria in multi-player multi-outcome infinite sequential games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extending finite-memory determinacy to multi-player games
- On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
- Robust Equilibria in Mean-Payoff Games
- Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
- Multiplayer Cost Games with Simple Nash Equilibria
- Computing branching distances with quantitative games
- Quantitative games with interval objectives
- On equilibria in quantitative games with reachability/safety objectives
- Reachability is decidable in the numbers game
- Title not available (Why is that?)
- Alternating Reachability Games with Behavioral and Revenue 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)
