Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0872.90035
Korilis, Yannis A.; Lazar, Aurel A.; Orda, Ariel
Capacity allocation under noncooperative routing. (English)
[J] IEEE Trans. Autom. Control 42, No.3, 309-325 (1997). ISSN 0018-9286

Summary: The capacity allocation problem in a network that is to be shared by noncooperative users is considered. Each user decides independently upon its routing strategy so as to optimize its individual performance objective. The operating points of the network are the Nash equilibria of the underlying routing game. The network designer aims to allocate link capacities, so that the resulting Nash equilibria are efficient, according to some systemwide performance criterion. In general, the solution of such design problems is complex and at times counterintuitive, since adding link capacity might lead to degradation of user performance. For systems of parallel links, we show that such paradoxes do not occur and that the capacity allocation problem has a simple and intuitive optimal solution that coincides with the solution in the single-user case.

MSC 2000:: *90B06 Transportation, logistics
91A10 Noncooperative games
90B18 Communication networks
91A80 Applications of game theory

Keywords: capacity allocation; network; noncooperative users; routing game; Nash equilibria

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]