Routing games
From MaRDI portal
Recommendations
Cited in
(35)- Two-terminal routing games with unknown active players
- The line planning routing game
- Price of anarchy for highly congested routing games in parallel networks
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Constraint games for stable and optimal allocation of demands in SDN
- Delegation and ambiguity in correlated equilibrium
- Heuristic optimization for multi-depot vehicle routing problem in ATM network model
- Using inverse optimization to learn cost functions in generalized Nash games
- A game-theoretic analysis of deep neural networks
- Smart routing of electric vehicles for load balancing in smart grids
- Achieving target equilibria in network routing games without knowing the latency functions
- The price of anarchy of affine congestion games with similar strategies
- Efficient coordination mechanisms for unrelated machine scheduling
- A Stackelberg strategy for routing flow over time
- On the price of anarchy of highly congested nonatomic network games
- Traffic routing oligopoly
- Computational social choice for coordination in agent networks
- Interdomain Routing and Games
- Introduction to the inefficiency of equilibria
- On the Inefficiency of Equilibria in Congestion Games
- Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Repeated congestion games with bounded rationality
- Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox
- Routing games in the wild: efficiency, equilibration and regret. Large-scale field experiments in Singapore
- Selfishness need not be bad
- The Value of Information in Selfish Routing
- An Online Learning Approach to a Multi-player N-armed Functional Bandit
- When is selfish routing bad? The price of anarchy in light and heavy traffic
- Online learning of Nash equilibria in congestion games
- “Beat-Your-Rival” Routing Games
- Coping with selfishness in congestion games. Analysis and design via LP duality
- Computing the price of anarchy in atomic network congestion games (invited talk)
- Price of anarchy for graphic matroid congestion games
- Competitive routing over time
This page was built for publication: Routing games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524727)
