On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
From MaRDI portal
Publication:4913770
DOI10.2168/LMCS-9(1:7)2013zbMath1260.91038OpenAlexW2025991831MaRDI QIDQ4913770
Hugo Gimbert, Véronique Bruyère, Julie De Pril, Thomas Brihaye
Publication date: 9 April 2013
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-9(1:7)2013
Related Items (6)
On refinements of subgame perfect \(\epsilon\)-equilibrium ⋮ Infinite-duration poorman-bidding games ⋮ Equilibria in multi-player multi-outcome infinite sequential games ⋮ A Note on Game Theory and Verification ⋮ Unnamed Item ⋮ Subgame perfection in recursive perfect information games
This page was built for publication: On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games