Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Newton's method for fractional combinatorial optimization
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
The Computational Complexity of Link Building
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
On the α-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Pagerank optimization in polynomial time by stochastic shortest path reformulation
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
A constant-factor approximation algorithm for the link building problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Maximizing pagerank with new backlinks
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Reputation games for undirected graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
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(n2) time algorithm for a tree, and a parametric O(2kn4) time algorithm for general graphs, where k is the maximum vertex degree in any biconnected component of the graph.