Selfish routing with incomplete information
From MaRDI portal
Publication:2471698
DOI10.1007/s00224-007-9015-8zbMath1151.91331OpenAlexW1991582670MaRDI QIDQ2471698
Karsten Tiemann, Martin Gairing, Burkhard Monien
Publication date: 18 February 2008
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9015-8
Related Items (14)
STRONG EQUILIBRIA IN THE VEHICLE ROUTING GAME ⋮ Social context congestion games ⋮ A note on social learning in non-atomic routing games ⋮ Efficiency analysis of load balancing games with and without activation costs ⋮ Graphical congestion games ⋮ Common-Knowledge and Bayesian Equilibrium in Network Game ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ The impact of social ignorance on weighted congestion games ⋮ Evolutionary equilibrium in Bayesian routing games: specialization and niche formation ⋮ Facets of the fully mixed Nash equilibrium conjecture ⋮ Malicious Bayesian Congestion Games ⋮ Strong Coalitional Structure in an Open Vehicle Routing Game ⋮ Facets of the Fully Mixed Nash Equilibrium Conjecture ⋮ Social learning in nonatomic routing games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Utilitarian resource assignment
- Statistical decision theory. Foundations, concepts, and methods
- Congestion models and weighted Bayesian potential games
- Approximate equilibria and ball fusion
- Potential games
- Congestion games with player-specific payoff functions
- Games with randomly disturbed payoffs: a new rationale for mixed-strategy equilibrium points
- A class of games possessing pure-strategy Nash equilibria
- Structure and complexity of extreme Nash equilibria
- Tight bounds for worst-case equilibria
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- CONGESTION GAMES AND POTENTIALS RECONSIDERED
- The price of selfish routing
- Algorithms, games, and the internet
- STACS 2004
- Mathematical Foundations of Computer Science 2003
- Mathematical Foundations of Computer Science 2003
- Automata, Languages and Programming
- Automata, Languages and Programming
- Bounds on Multiprocessing Timing Anomalies
- Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
- Automata, Languages and Programming
- The Price of Routing Unsplittable Flow
This page was built for publication: Selfish routing with incomplete information