Sciweavers

141 search results - page 15 / 29
» On the uniqueness of Bertrand equilibrium
Sort
View
CCR
2008
83views more  CCR 2008»
13 years 7 months ago
Stability and fairness of explicit congestion control with small buffers
Rate control protocols that utilise explicit feedback from routers are able to achieve fast convergence to an equilibrium which approximates processor-sharing on a single bottlene...
Frank P. Kelly, Gaurav Raina, Thomas Voice
INFOCOM
2010
IEEE
13 years 6 months ago
A Theoretical Framework for Hierarchical Routing Games
—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...
Vijay Kamble, Eitan Altman, Rachid El Azouzi, Vino...
EJWCN
2010
131views more  EJWCN 2010»
13 years 2 months ago
The Waterfilling Game-Theoretical Framework for Distributed Wireless Network Information Flow
We present a general game-theoretical framework for the resource allocation problem in the downlink scenario of distributed wireless small-cell networks, where multiple access poi...
Gaoning He, Laura Cottatellucci, Mérouane D...
CORR
2011
Springer
178views Education» more  CORR 2011»
13 years 2 months ago
Robust Additively Coupled Games
We determine the robust Nash equilibrium (RNE) for a wide range of problems in communications systems and networks that are faced with uncertainty in their parameters’ values. T...
Saeedeh Parsaeefard, Ahmad R. Sharafat, Mihaela va...
INFOCOM
2006
IEEE
14 years 1 months ago
Bottleneck Routing Games in Communication Networks
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
Ron Banner, Ariel Orda