9 search results - page 1 / 2 » Equilibria in Quantitative Reachability Games |
CSR
2010
Springer
13 years 9 months ago
2010
Springer
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...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
We propose a simple yet rich model to extend the notions of Nash equilibria and correlated equilibria of strategic games to the quantum setting, in which we then study the relatio...
CONCUR
2010
Springer
13 years 5 months ago
2010
Springer
STOC
2001
ACM
14 years 4 months ago
2001
ACM
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...