Equilibria in Quantitative Reachability Games

DOI10.1007/978-3-642-13182-0_7zbMath1285.91023OpenAlexW149674103MaRDI QIDQ3569732

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

Publication date: 22 June 2010

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13182-0_7

zbMATH Keywords

Nash equilibriumsecure equilibriumturn-based quantitative game

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (8)

Multiplayer Cost Games with Simple Nash Equilibria ⋮ Extending finite-memory determinacy to multi-player games ⋮ Incentive Stackelberg Mean-Payoff Games ⋮ On equilibria in quantitative games with reachability/safety objectives ⋮ Unnamed Item ⋮ Equilibria in multi-player multi-outcome infinite sequential games ⋮ Unnamed Item ⋮ Robust Equilibria in Mean-Payoff Games

This page was built for publication: Equilibria in Quantitative Reachability Games