The impact of social ignorance on weighted congestion games
From MaRDI portal
(Redirected from Publication:692896)
Recommendations
Cites work
- scientific article; zbMATH DE number 5485547 (Why is no real title available?)
- A class of games possessing pure-strategy Nash equilibria
- Algorithms – ESA 2005
- Convergence to approximate Nash equilibria in congestion games
- Exact Price of Anarchy for Polynomial Congestion Games
- Graphical congestion games
- On best response dynamics in weighted congestion games with polynomial delays
- On the Performance of Approximate Equilibria in Congestion Games
- On the impact of combinatorial structure on congestion games
- Selfish Load Balancing Under Partial Knowledge
- Selfish Routing with Oblivious Users
- Selfish routing with incomplete information
- Selfish unsplittable flows
- The Price of Stability for Network Design with Fair Cost Allocation
- The Speed of Convergence in Congestion Games under Best-Response Dynamics
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- The price of routing unsplittable flow
- Tight bounds for selfish and greedy load balancing
- When ignorance helps: graphical multicast cost sharing games
- Worst-case equilibria
Cited in
(7)
This page was built for publication: The impact of social ignorance on weighted congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692896)