|
150
|
The Price of Stability for Network Design with Fair Cost Allocation
– Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden
- 2004
|
|
104
|
Near-optimal network design with selfish agents
– Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler
- 2003
|
|
230
|
Potential games
– D Monderer, L Shapley
- 1996
|
|
32
|
Network Design with Weighted Players
– Ho-lin Chen, Tim Roughgarden
- 2006
|
|
182
|
Algorithmic Game Theory
– Tim Roughgarden
- 2009
|
|
307
|
A class of games possessing pure-strategy Nash equilibria
– R W Rosenthal
- 1973
|
|
483
|
Worst-case equilibria
– Elias Koutsoupias, Christos Papadimitriou
- 1999
|
|
82
|
Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auction
– Adrian Vetta
- 2002
|
|
113
|
The Complexity of Pure Nash Equilibria
– Alex Fabrikant, Christos Papadimitriou, Kunal Talwar
- 2004
|
|
23
|
Strong equilibrium in cost sharing connection games
– Amir Epstein, Michal Feldman
- 2007
|
|
21
|
On the Value of Coordination in Network Design
– Susanne Albers
|
|
30
|
Non-cooperative multicast and facility location games (Extended Abstract)
– Chandra Chekuri, Joseph (Seffi) Naor, Julia Chuzhoy, et al.
- 2006
|
|
21
|
On the price of stability for designing undirected networks with fair cost allocations
– Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky, Ronen Shabo
- 2006
|
|
7
|
Distributed topology control in ad-hoc networks: A game theoretic perspective
– R S Komali, A B MacKenzie
- 2007
|
|
43
|
On the price of anarchy and stability of correlated equilibria of linear congestion games
– George Christodoulou, Elias Koutsoupias
- 2005
|
|
110
|
Selfish Routing and the Price of Anarchy
– Tim Roughgarden
- 2005
|
|
650
|
Approximation Algorithms
– V Vazirani
- 2003
|
|
133
|
A Survey of Models of Network Formation: Stability and Efficiency
– Matthew O. Jackson
- 2003
|
|
11
|
Geometric network design with selfish agents
– Martin Hoefer, Piotr Krysta
- 2005
|
