Abstract
We study an intensively studied resource allocation game introduced by Koutsoupias and Papadimitriou where n weighted jobs are allocated to m identical machines. It was conjectured by Gairing et al. that the fully mixed Nash equilibrium is the worst Nash equilibrium for this game w. r. t. the expected maximum load over all machines. The known algorithms for approximating the so-called “price of anarchy” rely on this conjecture. We present a counter-example to the conjecture showing that fully mixed equilibria cannot be used to approximate the price of anarchy within reasonable factors. In addition, we present an algorithm that constructs so-called concentrated equilibria that approximate the worst-case Nash equilibrium within constant factors.
Supported in part by the EU within the 6th Framework Programme under contract 001907 (DELIS) and by DFG grant Vo889/1-2.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baltz, A., Srivastav, A.: On the asymptotic inefficiency of the fully mixed Nash equilibrium (2005) (preprint)
Czumaj, A., Vöcking, B.: Tight bounds for worst-case equilibria. In: Proc. 13th Ann. ACM–SIAM Symp. on Discrete Algorithms (SODA), pp. 413–420 (2002)
Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of Nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 123–134. Springer, Heidelberg (2002)
Gairing, M., Lücking, T., Mavronicolas, M., Monien, B.: Computing Nash equilibria for scheduling on restricted parallel links. In: Proc. 36th Ann. ACM. Symp. on Theory of Comput. (STOC), pp. 613–622 (2004)
Gairing, M., Lücking, T., Mavronicolas, M., Monien, B., Spirakis, P.G.: Extreme Nash equilibria. In: Proc. 8th Italian Conference on Theoretical Computer Science, pp. 1–20 (2003)
Gairing, M., Lücking, T., Mavronicolas, M., Monien, B., Spirakis, P.G.: Structure and complexity of extreme Nash equilibria. Theoretical Computer Science (2005) (to appear)
Gonnet, G.: Expected length of the longest probe sequence in hash code searching. Journal of the Association for Computing Machinery 28(2), 289–304 (1981)
Hagerup, T., Rüb, C.: A guided tour of Chernoff bounds. Information Processing Letters (33), 305–308 (1990)
Koutsoupias, E., Mavronicolas, M., Spirakis, P.G.: Approximate equilibria and ball fusion. Theory Comput. Syst. 36(6), 683–693 (2003)
Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proc. 16th Int. Symp. on Theoret. Aspects of Comput. Sci (STACS), pp. 404–413. Springer, Heidelberg (1999)
Mavronicolas, M., Spirakis, P.G.: The price of selfish routing. In: Proc. 33rd Ann. ACM. Symp. on Theory of Comput. (STOC), pp. 510–519 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fischer, S., Vöcking, B. (2005). On the Structure and Complexity of Worst-Case Equilibria. In: Deng, X., Ye, Y. (eds) Internet and Network Economics. WINE 2005. Lecture Notes in Computer Science, vol 3828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11600930_16
Download citation
DOI: https://doi.org/10.1007/11600930_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30900-0
Online ISBN: 978-3-540-32293-1
eBook Packages: Computer ScienceComputer Science (R0)