메뉴 건너뛰기




Volumn 47, Issue 1, 2002, Pages 92-96

Competitive routing in networks with polynomial costs

Author keywords

Networks; Noncooperative equilibria; Nonzero sum games; Routing

Indexed keywords

GAME THEORY; GRAPH THEORY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; OPTIMAL CONTROL SYSTEMS; POLYNOMIAL APPROXIMATION; ROUTERS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

EID: 0036248059     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/9.981725     Document Type: Article
Times cited : (160)

References (23)
  • 5
    • 0027870139 scopus 로고
    • The existence of equivalent mathematical programs for certain mixed equilibrium traffic assignment problems
    • (1993) Euro. J. Operat. Res. , vol.71 , pp. 177-187
    • Bennett, L.D.1
  • 21
    • 0018922522 scopus 로고
    • Existence and uniqueness of equilibrium points for concave N-person games
    • (1965) Econometrica , vol.33 , Issue.3 , pp. 520-534
    • Rosen, J.B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.