Conference
Equilibria for Networks with Malicious 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 malicious behaviour. While selfish users follow a strategy that minimizes their individual cost, a malicious user will use his flow through the network in an effort to cause the maximum possible damage to this cost. We define a generalized model, present characterizations of flows at …
Authors
Karakostas G; Viglas A
Series
Lecture Notes in Computer Science
Volume
2906
Pagination
pp. 696-704
Publisher
Springer Nature
Publication Date
2003
DOI
10.1007/978-3-540-24587-2_71
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743