Sciweavers

1616 search results - page 52 / 324
» Robust game theory
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Intrinsic robustness of the price of anarchy
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...
Tim Roughgarden
FSTTCS
2008
Springer
13 years 8 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
TCS
2010
13 years 6 months ago
Invariant games
In the context of 2-player removal games, we define the notion of invariant game for which each allowed move is independent of the position it is played from. We present a family ...
Éric Duchêne, Michel Rigo
CORR
2011
Springer
153views Education» more  CORR 2011»
13 years 2 months ago
Stability Analysis of Transportation Networks with Multiscale Driver Decisions
Stability of Wardrop equilibria is analyzed for dynamical transportation networks in which the drivers’ route choices are influenced by information at multiple temporal and spat...
Giacomo Como, Ketan Savla, Daron Acemoglu, Munther...
SOUPS
2009
ACM
14 years 2 months ago
Games for extracting randomness
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
Ran Halprin, Moni Naor