The following pages link to (Q3579477):
Displaying 8 items.
- Cost sharing and strategyproof mechanisms for set cover games (Q604756) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← links)
- Capacitated network design games (Q904684) (← links)
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games (Q989513) (← links)
- Anarchy Is Free in Network Creation (Q2938033) (← links)
- Improved Lower Bounds on the Price of Stability of Undirected Network Design Games (Q3162510) (← links)
- Resource Management in Large Networks (Q3637319) (← links)
- Approximate Strong Equilibrium in Job Scheduling Games (Q5459972) (← links)