Sciweavers

3504 search results - page 7 / 701
» Computational Aspects of Equilibria
Sort
View
77
Voted
NIPS
2007
15 years 1 months ago
Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria
We study the relation between notions of game-theoretic equilibria which are based on stability under a set of deviations, and empirical equilibria which are reached by rational p...
Elad Hazan, Satyen Kale
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 1 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
88
Voted
ICALP
2009
Springer
15 years 12 months ago
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
Michael Ummels, Dominik Wojtczak
CDC
2008
IEEE
111views Control Systems» more  CDC 2008»
15 years 6 months ago
Computing correlated equilibria of polynomial games via adaptive discretization
— We construct a family of iterative discretization algorithms for computing sequences of finitely-supported correlated equilibria of n-player games with polynomial utility func...
Noah D. Stein, Asuman E. Ozdaglar, Pablo A. Parril...
CG
2006
Springer
15 years 3 months ago
Computing Proper Equilibria of Zero-Sum Games
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
Peter Bro Miltersen, Troels Bjerre Sørensen