2464 search results - page 2 / 493 » Efficient learning equilibrium |
ICML
2001
IEEE
14 years 6 months ago
2001
IEEE
ICMLA
2008
13 years 6 months ago
2008
This paper treats the problem of distributed planning in general-sum stochastic games with communication when the model is known. Our main contribution is a novel, game theoretic ...
ICALP
2009
Springer
13 years 9 months ago
2009
Springer
Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phe...
ML
1998
ACM
13 years 5 months ago
1998
ACM
Abstract. Learning in a multiagent environment is complicated by the fact that as other agents learn, the environment effectively changes. Moreover, other agents’ actions are oft...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...