Subgame Perfection for Equilibria in Quantitative Reachability Games
From MaRDI portal
Publication:2892777
DOI10.1007/978-3-642-28729-9_19zbMath1352.68146arXiv1205.6346OpenAlexW2152931948MaRDI QIDQ2892777
Hugo Gimbert, Julie De Pril, Véronique Bruyère, Thomas Brihaye
Publication date: 22 June 2012
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.6346
Games involving graphs (91A43) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (16)
An abstraction-refinement methodology for reasoning about network games ⋮ Network-formation games with regular objectives ⋮ On equilibria in quantitative games with reachability/safety objectives ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hierarchical Network Formation Games ⋮ Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives ⋮ Dynamic resource allocation games ⋮ Unnamed Item ⋮ On relevant equilibria in reachability games ⋮ Unnamed Item ⋮ Infinite-Duration Bidding Games ⋮ Timed network games
This page was built for publication: Subgame Perfection for Equilibria in Quantitative Reachability Games