Sciweavers

20 search results - page 2 / 4
» Large Supports are Required for Well-Supported Nash Equilibr...
Sort
View
CDC
2009
IEEE
133views Control Systems» more  CDC 2009»
13 years 10 months ago
New insights on generalized Nash games with shared constraints: Constrained and variational equilibria
— We consider generalized noncooperative Nash games with “shared constraints” in which there is a common constraint that players’ strategies are required to satisfy. We add...
Ankur A. Kulkarni, Uday V. Shanbhag
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
13 years 11 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 5 months ago
Correlated Equilibria in Continuous Games: Characterization and Computation
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
Noah D. Stein, Pablo A. Parrilo, Asuman E. Ozdagla...
SIGECOM
2005
ACM
117views ECommerce» more  SIGECOM 2005»
13 years 11 months ago
First-price path auctions
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
Nicole Immorlica, David R. Karger, Evdokia Nikolov...
AAAI
2006
13 years 6 months ago
Algorithms for Rationalizability and CURB Sets
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
Michael Benisch, George B. Davis, Tuomas Sandholm