Sciweavers

594 search results - page 15 / 119
» Games with Secure Equilibria
Sort
View
ICALP
2011
Springer
12 years 11 months ago
Restoring Pure Equilibria to Weighted Congestion Games
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
Konstantinos Kollias, Tim Roughgarden
TARK
2007
Springer
14 years 1 months ago
Robust equilibria under non-common priors
This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogenous priors. An equilibrium of a complete ...
Daisuke Oyama, Olivier Tercieux
TCS
2008
13 years 7 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
CORR
2008
Springer
102views Education» more  CORR 2008»
13 years 7 months ago
Game Theory with Costly Computation
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
Joseph Y. Halpern, Rafael Pass
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