Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CSR
2010
Springer

favoriteEmaildiscussreport

128views Theoretical Computer Science» more CSR 2010»

Equilibria in Quantitative Reachability Games

13 years 9 months ago

Equilibria in Quantitative Reachability Games

Download www.ulb.ac.be

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

Thomas Brihaye, Véronique Bruyère, J

Real-time Traffic

CSR 2010 | Non Zero-sum Games | Reachability Objectives | Theoretical Computer Science | Turn-based Quantitative Multiplayer |

claim paper

Related Content

» Quantum Strategic Game Theory

» Nash Equilibria for Reachability Objectives in Multiplayer Timed Games

» Quantitative solution of omegaregular games

» Intrinsic robustness of the price of anarchy

» Strategy Improvement for Concurrent Reachability Games

» Equilibria in topology control games for ad hoc networks

» Measuring Permissivity in Finite Games

» Game Relations and Metrics

Post Info
More Details (n/a)

Added	19 Jul 2010
Updated	19 Jul 2010
Type	Conference
Year	2010
Where	CSR
Authors	Thomas Brihaye, Véronique Bruyère, Julie De Pril

Comments (0)