234 search results - page 18 / 47 » A polynomial-time nash equilibrium algorithm for repeated ga... |
JACM
2007
14 years 9 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
102
click to vote
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
102
click to vote
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
JUCS
2008
14 years 9 months ago
2008
: We present a distributed learning algorithm for optimizing transit prices in the inter-domain routing framework. We present a combined game theoretical and distributed algorithmi...
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
A satisfactory multiagent learning algorithm should, at a minimum, learn to play optimally against stationary opponents and converge to a Nash equilibrium in self-play. The algori...