The geometry of efficient fair division:
What is the best way to divide a 'cake' and allocate the pieces among some finite collection of players? In this book, the cake is a measure space, and each player uses a countably additive, non-atomic probability measure to evaluate the size of the pieces of cake, with different players g...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | eBook |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
2005
|
| Links: | https://doi.org/10.1017/CBO9780511546679 |
| Summary: | What is the best way to divide a 'cake' and allocate the pieces among some finite collection of players? In this book, the cake is a measure space, and each player uses a countably additive, non-atomic probability measure to evaluate the size of the pieces of cake, with different players generally using different measures. The author investigates efficiency properties (is there another partition that would make everyone at least as happy, and would make at least one player happier, than the present partition?) and fairness properties (do all players think that their piece is at least as large as every other player's piece?). He focuses exclusively on abstract existence results rather than algorithms, and on the geometric objects that arise naturally in this context. By examining the shape of these objects and the relationship between them, he demonstrates results concerning the existence of efficient and fair partitions. |
| Physical Description: | 1 Online-Ressource (ix, 462 Seiten) |
| ISBN: | 9780511546679 |
Staff View
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9780511546679 | ||
| 003 | UkCbUP | ||
| 005 | 20160428132237.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 090508s2005||||enk o ||1 0|eng|d | ||
| 020 | |a 9780511546679 | ||
| 100 | 1 | |a Barbanel, Julius B. |d 1951- | |
| 245 | 1 | 4 | |a The geometry of efficient fair division |c Julius B. Barbanel ; with an introduction by Alan D. Taylor |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2005 | |
| 300 | |a 1 Online-Ressource (ix, 462 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 520 | |a What is the best way to divide a 'cake' and allocate the pieces among some finite collection of players? In this book, the cake is a measure space, and each player uses a countably additive, non-atomic probability measure to evaluate the size of the pieces of cake, with different players generally using different measures. The author investigates efficiency properties (is there another partition that would make everyone at least as happy, and would make at least one player happier, than the present partition?) and fairness properties (do all players think that their piece is at least as large as every other player's piece?). He focuses exclusively on abstract existence results rather than algorithms, and on the geometric objects that arise naturally in this context. By examining the shape of these objects and the relationship between them, he demonstrates results concerning the existence of efficient and fair partitions. | ||
| 700 | 1 | |a Taylor, Alan D. |d 1947- | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521842488 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9780511546679 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Record in the Search Index
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9780511546679 |
|---|---|
| _version_ | 1827038450780471296 |
| adam_text | |
| any_adam_object | |
| author | Barbanel, Julius B. 1951- |
| author2 | Taylor, Alan D. 1947- |
| author2_role | |
| author2_variant | a d t ad adt |
| author_facet | Barbanel, Julius B. 1951- Taylor, Alan D. 1947- |
| author_role | |
| author_sort | Barbanel, Julius B. 1951- |
| author_variant | j b b jb jbb |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01711nam a2200253 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9780511546679</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20160428132237.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">090508s2005||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511546679</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Barbanel, Julius B.</subfield><subfield code="d">1951-</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The geometry of efficient fair division</subfield><subfield code="c">Julius B. Barbanel ; with an introduction by Alan D. Taylor</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (ix, 462 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">What is the best way to divide a 'cake' and allocate the pieces among some finite collection of players? In this book, the cake is a measure space, and each player uses a countably additive, non-atomic probability measure to evaluate the size of the pieces of cake, with different players generally using different measures. The author investigates efficiency properties (is there another partition that would make everyone at least as happy, and would make at least one player happier, than the present partition?) and fairness properties (do all players think that their piece is at least as large as every other player's piece?). He focuses exclusively on abstract existence results rather than algorithms, and on the geometric objects that arise naturally in this context. By examining the shape of these objects and the relationship between them, he demonstrates results concerning the existence of efficient and fair partitions.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Taylor, Alan D.</subfield><subfield code="d">1947-</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521842488</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9780511546679</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9780511546679 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-19T15:54:05Z |
| institution | BVB |
| isbn | 9780511546679 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (ix, 462 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Barbanel, Julius B. 1951- The geometry of efficient fair division Julius B. Barbanel ; with an introduction by Alan D. Taylor Cambridge Cambridge University Press 2005 1 Online-Ressource (ix, 462 Seiten) txt c cr What is the best way to divide a 'cake' and allocate the pieces among some finite collection of players? In this book, the cake is a measure space, and each player uses a countably additive, non-atomic probability measure to evaluate the size of the pieces of cake, with different players generally using different measures. The author investigates efficiency properties (is there another partition that would make everyone at least as happy, and would make at least one player happier, than the present partition?) and fairness properties (do all players think that their piece is at least as large as every other player's piece?). He focuses exclusively on abstract existence results rather than algorithms, and on the geometric objects that arise naturally in this context. By examining the shape of these objects and the relationship between them, he demonstrates results concerning the existence of efficient and fair partitions. Taylor, Alan D. 1947- Erscheint auch als Druck-Ausgabe 9780521842488 |
| spellingShingle | Barbanel, Julius B. 1951- The geometry of efficient fair division |
| title | The geometry of efficient fair division |
| title_auth | The geometry of efficient fair division |
| title_exact_search | The geometry of efficient fair division |
| title_full | The geometry of efficient fair division Julius B. Barbanel ; with an introduction by Alan D. Taylor |
| title_fullStr | The geometry of efficient fair division Julius B. Barbanel ; with an introduction by Alan D. Taylor |
| title_full_unstemmed | The geometry of efficient fair division Julius B. Barbanel ; with an introduction by Alan D. Taylor |
| title_short | The geometry of efficient fair division |
| title_sort | geometry of efficient fair division |
| work_keys_str_mv | AT barbaneljuliusb thegeometryofefficientfairdivision AT tayloraland thegeometryofefficientfairdivision AT barbaneljuliusb geometryofefficientfairdivision AT tayloraland geometryofefficientfairdivision |