On equilibria in quantitative games with reachability/safety objectives

DOI10.1007/s00224-013-9495-7zbMath1380.91031arXiv1205.4889OpenAlexW2046745013MaRDI QIDQ1678747

Julie De Pril, Véronique Bruyère, Thomas Brihaye

Publication date: 7 November 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.4889

zbMATH Keywords

Nash equilibriumreachability/safety objectivessecure equilibriumturn-based quantitative game

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items

Reachability and safety objectives in Markov decision processes on long but finite horizons, Reasoning about Quality and Fuzziness of Strategic Behaviors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Games with secure equilibria
• Borel determinacy
• Automata, logics, and infinite games. A guide to current research
• Subgame Perfection for Equilibria in Quantitative Reachability Games
• Optimal strategy synthesis for request-response games
• Ranking Automata and Games for Prioritized Requirements
• Equilibria in Quantitative Reachability Games
• Better Quality in Synthesis through Quantitative Objectives
• Time-Optimal Winning Strategies for Poset Games
• On the synthesis of strategies in infinite games
• Computer Science Logic
• Equilibrium points in n -person games
• Tools and Algorithms for the Construction and Analysis of Systems