Routing into two parallel links: Game-theoretic distributed algorithms

Eitan Altman, Tamer Başar, Tania Jiménez, Nahum Shimkin

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)1367-1381
Number of pages15
JournalJournal of Parallel and Distributed Computing
Issue number9
StatePublished - 2001


  • Greedy algorithms
  • Noncooperative equilibria
  • Nonzero-sum games
  • Routing

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence


Dive into the research topics of 'Routing into two parallel links: Game-theoretic distributed algorithms'. Together they form a unique fingerprint.

Cite this