On relevant equilibria in reachability games

DOI10.1007/978-3-030-30806-3_5zbMath1455.91055arXiv1907.05481OpenAlexW2972087055MaRDI QIDQ5919688

Thomas Brihaye, Véronique Bruyère, Nathan Thomasset, Aline Goeminne

Publication date: 22 October 2019

Published in: Journal of Computer and System Sciences, Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Pareto optimalitysocial welfarereachability objectivesmultiplayer non-zero-sum games played on graphsrelevant equilibria

Mathematics Subject Classification ID

Games involving graphs (91A43) Welfare economics (91B15) Algorithmic game theory and complexity (91A68) Equilibrium refinements (91A11)

Related Items (3)

On relevant equilibria in reachability games ⋮ Unnamed Item ⋮ A game-theoretic approach for the synthesis of complex systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
• On short paths interdiction problems: Total and node-wise limited interdiction
• Pareto curves of multidimensional mean-payoff games
• Automata, logics, and infinite games. A guide to current research
• Computer aided synthesis: a game-theoretic approach
• Subgame Perfection for Equilibria in Quantitative Reachability Games
• Mixed Nash Equilibria in Concurrent Terminal-Reward Games
• On the Existence of Weak Subgame Perfect Equilibria
• Multiplayer Cost Games with Simple Nash Equilibria
• The Complexity of Rational Synthesis
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• Equilibrium points in n -person games
• On relevant equilibria in reachability games

This page was built for publication: On relevant equilibria in reachability games