142 search results - page 14 / 29 » Computing Nash Equilibria: Approximation and Smoothed Comple... |
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
JGO
2008
13 years 7 months ago
2008
Abstract In this paper we present an evolutionary variational inequality model of vaccination strategies games in a population with a known vaccine coverage profile over a certain ...
SIAMJO
2008
13 years 7 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
AAAI
2006
13 years 9 months ago
2006
We embark on an initial study of a new class of strategic (normal-form) games, so-called ranking games, in which the payoff to each agent solely depends on his position in a ranki...
AAAI
2007
13 years 9 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...