The impact of social ignorance on weighted congestion games
From MaRDI portal
Publication:692896
DOI10.1007/S00224-011-9355-2zbMATH Open1262.91008DBLPjournals/mst/FotakisGKS12OpenAlexW1999100735WikidataQ59818423 ScholiaQ59818423MaRDI QIDQ692896FDOQ692896
Authors: Dimitris Fotakis, Vasilis Gkatzelis, A. C. Kaporis, P. G. Spirakis
Publication date: 6 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-011-9355-2
Recommendations
Cites Work
- Worst-case equilibria
- A class of games possessing pure-strategy Nash equilibria
- The Price of Stability for Network Design with Fair Cost Allocation
- Selfish unsplittable flows
- Graphical congestion games
- On the impact of combinatorial structure on congestion games
- Title not available (Why is that?)
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Tight bounds for selfish and greedy load balancing
- On best response dynamics in weighted congestion games with polynomial delays
- On the Performance of Approximate Equilibria in Congestion Games
- Algorithms – ESA 2005
- The price of routing unsplittable flow
- Convergence to approximate Nash equilibria in congestion games
- Selfish routing with incomplete information
- Selfish Load Balancing Under Partial Knowledge
- Selfish Routing with Oblivious Users
- When ignorance helps: graphical multicast cost sharing games
- The Speed of Convergence in Congestion Games under Best-Response Dynamics
- Exact Price of Anarchy for Polynomial Congestion Games
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)