Which Is the Worst-Case Nash Equilibrium? [chapter]

Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul Spirakis, Imrich Vrto
2003 Lecture Notes in Computer Science  
A Nash equilibrium of a routing network represents a stable state of the network where no user finds it beneficial to unilaterally deviate from its routing strategy. In this work, we investigate the structure of such equilibria within the context of a certain game that models selfish routing for a set of n users each shipping its traffic over a network consisting of m parallel links. In particular, we are interested in identifying the worst-case Nash equilibrium -the one that maximizes social
more » ... st. Worst-case Nash equilibria were first introduced and studied in the pioneering work of Koutsoupias and Papadimitriou [9]. More specifically, we continue the study of the Conjecture of the Fully Mixed Nash Equilibrium, henceforth abbreviated as FMNE Conjecture, which asserts that the fully mixed Nash equilibrium, when existing, is the worst-case Nash equilibrium. (In the fully mixed Nash equilibrium, the mixed strategy of each user assigns (strictly) positive probability to every link.) We report substantial progress towards identifying the validity, methodologies to establish, and limitations of, the FMNE Conjecture.
doi:10.1007/978-3-540-45138-9_49 fatcat:now2k3qnmfazjodfrkmscgxz7i