zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Capacity allocation under noncooperative routing. (English) Zbl 0872.90035
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.

90B06Transportation, logistics
91A10Noncooperative games
90B18Communication networks (optimization)
91A80Applications of game theory
Full Text: DOI