91 search results - page 6 / 19 » Equilibrium Results for Dynamic Congestion Games |
CN
2007
14 years 11 months ago
2007
In this paper we analyze a novel paradigm of reliable communication which is not based on the traditional timeout-andretransmit mechanism of TCP. Our approach, which we call Fount...
SIROCCO
2008
15 years 1 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
— We study stochastic dynamic games with a large number of players, where players are coupled via their cost functions. A standard solution concept for stochastic games is Markov...
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
103
Voted
TON
2008
14 years 11 months ago
2008
Differentiated services architectures are scalable solutions for providing class-based Quality of Service (QoS) over packet switched networks. While qualitative attributes of the o...