Dynamic Inefficiency: Anarchy without Stability
The price of anarchy  is by now a standard measure for quantifying the inefficiency introduced in games due to selfish behavior, and is defined as the ratio between the optimal outcome and the worst Nash equilibrium. However, this notion is well defined only for games that always possess a Nash equilibrium (NE). We propose the dynamic inefficiency measure, which is roughly defined as the average inefficiency in an infinite best-response dynamic. Both the price of anarchy  and the price of sinking  can be obtained as special cases of the dynamic inefficiency measure. We consider three natural best-response dynamic rules — Random Walk (RW), Round Robin (RR) and Best Improvement (BI) — which are distinguished according to the order in which players apply best-response moves.
In order to make the above concrete, we use the proposed measure to study the job scheduling setting introduced in , and in particular the scheduling policy introduced there. While the proposed policy achieves the best possible price of anarchy with respect to a pure NE, the game induced by the proposed policy may admit no pure NE, thus the dynamic inefficiency measure reflects the worst case inefficiency better. We show that the dynamic inefficiency may be arbitrarily higher than the price of anarchy, in any of the three dynamic rules. As the dynamic inefficiency of the RW dynamic coincides with the price of sinking, this result resolves an open question raised in .
We further use the proposed measure to study the inefficiency of the Hotelling game and the facility location game. We find that using different dynamic rules may yield diverse inefficiency outcomes; moreover, it seems that no single dynamic rule is superior to another.
KeywordsNash Equilibrium Pure Strategy Round Robin Potential Game Dynamic Rule
Unable to display preview. Download preview PDF.
- 1.Albers, S., Elits, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (2006)Google Scholar
- 2.Anshelevich, E., Dasgupta, A., Tardos, É., Wexler, T.: Near-Optimal Network Design with Selfish Agents. In: STOC 2003 (2003)Google Scholar
- 3.Azar, Y., Jain, K., Mirrokni, V.: (almost) optimal coordination mechanisms for unrelated machine scheduling. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 323–332. Society for Industrial and Applied Mathematics, Philadelphia (2008)Google Scholar
- 5.Czumaj, A., Vöcking, B.: Tight bounds for worst-case equilibria. In: SODA, pp. 413–420 (2002)Google Scholar
- 7.Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: ACM Symposium on Principles of Distributed Computing, PODC (2003)Google Scholar
- 9.Goemans, M., Mirrokni, V., Vetta, A.: Sink equilibria and convergence. In: FOCS 2005: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 142–154. IEEE Computer Society, Washington, DC (2005)Google Scholar
- 16.Papadimitriou, C.: Algorithms, games, and the Internet. In: Proceedings of 33rd STOC, pp. 749–753 (2001)Google Scholar
- 18.Roughgarden, T.: The price of anarchy is independent of the network topology. In: STOC 2002, pp. 428–437 (2002)Google Scholar
- 20.Vetta, A.R.: Nash equilibria in competitive societies with applications to facility location, traffic routing and auctions. In: Symposium on the Foundations of Computer Science (FOCS), pp. 416–425 (2002)Google Scholar