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)
Equilibria for multiclass routing problems in multi-agent networks. (English) Zbl 1098.90012
Nowak, Andrzej S. (ed.) et al., Advances in dynamic games. Applications to economics, finance, optimization and stochastic control. Boston, MA: Birkhäuser (ISBN 0-8176-4362-1/hbk). Annals of the International Society of Dynamic Games 7, 343-367 (2005).
Summary: We study optimal static routing problems in open multiclass networks with state-independent arrival and service rates. Our goal is to study the uniqueness of optimal routing under different scenarios. We consider first the overall optimal policy, that is the routing policy whereby the overall mean cost of a job is minimized. We then consider an individually optimal policy whereby jobs are routed so that each job may fed that its own expected cost is minimized if it knows the mean cost for each path. This is related to the Wardrop equilibrium concept in a multiclass framework. We finally study the case of class optimization, in which each of several classes of jobs tries to minimize the averaged cost per job within that class; this is related to the Nash equilibrium concept. For all three settings, we show that the routing decisions at optimum need not be unique, but that the utilizations in some large class of links are uniquely determined.
90B10Network models, deterministic (optimization)
91A80Applications of game theory
90B20Traffic problems
game theory