Conference
Selfish Routing with Oblivious Users
Abstract
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering users oblivious to congestion. While in the typical selfish routing setting the users follow a strategy that minimizes their individual cost by taking into account the (dynamic) congestion due to the current routing pattern, an oblivious user ignores congestion altogether. Instead, he …
Authors
Karakostas G; Kim T; Viglas A; Xia H
Series
Lecture Notes in Computer Science
Volume
4474
Pagination
pp. 318-327
Publisher
Springer Nature
Publication Date
January 1, 2007
DOI
10.1007/978-3-540-72951-8_25
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743