Geodesic
Routing problem with splitable traffic and incomplete information
Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 1 (2009) no. 3, pp. 107-117 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

We investigate the equilibria in Bayesian routing game in network with selfish users' behavior where each user chooses his route trying to minimize the expected delay of his own traffic he send. This scheme is based on [1] and modified for model with parallel links where user's traffic is splittable. Our interest are equilibria: Wardrop Equilibrium, that always exists and can be found using potential function, and its special case Bayesian Wardrop Equilibrium, that can be more easily understood by users, but its existence is an open question.
Keywords: optimal routing, splittable traffic, incomplete information, Wardrop equilibrium. 
@article{MGTA_2009_1_3_a6,
     author = {Julia Chuiko},
     title = {Routing problem with splitable traffic and incomplete information},
     journal = {Matemati\v{c}eska\^a teori\^a igr i e\"e prilo\v{z}eni\^a},
     pages = {107--117},
     year = {2009},
     volume = {1},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MGTA_2009_1_3_a6/}
}
TY  - JOUR
AU  - Julia Chuiko
TI  - Routing problem with splitable traffic and incomplete information
JO  - Matematičeskaâ teoriâ igr i eë priloženiâ
PY  - 2009
SP  - 107
EP  - 117
VL  - 1
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/MGTA_2009_1_3_a6/
LA  - ru
ID  - MGTA_2009_1_3_a6
ER  - 
%0 Journal Article
%A Julia Chuiko
%T Routing problem with splitable traffic and incomplete information
%J Matematičeskaâ teoriâ igr i eë priloženiâ
%D 2009
%P 107-117
%V 1
%N 3
%U http://geodesic.mathdoc.fr/item/MGTA_2009_1_3_a6/
%G ru
%F MGTA_2009_1_3_a6
Julia Chuiko. Routing problem with splitable traffic and incomplete information. Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 1 (2009) no. 3, pp. 107-117. http://geodesic.mathdoc.fr/item/MGTA_2009_1_3_a6/

[1] Gairing M., Monien B., Tiemann K., “Selfish Routing with Incomplete information”, Theory Comput Syst., 42:1 (2008), 91–130 | DOI | MR | Zbl

[2] Gairing M., Monien B., Tiemann K., “Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions”, Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), LNCS, 4051, 2006, 501–512 | MR | Zbl