Книга: Robertson Jack «Cake-Cutting Algorithms: Be Fair if You Can»
|
Серия: "-" 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. Издательство: "Routledge" (1998)
Купить за 4293 руб в My-shop |
Другие книги схожей тематики:
| Автор | Книга | Описание | Год | Цена | Тип книги |
|---|
См. также в других словарях:
Fair division — Cake cutting redirects here. For the wedding tradition, see Wedding reception#Wedding cake. Fair division, also known as the cake cutting problem, is the problem of dividing a resource in such a way that all recipients believe that they have… … Wikipedia
Proportional (fair division) — Proportional division or simple fair division is the original and simplest problem in fair division. Fair division problems are also called cake cutting problems. A proportional division of a cake between N people would ensure each of them got at … Wikipedia
Divide and choose — In problems of fair division, divide and choose (also I cut, you choose) is a two party proportional envy free allocation protocol.[1] The protocol also works for dividing an undesirable, as in chore division. In the method, one person divides a… … Wikipedia
Partage équitable — En économie, mais aussi en mathématiques, et plus particulièrement en théorie des jeux, le problème du partage équitable, connu aussi sous le nom de problème de partage du gâteau (de l anglais cake cutting problem), est le problème du partage d… … Wikipédia en Français
Exact division — An exact or even division is a type of fair division where all the players believe everyone received the same amount.There is no finite procedure for exact division but there are moving knife procedures for two players. For more than two players… … Wikipedia
Chore division — In problems of fair division, a resource (prototypically a cake) is to be divided amongst a finite number of players; the resource is assumed to be desirable, and more is assumed to be better. Chore division is the dual problem of allocating an… … Wikipedia
