Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs

DOI10.1007/978-3-642-25591-5_43zbMath1350.68029OpenAlexW188324995MaRDI QIDQ3104636

David Avis, Daichi Paku, Kazuo Iwama

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_43

zbMATH Keywords

game theoryNash equilibriaPageRankfractional optimization

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Noncooperative games (91A10) Fractional programming (90C32) Games involving graphs (91A43) Applications of game theory (91A80) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11)

Related Items (2)

The Web Graph as an Equilibrium ⋮ Reputation games for undirected graphs

This page was built for publication: Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs