Sciweavers

119 search results - page 4 / 24
» The complexity of pure Nash equilibria
Sort
View
64
Voted
FOCS
2010
IEEE
14 years 7 months ago
Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction
Generalized Second Price Auction, also knows as Ad Word auctions, and its variants has been the main mechanism used by search companies to auction positions for sponsored search l...
Renato Paes Leme, Éva Tardos
91
Voted
AAAI
2007
14 years 11 months ago
The Impact of Network Topology on Pure Nash Equilibria in Graphical Games
Graphical games capture some of the key aspects relevant to the study and design of multi-agent systems. It is often of interest to find the conditions under which a game is stab...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
ATAL
2007
Springer
15 years 3 months ago
Constraint satisfaction algorithms for graphical games
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
Vishal Soni, Satinder P. Singh, Michael P. Wellman