On the α-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games

DOI10.1007/978-3-642-02270-8_9MaRDI QIDQ5321697zbMATH OpenOpenAlexFDO

Authors Wei Chen, Yajun Wang, Yuan Zhou, Shang-Hua Teng

Publication date 14 July 2009

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02270-8_9

Mathematics Subject Classification ID

Internet topics (68M11) Games involving graphs (91A43)

Recommendations

• Reputation games for undirected graphs
• Verifying Nash equilibria in PageRank games on undirected web graphs
• The web graph as an equilibrium
• Algorithms and Models for the Web-Graph
• The buck-passing game

Cites work

• An Inverse Matrix Adjustment Arising in Discriminant Analysis
• Manipulation-resistant reputation systems
• Manipulation-Resistant Reputations Using Hitting Time
• Network formation games and the potential function method

Cited in

(7)

• Reputation games for undirected graphs
• Manipulation-resistant reputations using hitting time
• Verifying Nash equilibria in PageRank games on undirected web graphs
• The web graph as an equilibrium
• Algorithms and Models for the Web-Graph
• Manipulation-Resistant Reputations Using Hitting Time
• The buck-passing game

This page was built for publication: On the α-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321697)