Cake cutting algorithms: be fair if you can
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Natick, Mass.
Peters
1998
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | X, 181 S. graph. Darst. |
| ISBN: | 1568810768 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV024446248 | ||
| 003 | DE-604 | ||
| 005 | 20240905 | ||
| 007 | t | ||
| 008 | 090924s1998 d||| |||| 00||| eng d | ||
| 020 | |a 1568810768 |9 1-56881-076-8 | ||
| 035 | |a (OCoLC)37820010 | ||
| 035 | |a (DE-599)BVBBV024446248 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 |a DE-188 |a DE-19 | ||
| 082 | 0 | |a 511/.64 |2 21 | |
| 084 | |a SK 860 |0 (DE-625)143264: |2 rvk | ||
| 084 | |a 90D46 |2 msc | ||
| 100 | 1 | |a Robertson, Jack |d 1937- |e Verfasser |0 (DE-588)138721564 |4 aut | |
| 245 | 1 | 0 | |a Cake cutting algorithms |b be fair if you can |c Jack Robertson ; William Webb |
| 246 | 1 | 3 | |a Cake-cutting algorithms |
| 264 | 1 | |a Natick, Mass. |b Peters |c 1998 | |
| 300 | |a X, 181 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Optimierungsproblem |0 (DE-588)4390818-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Verteilter Algorithmus |0 (DE-588)4200453-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Optimierungsproblem |0 (DE-588)4390818-4 |D s |
| 689 | 0 | 1 | |a Verteilter Algorithmus |0 (DE-588)4200453-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Webb, William |d 1944- |e Verfasser |0 (DE-588)1037733606 |4 aut | |
| 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=018422963&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-018422963 | |
Datensatz im Suchindex
| _version_ | 1809403027497418752 |
|---|---|
| adam_text |
\ J
Contents
Preface «
1 Fairly Dividing a Cake 1
1.1 First Things 1
1.2 On to Three Persons — A False Start 5
1.3 On to Three Persons — Successfully 7
1.4 Envy Rears Its Ugly Head 11
1.5 EXERCISES 14
2 Pieces or Crumbs — How Many Cuts Are Needed? 17
2.1 First Things — Some Agreements on Assumptions and Notation 17
2.2 One Cut Suffices 22
2.3 On to the Count 23
2.4 Using Fewer Cuts with the Divide and Conquer Algorithm . 25
2.5 Two Cuts Are Never Enough 28
2.6 What is the Best We Can Do for Four Players? 29
2.7 Other Information on the Number of Cuts 31
2.8 EXERCISES 32
V
vi CONTENTS
3 Unequal Shares 35
3.1 First Things 35
3.2 A Better Solution Leading to Ramsey Partitions 36
3.3 Cut Near-Halves Algorithm for Unequal Shares 42
3.4 More Than Two Players with Unequal Shares 45
3.5 Unequal Shares in an Irrational Ratio 46
3.6 EXERCISES 48
4 The Serendipity of Disagreement 49
4.1 First Things 49
4.2 Some Other Examples 50
4.3 EXERCISES 57
5 Some Variations on the Theme of "Fair" Division 61
5.1 Other Interpretations of "Fair" 61
5.2 Strong Fair Division 62
5.3 Envy-Free Division 65
5.4 Exact Division 68
5.5 Less is More — The Dirty Work Problem 73
5.6 Existence Theorems 75
5.7 Classes of Algorithms 76
5.8 EXERCISES 77
6 Some Combinatorial Observations 83
6.1 Applying Graph Theory to Fair Division 83
6.2 What Can Be Done with n Arbitrary Pieces? 88
6.3 EXERCISES 91
7 Interlude: An Inventory of Results 93
7.1 Algorithms for Fair Division 93
7.2 Number of Cuts for Fair Division 95
8 Impossibility Theorems 99
8.1 Resetting the Stage 99
8.2 More Than n - 1 Cuts Are Required for n Players, n 3 . 102
8.3 No Finite Algorithm Can Accomplish Exact Division 103
8.4 PROJECTS 105
CONTENTS vii
9 Attempting Fair Division with a Limited Number of Cuts 107
9.1 The Problem 107
9.2 Simple Fair Division for a Small Number of Players 108
9.3 What Can Be Done with k Cuts? 114
9.4 Divide and Conquer Revisited 120
9.5 EXERCISES 122
9.6 PROJECTS 123
10 Exact and Envy-Free Algorithms 125
10.1 Resetting the Stage 125
10.2 Near-Exact Division 126
10.3 Envy-Free Division 128
10.4 Super Envy-Free Division 136
10.5 EXERCISES 138
10.6 PROJECTS 138
11 A Return to Division for Unequal Shares 141
11.1 Resetting the Stage 141
11.2 Ramsey Partitions and Fair Division 141
11.3 Cut and Choose for Unequal Shares 145
11.4 Envy-Free Division for Three Players with Unequal Shares . . . 149
11.5 EXERCISES 154
11.6 PROJECT 154
Solutions 155
References 173
Index 179 |
| any_adam_object | 1 |
| author | Robertson, Jack 1937- Webb, William 1944- |
| author_GND | (DE-588)138721564 (DE-588)1037733606 |
| author_facet | Robertson, Jack 1937- Webb, William 1944- |
| author_role | aut aut |
| author_sort | Robertson, Jack 1937- |
| author_variant | j r jr w w ww |
| building | Verbundindex |
| bvnumber | BV024446248 |
| classification_rvk | SK 860 |
| ctrlnum | (OCoLC)37820010 (DE-599)BVBBV024446248 |
| dewey-full | 511/.64 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.64 |
| dewey-search | 511/.64 |
| dewey-sort | 3511 264 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV024446248</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240905</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090924s1998 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1568810768</subfield><subfield code="9">1-56881-076-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)37820010</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024446248</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="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-19</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.64</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 860</subfield><subfield code="0">(DE-625)143264:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90D46</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Robertson, Jack</subfield><subfield code="d">1937-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)138721564</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Cake cutting algorithms</subfield><subfield code="b">be fair if you can</subfield><subfield code="c">Jack Robertson ; William Webb</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Cake-cutting algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Natick, Mass.</subfield><subfield code="b">Peters</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 181 S.</subfield><subfield code="b">graph. Darst.</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="650" ind1="0" ind2="7"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteilter Algorithmus</subfield><subfield code="0">(DE-588)4200453-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Verteilter Algorithmus</subfield><subfield code="0">(DE-588)4200453-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Webb, William</subfield><subfield code="d">1944-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1037733606</subfield><subfield code="4">aut</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=018422963&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018422963</subfield></datafield></record></collection> |
| id | DE-604.BV024446248 |
| illustrated | Illustrated |
| indexdate | 2024-09-06T00:06:35Z |
| institution | BVB |
| isbn | 1568810768 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018422963 |
| oclc_num | 37820010 |
| open_access_boolean | |
| owner | DE-83 DE-188 DE-19 DE-BY-UBM |
| owner_facet | DE-83 DE-188 DE-19 DE-BY-UBM |
| physical | X, 181 S. graph. Darst. |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Peters |
| record_format | marc |
| spelling | Robertson, Jack 1937- Verfasser (DE-588)138721564 aut Cake cutting algorithms be fair if you can Jack Robertson ; William Webb Cake-cutting algorithms Natick, Mass. Peters 1998 X, 181 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Optimierungsproblem (DE-588)4390818-4 gnd rswk-swf Verteilter Algorithmus (DE-588)4200453-6 gnd rswk-swf Optimierungsproblem (DE-588)4390818-4 s Verteilter Algorithmus (DE-588)4200453-6 s DE-604 Webb, William 1944- Verfasser (DE-588)1037733606 aut HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018422963&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Robertson, Jack 1937- Webb, William 1944- Cake cutting algorithms be fair if you can Optimierungsproblem (DE-588)4390818-4 gnd Verteilter Algorithmus (DE-588)4200453-6 gnd |
| subject_GND | (DE-588)4390818-4 (DE-588)4200453-6 |
| title | Cake cutting algorithms be fair if you can |
| title_alt | Cake-cutting algorithms |
| title_auth | Cake cutting algorithms be fair if you can |
| title_exact_search | Cake cutting algorithms be fair if you can |
| title_full | Cake cutting algorithms be fair if you can Jack Robertson ; William Webb |
| title_fullStr | Cake cutting algorithms be fair if you can Jack Robertson ; William Webb |
| title_full_unstemmed | Cake cutting algorithms be fair if you can Jack Robertson ; William Webb |
| title_short | Cake cutting algorithms |
| title_sort | cake cutting algorithms be fair if you can |
| title_sub | be fair if you can |
| topic | Optimierungsproblem (DE-588)4390818-4 gnd Verteilter Algorithmus (DE-588)4200453-6 gnd |
| topic_facet | Optimierungsproblem Verteilter Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018422963&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT robertsonjack cakecuttingalgorithmsbefairifyoucan AT webbwilliam cakecuttingalgorithmsbefairifyoucan AT robertsonjack cakecuttingalgorithms AT webbwilliam cakecuttingalgorithms |