Reputation games for undirected graphs
From MaRDI portal
Publication:2636798
DOI10.1016/j.dam.2013.09.022zbMath1283.05179arXiv1205.6683OpenAlexW2082209974MaRDI QIDQ2636798
Kazuo Iwama, Daichi Paku, David Avis
Publication date: 18 February 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.6683
Noncooperative games (91A10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Maximizing PageRank via outlinks
- A Constant-Factor Approximation Algorithm for the Link Building Problem
- Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs
- The Computational Complexity of Link Building
- Maximizing PageRank with New Backlinks
- Combinatorial Optimization with Rational Objective Functions
- PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
- On the α-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games
- The Effect of New Links on Google Pagerank