Abstract
J. Hopcroft and D. Sheldon originally introduced the PageRank game to investigate the self-interested behavior of web authors who want to boost their PageRank by using game theoretical approaches. The PageRank game is a multiplayer game where players are the nodes in a directed web graph and they place their outlinks to maximize their PageRank value. They give best response strategies for each player and characterize properties of α-insensitive Nash equilibria. In this paper we consider PageRank games for undirected web graphs, where players are free to delete any of their bidirectional links if they wish. We study the problem of determining whether the given graph represents a Nash equilibrium or not. We give an O(n 2) time algorithm for a tree, and a parametric O(2k n 4) time algorithm for general graphs, where k is the maximum vertex degree in any biconnected component of the graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Edelsbrunner, H.: Algorithms in Combinatorial Geometry. EATCS Monographs in Theoretical Computer Science, vol. 10. Springer, Heidelberg (1987)
Hopcroft, J., Sheldon, D.: Network reputation games, eCommons@Cornell (2008) (manuscript), http://hdl.handle.net/1813/11579
Megiddo, N.: Combinatorial optimization with rational objective functions. Math. of Oper. Res. 4, 414–424 (1979)
Radzik, T.: Newton’s method for fractional combinatorial optimization. In: Proceedings, 33rd Annual Symposium on Foundations of Computer Science, pp. 659–669 (1992)
Avrachenkov, K., Litvak, N.: The effect of new links on Google PageRank. Stochastic Models, 319–331 (2006)
Csáji, B.C., Jungers, R.M., Blondel, V.D.: PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation. In: Hutter, M., Stephan, F., Vovk, V., Zeugmann, T. (eds.) ALT 2010. LNCS, vol. 6331, pp. 89–103. Springer, Heidelberg (2010)
De Kerchove, C., Ninove, L., Van Dooren, P.: Maximizing pagerank via outlinks. Linear Algebra and its Applications 429, 1254–1276 (2008)
Olsen, M.: The Computational Complexity of Link Building. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 119–129. Springer, Heidelberg (2008)
Olsen, M.: Maximizing PageRank with New Backlinks. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 37–48. Springer, Heidelberg (2010)
Olsen, M., Viglas, A., Zvedeniouk, I.: A Constant-Factor Approximation Algorithm for the Link Building Problem. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol. 6509, pp. 87–96. Springer, Heidelberg (2010)
Chen, W., Teng, S.-H., Wang, Y., Zhou, Y.: On the α-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol. 5598, pp. 63–73. Springer, Heidelberg (2009)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. In: Proceedings of the 7th International World Wide Web Conference, pp. 107–117 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avis, D., Iwama, K., Paku, D. (2011). Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs. In: Asano, T., Nakano, Si., Okamoto, Y., Watanabe, O. (eds) Algorithms and Computation. ISAAC 2011. Lecture Notes in Computer Science, vol 7074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25591-5_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-25591-5_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25590-8
Online ISBN: 978-3-642-25591-5
eBook Packages: Computer ScienceComputer Science (R0)