Equilibria for networks with malicious users

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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 Wardrop equilibrium and prove bounds for the ratio of the social cost of a flow at Wardrop equilibrium over the cost when centralized coordination among users is allowed. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Karakostas, G., & Viglas, A. (2003). Equilibria for networks with malicious users. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2906, 696–704. https://doi.org/10.1007/978-3-540-24587-2_71

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free