.png){kind=icon}
Return
Routing into two parallel links:: Game-theoretic distributed algorithms
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.2001.1754.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2001 Academic Press.
Keywords:
routing
nonzero-sum games
noncooperative equilibria
greedy algorithms
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available
Cited Papers
ShareSaveUpregulation of Gp96 Correlates with the Radiosensitivity and Five-Year Survival Rate of Nasopharyngeal Carcinoma.png)
ORL
ORLIF0
PREAI
ShareSaveVitamin D status and acute lower respiratory infection in early childhood in Sylhet, Bangladesh
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave no more
no more