Selfish routing with incomplete information

DOI10.1007/s00224-007-9015-8zbMath1151.91331MaRDI 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

zbMATH Keywords

Bayesian Nash equilibria; Incomplete information; Coordination ratio; Selfish routing

Mathematics Subject Classification ID

91A10: Noncooperative games

68M10: Network design and communication in computer systems

Related Items

Strong Coalitional Structure in an Open Vehicle Routing Game, Common-Knowledge and Bayesian Equilibrium in Network Game, Facets of the Fully Mixed Nash Equilibrium Conjecture, A note on social learning in non-atomic routing games, Social context congestion games, Graphical congestion games, The impact of social ignorance on weighted congestion games, Nash equilibria in discrete routing games with convex latency functions, Facets of the fully mixed Nash equilibrium conjecture, Social learning in nonatomic routing games, Evolutionary equilibrium in Bayesian routing games: specialization and niche formation, Efficiency analysis of load balancing games with and without activation costs, STRONG EQUILIBRIA IN THE VEHICLE ROUTING GAME, Malicious Bayesian Congestion 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