Sciweavers

29 search results - page 5 / 6
» sigecom 2006
Sort
View
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
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
13 years 11 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
13 years 11 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
13 years 11 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
13 years 11 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm