Congestion games with malicious players

We study the equilibria of non-atomic congestion games in which there are two types of players: rational players, who seek to minimize their own delay, and malicious players, who seek to maximize the average delay experienced by the rational players. We study the existence of pure and mixed Nash equilibria for these games, and we seek to quantify the impact of the malicious players on the equilibrium. One counter intuitive phenomenon which we demonstrate is the "windfall of malice": paradoxically, when a myopically malicious player gains control of a fraction of the flow, a fraction of the players change from rational to malicious, the new equilibrium may be more favorable for the remaining rational players than the previous equilibrium.

[1]  I. Glicksberg A FURTHER GENERALIZATION OF THE KAKUTANI FIXED POINT THEOREM, WITH APPLICATION TO NASH EQUILIBRIUM POINTS , 1952 .

[2]  D. Schmeidler Equilibrium points of nonatomic games , 1973 .

[3]  R. Rosenthal A class of games possessing pure-strategy Nash equilibria , 1973 .

[4]  S. Rashid Equilibrium points of non-atomic games : Asymptotic results , 1982 .

[5]  A. Mas-Colell On a theorem of Schmeidler , 1984 .

[6]  Christos H. Papadimitriou,et al.  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..

[7]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[8]  Tim Roughgarden,et al.  Designing networks for selfish users is hard , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[9]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[10]  K. Eliaz Fault Tolerant Implementation , 2002 .

[11]  J. Morgan,et al.  The Spite Motive and Equilibrium Behavior in Auctions , 2003 .

[12]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[13]  Stefan Schmid,et al.  When selfish meets evil: byzantine players in a virus inoculation game , 2006, PODC '06.

[14]  Berthold Vöcking,et al.  Fast convergence to Wardrop equilibria by adaptive sampling methods , 2006, STOC '06.

[15]  Yoav Shoham,et al.  Spiteful Bidding in Sealed-Bid Auctions , 2007, IJCAI.

[16]  George Karakostas,et al.  Equilibria for networks with malicious users , 2007, ISAAC.