179 search results - page 9 / 36 » Asynchronous Congestion Games |
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
—Most theoretical research on routing games in telecommunication networks has so far dealt with reciprocal congestion effects between routed entities. Yet in networks that suppor...
WICON
2008
13 years 8 months ago
2008
We consider congestion games in wireless sensor networks that offer quantitatively distinct classes of routing paths. Each routing class is characterized by a service cost. Within...
INFOCOM
2005
IEEE
14 years 29 days ago
2005
IEEE
The Mulitplicative Increase Multiplicative Decrease (MIMD) congestion control algorithm in the form of Scalable TCP has been proposed for high speed networks. We study fairness amo...
CIE
2010
Springer
14 years 5 days ago
2010
Springer
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
ESA
2009
Springer
14 years 1 months ago
2009
Springer
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...