Selfish network creation : on variants of network creation games / Andreas Cord-Landwehr ; [Reviewers: Prof. Dr. Friedhelm Meyer auf der Heide, Paderborn University; Jun.-Prof. Dr. Alexander Skopalik, Paderborn University]. Paderborn, 2016
Inhalt
- Preface
- Introduction
- Preliminaries
- The Classic Model of Network Creation Games
- Notions of Stability, Quality, and Convergence
- Known Results
- Alternative Models
- Loss and Benefit of Friendships
- The Friendship Model & Preliminaries
- Related Work & Contribution
- Worst-Case Friendships in Swap-Games
- Private Costs in Max-Swap-Game Tree Equilibria
- The Price of Anarchy in Max-Swap-Games
- The Price of Anarchy in Sum-Swap-Games
- Process Equilibria
- Conclusion & Future Work
- The Impact of Choosing Edge Qualities
- Model & Notations
- Related Work & Contribution
- Existence of Equilibria
- Quality of Equilibria in the Sum-Pricing-Game
- Quality of Equilibria in the Max-Pricing-Game
- Conclusion & Future Work
- Limits of Locality
- Model & Notations
- Related Work & Contribution
- Preliminaries
- Approximation Quality of Greedy Probing
- Approximation of the k-Local Sum-Game
- Approximation Lower Bound in the Sum-Game
- Approximation Upper Bounds in the Sum-Game
- Efficiency of Probing Locality
- Conclusion & Future Work
- Multilevel Network Games
- Model & Preliminaries
- Related Work & Contribution
- Bidirectional Gateways
- Unidirectional Gateways
- Conclusion & Future Work
- Bibliography
- Index
