SIGN IN
SIGN UP
On a network creation game
Full Text:
PDF
Buy this Article
Authors:
Alex Fabrikant
Computer Science Division, UC Berkeley, Berkeley, CA
Ankur Luthra
Computer Science Division, UC Berkeley, Berkeley, CA
Elitza Maneva
Computer Science Division, UC Berkeley, Berkeley, CA
Christos H. Papadimitriou
Computer Science Division, UC Berkeley, Berkeley, CA
Scott Shenker
International Computer Science Institute, Berkeley, CA
2003 Article
Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 97
· Downloads (cumulative): 1,512
· Citation Count: 120
Published in:
· Proceeding
PODC '03
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Pages 347-351
ACM
New York, NY
, USA
©2003
table of contents
ISBN:1-58113-708-7
doi>
10.1145/872035.872088
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
algorithms
design
distributed network design
game-theoretic models
games
games
graphs and networks
nash equilibria
performance
price of anarchy
trees
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder