scientific article; zbMATH DE number 5764884
From MaRDI portal
Publication:3579477
zbMATH Open1192.91087MaRDI QIDQ3579477FDOQ3579477
Publication date: 6 August 2010
Title of this publication is not available (Why is that?)
Social choice (91B14) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Public goods (91B18)
Cited In (8)
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
- Resource Management in Large Networks
- Anarchy Is Free in Network Creation
- Cost sharing and strategyproof mechanisms for set cover games
- On the performance of approximate equilibria in congestion games
- Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
- Capacitated network design games
- Approximate Strong Equilibrium in Job Scheduling Games
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579477)
