Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-13182-0_7 | CSR |
Keywords | Field | DocType |
reachability objective,finite-memory nash,multiplayer non zero-sum game,quantitative reachability game,finite graph,own goal,zero sum game,game theory,reactive system,software complexity,finite state automaton,automata theory,embedded system,nash equilibrium,model checking,distributed system | Graph,Computer science,Implementation theory,Best response,Theoretical computer science,Reachability,Repeated game,Equilibrium selection,Normal-form game,Nash equilibrium | Conference |
Volume | ISSN | ISBN |
6072 | 0302-9743 | 3-642-13181-6 |
Citations | PageRank | References |
10 | 0.66 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Brihaye | 1 | 460 | 35.91 |
| Véronique Bruyère | 2 | 429 | 43.59 |
| Julie De Pril | 3 | 29 | 2.95 |