[PDF][PDF] Routing into two parallel links: Game-theoretic distributed algorithms

T Jiménez - academia.edu
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 …

[引用][C] Routing into two parallel links: Game-theoretic distributed algorithms

E ALTMAN, T BASAR, T JIMENEZ… - Journal of parallel and …, 2001 - pascal-francis.inist.fr
Routing into two parallel links : Game-theoretic distributed algorithms CNRS Inist Pascal-Francis
CNRS Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …

Routing into two parallel links: Game-theoretic distributed algorithms

E Altman, T Başar, T Jiménez… - Journal of Parallel and …, 2001 - experts.illinois.edu
We study a class of noncooperative networks where N users send traffic to a destination
node over two links with given capacities in such a way that a Nash equilibrium is achieved …

Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms

E Altman, T Başar, T Jiménez, N Shimkin - Journal of Parallel and …, 2001 - Elsevier
We study a class of noncooperative networks where N users send traffic to a destination
node over two links with given capacities in such a way that a Nash equilibrium is achieved …

Routing into Two Parallel Links

E Altman, T Basar, T Jiménez, N Shimkin - Journal of Parallel and …, 2001 - dl.acm.org
We study a class of noncooperative networks where N users send traffic to a destination
node over two links with given capacities in such a way that a Nash equilibrium is achieved …

[PDF][PDF] Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms

E Altman, T Basar, T Jiménez, N Shimkin - www-sop.inria.fr
We study a class of noncooperative networks where N users send traffic to a destination
node over two links with given capacities in such a way that a Nash equilibrium is achieved …

[PDF][PDF] Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms

E Altman, T Basar, T Jiménez, N Shimkin - Citeseer
We study a class of noncooperative networks where N users send traffic to a destination
node over two links with given capacities in such a way that a Nash equilibrium is achieved …

[PDF][PDF] Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms

E Altman, T Basar, T Jiménez, N Shimkin - academia.edu
We study a class of noncooperative networks where N users send traffic to a destination
node over two links with given capacities in such a way that a Nash equilibrium is achieved …

Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms

E Altman, T Başar, T Jiménez, N Shimkin - Journal of Parallel and …, 2001 - infona.pl
We study a class of noncooperative networks where N users send traffic to a destination
node over two links with given capacities in such a way that a Nash equilibrium is achieved …

[PDF][PDF] Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms

E Altman, T Basar, T Jiménez, N Shimkin - www-sop.inria.fr
We study a class of noncooperative networks where N users send traffic to a destination
node over two links with given capacities in such a way that a Nash equilibrium is achieved …