Sciweavers

13 search results - page 1 / 3
» Searching for approximate equilibria in empirical games
Sort
View
ATAL
2008
Springer
13 years 11 months ago
Searching for approximate equilibria in empirical games
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
Patrick R. Jordan, Yevgeniy Vorobeychik, Michael P...
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 4 months ago
Equilibria of Dynamic Games with Many Players: Existence, Approximation, and Market Structure
In this paper we study stochastic dynamic games with many players that are relevant for a wide range of social, economic, and engineering applications. The standard solution conce...
Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintrau...
IJCAI
2007
13 years 11 months ago
Iterated Weaker-than-Weak Dominance
We introduce a weakening of standard gametheoretic dominance conditions, called δdominance, which enables more aggressive pruning of candidate strategies at the cost of solution ...
Shih-Fen Cheng, Michael P. Wellman
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 10 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
ATAL
2008
Springer
13 years 11 months ago
Stochastic search methods for nash equilibrium approximation in simulation-based games
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
Yevgeniy Vorobeychik, Michael P. Wellman