Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness release_eae6kjcrv5hgjptnycrqlusmi4

by Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden

Published in Lecture Notes in Computer Science by Springer Berlin Heidelberg.

2010   p17-28

Archived Files and Locations

application/pdf  605.5 kB
file_c2q6nrbx5naqfdmu3p4bqoigoa
theory.stanford.edu (web)
web.archive.org (webarchive)
application/pdf  567.9 kB
file_vmht53iofjdmbc27bdnfdyjr5y
web.archive.org (webarchive)
theory.stanford.edu (web)
web.archive.org (webarchive)
application/pdf  178.6 kB
file_3dqvt47rpvc5na44syynvztarm
web.archive.org (webarchive)
www.stanford.edu (web)
Read Archived PDF
Preserved and Accessible
Type  chapter
Stage   published
Year   2010
Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  0302-9743
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 8d6974f5-b31d-476f-86e1-901897d58e5b
API URL: JSON