Skip to main content
Conference Proceedings

Equilibria in quantitative reachability games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6072 LNCS 72-83
DOI: 10.1007/978-3-642-13182-0_7
15Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In this framework each player aims at reaching his own goal as soon as possible. We prove existence of finite-memory Nash (resp. secure) equilibria in multiplayer (resp. two-player) games. © 2010 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Brihaye, T., Bruyère, V., & De Pril, J. (2010). Equilibria in quantitative reachability games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6072 LNCS, pp. 72–83). https://doi.org/10.1007/978-3-642-13182-0_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free