[PDF][PDF] Routing into two parallel links: Game-theoretic distributed algorithms
We study a class of noncooperative networks where N users send tra c to a destination node
over two links with given capacities in such a way that a Nash equilibrium is achieved …
over two links with given capacities in such a way that a Nash equilibrium is achieved …
Nash equilibria in discrete routing games with convex latency functions
M Gairing, T Lücking, M Mavronicolas… - … and Programming: 31st …, 2004 - Springer
We study Nash equilibria in a discrete routing game that combines features of the two most
famous models for non-cooperative routing, the KP model [16] and the Wardrop model [27] …
famous models for non-cooperative routing, the KP model [16] and the Wardrop model [27] …
Stackelberg thresholds in network routing games or the value of altruism
Y Sharma, DP Williamson - Proceedings of the 8th ACM conference on …, 2007 - dl.acm.org
Noncooperative network routing games are a natural model of userstrying to selfishly route
flow through a network in order to minimize their own delays. It is well known that the …
flow through a network in order to minimize their own delays. It is well known that the …
Which is the worst-case Nash equilibrium?
T Lücking, M Mavronicolas, B Monien, M Rode… - … of Computer Science …, 2003 - Springer
A Nash equilibrium of a routing network represents a stable state of the network where no
user finds it beneficial to unilaterally deviate from its routing strategy. In this work, we …
user finds it beneficial to unilaterally deviate from its routing strategy. In this work, we …
Optimal routing control: Repeated game approach
RJ La, V Anantharam - IEEE transactions on automatic control, 2002 - ieeexplore.ieee.org
Communication networks shared by selfish users are considered and modeled as
noncooperative repeated games. Each user is interested only in optimizing its own …
noncooperative repeated games. Each user is interested only in optimizing its own …
The structure and complexity of Nash equilibria for a selfish routing game
D Fotakis, S Kontogiannis, E Koutsoupias… - Theoretical Computer …, 2009 - Elsevier
In this work, we study the combinatorial structure and the computational complexity of Nash
equilibria for a certain game that models selfish routing over a network consisting of m …
equilibria for a certain game that models selfish routing over a network consisting of m …
Nashification and the coordination ratio for a selfish routing game
We study the problem of n users selfishly routing traffic through a network consisting of m
parallel related links. Users route their traffic by choosing private probability distributions …
parallel related links. Users route their traffic by choosing private probability distributions …
Network pricing using game theoretic approach
RJ La, V Anantharam - … of the 38th IEEE Conference on …, 1999 - ieeexplore.ieee.org
We model the interaction between the network and the network users as a noncooperative
game and study the Nash equilibrium points (NEP) of the game. We show that there is a …
game and study the Nash equilibrium points (NEP) of the game. We show that there is a …
Nash equilibria in discrete routing games with convex latency functions
In a discrete routing game, each of n selfish users employs a mixed strategy to ship her
(unsplittable) traffic over m parallel links. The (expected) latency on a link is determined by …
(unsplittable) traffic over m parallel links. The (expected) latency on a link is determined by …
Incentive-compatible pricing strategies in noncooperative networks
YA Korilis, TA Varvarigou… - … . IEEE INFOCOM'98, the …, 1998 - ieeexplore.ieee.org
The complexity of modern networks calls for decentralized control schemes where each user
makes its control decisions independently based on some individual performance …
makes its control decisions independently based on some individual performance …