On equilibria in quantitative games with reachability/safety objectives
From MaRDI portal
Publication:1678747
DOI10.1007/S00224-013-9495-7zbMATH Open1380.91031OpenAlexW2046745013MaRDI 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
- 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
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 910719 (Why is no real title available?)
- scientific article; zbMATH DE number 3078991 (Why is no real title available?)
- A course in game theory.
- Automata, logics, and infinite games. A guide to current research
- Better Quality in Synthesis through Quantitative Objectives
- Borel determinacy
- Computer Science Logic
- Equilibria in quantitative reachability games
- Equilibrium points in n -person games
- Games with secure equilibria
- On the synthesis of strategies in infinite games
- Ranking Automata and Games for Prioritized Requirements
- Solution concepts and algorithms for infinite multiplayer games
- Subgame perfection for equilibria in quantitative reachability games
- Time-Optimal Winning Strategies for Poset Games
- Tools and Algorithms for the Construction and Analysis of Systems
Cited In (15)
- Equilibria for games with combined qualitative and quantitative objectives
- Title not available (Why is no real title available?)
- A dynamic game approach to distributionally robust safety specifications for stochastic systems
- Title not available (Why is no real title available?)
- 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
- A note on the Nash equilibria of some multi-player reachability/safety games
- Equilibria in quantitative reachability games
- Games with secure equilibria
- Secure equilibria in weighted games
- 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)
