Sciweavers

374 search results - page 16 / 75
» Generalized Nash equilibrium problems
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
SAGT
2010
Springer
156views Game Theory» more  SAGT 2010»
13 years 6 months ago
Partition Equilibrium Always Exists in Resource Selection Games
Abstract. We consider the existence of Partition Equilibrium in Resource Selection Games. Super-strong equilibrium, where no subset of players has an incentive to change their stra...
Elliot Anshelevich, Bugra Caskurlu, Ameya Hate
SPAA
2006
ACM
14 years 1 months ago
Network design with weighted players
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
Ho-Lin Chen, Tim Roughgarden
MOR
2010
108views more  MOR 2010»
13 years 6 months ago
Accuracy Certificates for Computational Problems with Convex Structure
The goal of the current paper is to introduce the notion of certificates which verify the accuracy of solutions of computational problems with convex structure; such problems inc...
Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...