Selfish routing in networks / von Martin Gairing. 2006
Content
- Introduction
- Motivation Framework
- Contribution
- Routing Games on Parallel Links
- Weighted Congestion Games
- Selfish Routing with Incomplete Information
- Related Models for Selfish Routing
- Publications
- Organization
- Preliminaries
- Notation
- Gamma Function
- Falling Factorials, Stirling Numbers and Bell Numbers
- Binomial Cost Function
- Models
- Routing Games on Parallel Links
- Instance
- Strategies and Strategy Profiles
- Load and Latency
- Private Cost
- Social Cost Measures
- Nash Equilibria
- Price of Anarchy
- Selfish Steps and Nashification
- Weighted Congestion Games
- Instance
- Strategies and Strategy Profiles
- Private Cost
- Nash Equilibria
- Social Cost
- Price of Anarchy
- Network Congestion Games
- Bayesian Routing Games
- Selfish Routing on Parallel Links
- Introduction
- Identical Links
- Related Links
- Restricted Strategy Sets
- Polynomial Social Cost
- Conclusion and Discussion
- Weighted Congestion Games
- Introduction
- Price of Anarchy for Unweighted Congestion Games
- Price of Anarchy for Weighted Congestion Games
- Conclusion and Discussion
- Bayesian Routing Games
- Introduction
- Pure Bayesian Nash Equilibria
- Properties of Fully Mixed Bayesian Nash Equilibria
- Social Cost and Price of Anarchy
- Conclusion and Discussion
- References
