Andere Kunden interessierten sich auch für
![Polynomial algorithms of rectangular cutting]( "Polynomial algorithms of rectangular cutting")
Polynomial algorithms of rectangular cutting16,99 €![A First Course in Discrete Mathematics]( "A First Course in Discrete Mathematics")
A First Course in Discrete Mathematics29,99 €![Moving Finite Element Method]( "Moving Finite Element Method")
Moving Finite Element Method191,99 €![Maximal Lattice-Free Polyhedra in Mixed-Integer Cutting Plane Theory]( "Maximal Lattice-Free Polyhedra in Mixed-Integer Cutting Plane Theory")
Maximal Lattice-Free Polyhedra in Mixed-Integer Cutting Plane Theory27,25 €![Inference and Asymptotics]( "Inference and Asymptotics")
Inference and Asymptotics59,99 €![Density Estimation for Statistics and Data Analysis]( "Density Estimation for Statistics and Data Analysis")
Density Estimation for Statistics and Data Analysis111,99 €![Thermal Analysis of Fair Scheduling in Real-time Embedded Systems]( "Thermal Analysis of Fair Scheduling in Real-time Embedded Systems")
Thermal Analysis of Fair Scheduling in Real-time Embedded Systems29,99 €
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.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
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.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.