Abstract / Description of output
In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture, henceforth abbreviated as the backslashmathsfFMNE Conjecture, in selfish routing for the special case of n identical users over two (identical) parallel links. We introduce a new measure of Social Cost, defined as the expectation of the square of the maximum congestion on a link; we call it Quadratic Maximum Social Cost. A Nash equilibrium is a stable state where no user can improve her (expected) latency by switching her mixed strategy; a worst-case Nash equilibrium is one that maximizes Quadratic Maximum Social Cost. In the fully mixed Nash equilibrium, all mixed strategies achieve full support.
| Original language | English |
|---|---|
| Pages (from-to) | 60-112 |
| Number of pages | 53 |
| Journal | Theory of Computing Systems |
| Volume | 47 |
| Issue number | 1 |
| Early online date | 13 Mar 2009 |
| DOIs | |
| Publication status | Published - Jul 2010 |