On equilibria in quantitative games with reachability/safety objectives
From MaRDI portal
Publication:1678747
DOI10.1007/S00224-013-9495-7zbMATH Open1380.91031arXiv1205.4889OpenAlexW2046745013MaRDI QIDQ1678747FDOQ1678747
Authors: Thomas Brihaye, Véronique Bruyère, Julie De Pril 
Publication date: 7 November 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Abstract: In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with both reachability and safety objectives. In this framework a player with a reachability objective aims at reaching his own goal as soon as possible, whereas a player with a safety objective aims at avoiding his bad set or, if impossible, delaying its visit as long as possible. We prove the existence of Nash equilibria with finite memory in quantitative multiplayer reachability/safety games. Moreover, we prove the existence of finite-memory secure equilibria for quantitative two-player reachability games.
Full work available at URL: https://arxiv.org/abs/1205.4889
Recommendations
- Equilibria in quantitative reachability games
- On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
- A note on the Nash equilibria of some multi-player reachability/safety games
- On relevant equilibria in reachability games
- On relevant equilibria in reachability games
- Stochastic games with lexicographic reachability-safety objectives
- scientific article; zbMATH DE number 6767615
- Subgame perfection for equilibria in quantitative reachability games
- Equilibria for games with combined qualitative and quantitative objectives
- On equilibrium existence in payoff secure games
Cites Work
- Equilibrium points in n -person games
- Title not available (Why is that?)
- Borel determinacy
- A course in game theory.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata, logics, and infinite games. A guide to current research
- Better Quality in Synthesis through Quantitative Objectives
- Computer Science Logic
- On the synthesis of strategies in infinite games
- Subgame perfection for equilibria in quantitative reachability games
- Games with secure equilibria
- Optimal strategy synthesis for request-response games
- Time-Optimal Winning Strategies for Poset Games
- Tools and Algorithms for the Construction and Analysis of Systems
- Equilibria in quantitative reachability games
- Title not available (Why is that?)
- Ranking Automata and Games for Prioritized Requirements
Cited In (12)
- Title not available (Why is that?)
- A dynamic game approach to distributionally robust safety specifications for stochastic systems
- Title not available (Why is that?)
- On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
- Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
- Formal Methods for Components and Objects
- Quantitative games with interval objectives
- Reasoning about Quality and Fuzziness of Strategic Behaviors
- Equilibria in quantitative reachability games
- Games with secure equilibria
- Reachability and safety objectives in Markov decision processes on long but finite horizons
- Alternating Reachability Games with Behavioral and Revenue Objectives
This page was built for publication: On equilibria in quantitative games with reachability/safety objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1678747)
