Selfish routing and the price of anarchy:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass. [u.a.]
MIT Press
2005
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | graph. Darst. Includes bibliographical references (p. [169]-190) and index |
| Beschreibung: | ix, 196 Seiten Illustrationen, Diagramme 24 cm |
| ISBN: | 0262182432 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV021632561 | ||
| 003 | DE-604 | ||
| 005 | 20230131 | ||
| 007 | t | ||
| 008 | 060627s2005 xxua||| |||| 00||| eng d | ||
| 010 | |a 2004051172 | ||
| 020 | |a 0262182432 |c alk. paper |9 0-262-18243-2 | ||
| 035 | |a (OCoLC)635964479 | ||
| 035 | |a (DE-599)BVBBV021632561 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-20 |a DE-91G |a DE-703 |a DE-634 |a DE-83 |a DE-188 |a DE-11 |a DE-384 |a DE-523 |a DE-739 | ||
| 050 | 0 | |a TK5105.5 | |
| 082 | 0 | |a 004.65 | |
| 082 | 0 | |a 004.6/5 |2 22 | |
| 084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
| 084 | |a DAT 517f |2 stub | ||
| 084 | |a DAT 259f |2 stub | ||
| 084 | |a 68M10 |2 msc | ||
| 100 | 1 | |a Roughgarden, Tim |d 1975- |e Verfasser |0 (DE-588)1117167275 |4 aut | |
| 245 | 1 | 0 | |a Selfish routing and the price of anarchy |c Tim Roughgarden |
| 264 | 1 | |a Cambridge, Mass. [u.a.] |b MIT Press |c 2005 | |
| 300 | |a ix, 196 Seiten |b Illustrationen, Diagramme |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a graph. Darst. | ||
| 500 | |a Includes bibliographical references (p. [169]-190) and index | ||
| 650 | 4 | |a Computer networks |x Design and construction | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Eigennütziges Routing |0 (DE-588)4834093-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexes System |0 (DE-588)4114261-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
| 689 | 0 | 1 | |a Komplexes System |0 (DE-588)4114261-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Eigennütziges Routing |0 (DE-588)4834093-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014847438&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-014847438 | ||
Datensatz im Suchindex
| _version_ | 1804135430806831104 |
|---|---|
| adam_text | Contents
Preface vii
I INTRODUCTION AND PRELIMINARIES
1 Introduction 3
1.1 Selfish Routing 3
1.2 Two Motivating Examples 3
1.3 Applications and Caveats 6
1.4 How to Read this Book 11
1.5 Notes 12
2 Preliminaries 17
2.1 The Model 17
2.2 Flows at Nash Equilibrium 20
2.3 The Price of Anarchy 21
2.4 A Characterization of Optimal Flows 22
2.5 Examples 28
2.6 Existence and Uniqueness of Nash Flows 34
2.7 Nash Flows in Single Commodity Networks 37
2.8 Notes 41
II BOUNDING THE PRICE OF ANARCHY
3 How Bad Is Selfish Routing? 51
3.1 Overview 51
3.2 The Price of Anarchy with Linear Cost Functions 53
3.3 A General Upper Bound on the Price of Anarchy 58
3.4 Matching Lower Bounds in Simple Networks 62
3.5 Computing the Price of Anarchy 69
3.6 A Bicriteria Bound in General Networks 73
3.7 Notes 77
4 Extensions 85
4.1 Nonatomic Congestion Games 85
4.2 Approximate Nash Flows 88
4.3 Edge Capacities 92
4.4 Atomic Selfish Routing 99
4.5 A Quick and Dirty Bound on the Price of Anarchy 104
4.6 Better Bounds for Many Traffic Rates 107
4.7 Maximum Cost 110
4.8 Notes 114
vi Contents
III COPING WITH SELFISHNESS
5 Bounding and Detecting Braess s Paradox 121
5.1 Overview 121
5.2 Bounding Braess s Paradox 122
5.3 Detecting Braess s Paradox 132
5.4 Notes 146
6 Stackelberg Routing 151
6.1 Overview 151
6.2 Stackelberg Strategies and Induced Equilibria 152
6.3 Three Stackelberg Strategies 153
6.4 Upper Bounds for Networks of Parallel Links 155
6.5 Lower Bounds in More General Networks 159
6.6 The Complexity of Computing Optimal Strategies 162
6.7 Notes 165
References 169
Index 191
|
| adam_txt |
Contents
Preface vii
I INTRODUCTION AND PRELIMINARIES
1 Introduction 3
1.1 Selfish Routing 3
1.2 Two Motivating Examples 3
1.3 Applications and Caveats 6
1.4 How to Read this Book 11
1.5 Notes 12
2 Preliminaries 17
2.1 The Model 17
2.2 Flows at Nash Equilibrium 20
2.3 The Price of Anarchy 21
2.4 A Characterization of Optimal Flows 22
2.5 Examples 28
2.6 Existence and Uniqueness of Nash Flows 34
2.7 Nash Flows in Single Commodity Networks 37
2.8 Notes 41
II BOUNDING THE PRICE OF ANARCHY
3 How Bad Is Selfish Routing? 51
3.1 Overview 51
3.2 The Price of Anarchy with Linear Cost Functions 53
3.3 A General Upper Bound on the Price of Anarchy 58
3.4 Matching Lower Bounds in Simple Networks 62
3.5 Computing the Price of Anarchy 69
3.6 A Bicriteria Bound in General Networks 73
3.7 Notes 77
4 Extensions 85
4.1 Nonatomic Congestion Games 85
4.2 Approximate Nash Flows 88
4.3 Edge Capacities 92
4.4 Atomic Selfish Routing 99
4.5 A Quick and Dirty Bound on the Price of Anarchy 104
4.6 Better Bounds for Many Traffic Rates 107
4.7 Maximum Cost 110
4.8 Notes 114
vi Contents
III COPING WITH SELFISHNESS
5 Bounding and Detecting Braess's Paradox 121
5.1 Overview 121
5.2 Bounding Braess's Paradox 122
5.3 Detecting Braess's Paradox 132
5.4 Notes 146
6 Stackelberg Routing 151
6.1 Overview 151
6.2 Stackelberg Strategies and Induced Equilibria 152
6.3 Three Stackelberg Strategies 153
6.4 Upper Bounds for Networks of Parallel Links 155
6.5 Lower Bounds in More General Networks 159
6.6 The Complexity of Computing Optimal Strategies 162
6.7 Notes 165
References 169
Index 191 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Roughgarden, Tim 1975- |
| author_GND | (DE-588)1117167275 |
| author_facet | Roughgarden, Tim 1975- |
| author_role | aut |
| author_sort | Roughgarden, Tim 1975- |
| author_variant | t r tr |
| building | Verbundindex |
| bvnumber | BV021632561 |
| callnumber-first | T - Technology |
| callnumber-label | TK5105 |
| callnumber-raw | TK5105.5 |
| callnumber-search | TK5105.5 |
| callnumber-sort | TK 45105.5 |
| callnumber-subject | TK - Electrical and Nuclear Engineering |
| classification_rvk | ST 200 |
| classification_tum | DAT 517f DAT 259f |
| ctrlnum | (OCoLC)635964479 (DE-599)BVBBV021632561 |
| dewey-full | 004.65 004.6/5 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.65 004.6/5 |
| dewey-search | 004.65 004.6/5 |
| dewey-sort | 14.65 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01981nam a2200517 c 4500</leader><controlfield tag="001">BV021632561</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230131 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">060627s2005 xxua||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2004051172</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262182432</subfield><subfield code="c">alk. paper</subfield><subfield code="9">0-262-18243-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)635964479</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021632561</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-523</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5105.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.65</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.6/5</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 200</subfield><subfield code="0">(DE-625)143611:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 259f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68M10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Roughgarden, Tim</subfield><subfield code="d">1975-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1117167275</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Selfish routing and the price of anarchy</subfield><subfield code="c">Tim Roughgarden</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass. [u.a.]</subfield><subfield code="b">MIT Press</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">ix, 196 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</subfield><subfield code="c">24 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">graph. Darst.</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. [169]-190) and index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</subfield><subfield code="x">Design and construction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Eigennütziges Routing</subfield><subfield code="0">(DE-588)4834093-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexes System</subfield><subfield code="0">(DE-588)4114261-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Komplexes System</subfield><subfield code="0">(DE-588)4114261-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Eigennütziges Routing</subfield><subfield code="0">(DE-588)4834093-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014847438&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-014847438</subfield></datafield></record></collection> |
| id | DE-604.BV021632561 |
| illustrated | Illustrated |
| index_date | 2024-07-02T14:57:39Z |
| indexdate | 2024-07-09T20:40:23Z |
| institution | BVB |
| isbn | 0262182432 |
| language | English |
| lccn | 2004051172 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-014847438 |
| oclc_num | 635964479 |
| open_access_boolean | |
| owner | DE-20 DE-91G DE-BY-TUM DE-703 DE-634 DE-83 DE-188 DE-11 DE-384 DE-523 DE-739 |
| owner_facet | DE-20 DE-91G DE-BY-TUM DE-703 DE-634 DE-83 DE-188 DE-11 DE-384 DE-523 DE-739 |
| physical | ix, 196 Seiten Illustrationen, Diagramme 24 cm |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | MIT Press |
| record_format | marc |
| spelling | Roughgarden, Tim 1975- Verfasser (DE-588)1117167275 aut Selfish routing and the price of anarchy Tim Roughgarden Cambridge, Mass. [u.a.] MIT Press 2005 ix, 196 Seiten Illustrationen, Diagramme 24 cm txt rdacontent n rdamedia nc rdacarrier graph. Darst. Includes bibliographical references (p. [169]-190) and index Computer networks Design and construction Computational complexity Eigennütziges Routing (DE-588)4834093-5 gnd rswk-swf Komplexes System (DE-588)4114261-5 gnd rswk-swf Rechnernetz (DE-588)4070085-9 gnd rswk-swf Rechnernetz (DE-588)4070085-9 s Komplexes System (DE-588)4114261-5 s DE-604 Eigennütziges Routing (DE-588)4834093-5 s HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014847438&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Roughgarden, Tim 1975- Selfish routing and the price of anarchy Computer networks Design and construction Computational complexity Eigennütziges Routing (DE-588)4834093-5 gnd Komplexes System (DE-588)4114261-5 gnd Rechnernetz (DE-588)4070085-9 gnd |
| subject_GND | (DE-588)4834093-5 (DE-588)4114261-5 (DE-588)4070085-9 |
| title | Selfish routing and the price of anarchy |
| title_auth | Selfish routing and the price of anarchy |
| title_exact_search | Selfish routing and the price of anarchy |
| title_exact_search_txtP | Selfish routing and the price of anarchy |
| title_full | Selfish routing and the price of anarchy Tim Roughgarden |
| title_fullStr | Selfish routing and the price of anarchy Tim Roughgarden |
| title_full_unstemmed | Selfish routing and the price of anarchy Tim Roughgarden |
| title_short | Selfish routing and the price of anarchy |
| title_sort | selfish routing and the price of anarchy |
| topic | Computer networks Design and construction Computational complexity Eigennütziges Routing (DE-588)4834093-5 gnd Komplexes System (DE-588)4114261-5 gnd Rechnernetz (DE-588)4070085-9 gnd |
| topic_facet | Computer networks Design and construction Computational complexity Eigennütziges Routing Komplexes System Rechnernetz |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014847438&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT roughgardentim selfishroutingandthepriceofanarchy |