Research Note
Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms

https://doi.org/10.1006/jpdc.2001.1754Get rights and content

Abstract

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. Under a linear cost structure for the individual users, we obtain several dynamic policy adjustment schemes for the online computation of the Nash equilibrium and study their local convergence properties. These policy adjustment schemes require minimum information on the part of each user regarding the cost–utility functions of the others.

References (22)

There are more references available in the full text version of this article.

Cited by (0)

1

Research supported by a grant from the France-Israel Scientific Cooperation (in Computer Science and Engineering) between the French Ministry of Research and Technology and the Israeli Ministry of Science and Technology, on information highways.

2

Research supported in part by Grants NSF INT 98-04950 and NSF ANI 98-13710 and an ARO/EPRI MURI grant.

View full text