Cake-Cutting Algorithms (PDF)
Be Fair if You Can
(Sprache: Englisch)
The challenge of dividing an asset fairly, from cakes to more important properties, is of great practical importance in many situations. Since the famous Polish school of mathematicians (Steinhaus, Banach, and Knaster) introduced and described algorithms...
sofort als Download lieferbar
eBook (pdf)
235.99 €
117 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Cake-Cutting Algorithms (PDF)“
The challenge of dividing an asset fairly, from cakes to more important properties, is of great practical importance in many situations. Since the famous Polish school of mathematicians (Steinhaus, Banach, and Knaster) introduced and described algorithms for the fair division problem in the 1940s, the concept has been widely popularized.
This book gathers into one readable and inclusive source a comprehensive discussion of the state of the art in cake-cutting problems for both the novice and the professional. It offers a complete treatment of all cake-cutting algorithms under all the considered definitions of "fair" and presents them in a coherent, reader-friendly manner. Robertson and Webb have brought this elegant problem to life for both the bright high school student and the professional researcher.
Bibliographische Angaben
- Autoren: Jack Robertson , William Webb
- 1998, 177 Seiten, Englisch
- Verlag: Taylor & Francis
- ISBN-10: 1439863857
- ISBN-13: 9781439863855
- Erscheinungsdatum: 15.07.1998
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Größe: 13 MB
- Ohne Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kommentar zu "Cake-Cutting Algorithms"
0 Gebrauchte Artikel zu „Cake-Cutting Algorithms“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Cake-Cutting Algorithms".
Kommentar verfassen