.png){kind=icon}
返回
Routing into two parallel links:: Game-theoretic distributed algorithms
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.2001.1754.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
routing
nonzero-sum games
noncooperative equilibria
greedy algorithms
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
Upregulation of Gp96 Correlates with the Radiosensitivity and Five-Year Survival Rate of Nasopharyngeal Carcinoma.png)
ORL
ORLIF0
PREAI
分享收藏Vitamin D status and acute lower respiratory infection in early childhood in Sylhet, Bangladesh
PREAI
分享收藏
分享收藏分享收藏分享收藏 没有更多内容
没有更多内容