Ebook: Cake-Cutting Algorithms: Be Fair if You Can
- Tags: Mathematics & Statistics, Advanced Mathematics, Discrete Mathematics, Combinatorics
- Year: 1998
- Publisher: A K Peters/CRC Press
- City: New York
- Edition: 1
- 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
Download the book Cake-Cutting Algorithms: Be Fair if You Can for free or read online
Continue reading on any device:
Last viewed books
Related books
{related-news}
Comments (0)