Cake-cutting algorithms : be fair if you can

著者

書誌事項

Cake-cutting algorithms : be fair if you can

Jack Robertson, William Webb

A.K. Peters, c1998

大学図書館所蔵 件 / 13

この図書・雑誌をさがす

注記

Includes bibliographical references (p. 173-177) and index

内容説明・目次

内容説明

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.

「Nielsen BookData」 より

詳細情報

  • NII書誌ID(NCID)
    BA41530778
  • ISBN
    • 1568810768
  • LCCN
    97041258
  • 出版国コード
    us
  • タイトル言語コード
    eng
  • 本文言語コード
    eng
  • 出版地
    Natick, Mass.
  • ページ数/冊数
    x, 181 p.
  • 大きさ
    24 cm
  • 分類
  • 件名
ページトップへ