Mark-Choose-Cut Algorithms for Fair and Strongly Fair Division

Harunori Shishido, Dao Zhi Zeng

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

Abstract

This paper proposes a new criterion to evaluate algorithms for cake division by the number of resulting pieces. Then, inspired by the idea of "cut-and-choose", we present "mark-choose-cut" algorithms for fair and strongly fair cake division problems. They are game-theoretic algorithms. The number of resulting pieces is bounded by 2 × 3n-2 + 1 and 4 × 3n-2 + 1, for fair and strongly fair division respectively.

Original languageEnglish
Pages (from-to)125-137
Number of pages13
JournalGroup Decision and Negotiation
Volume8
Issue number2
DOIs
Publication statusPublished - 1999

Keywords

  • (Strongly) fair cake division
  • Entitlement sequence
  • Mark-choose-cut algorithm

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Arts and Humanities (miscellaneous)
  • Social Sciences(all)
  • Strategy and Management
  • Management of Technology and Innovation

Fingerprint Dive into the research topics of 'Mark-Choose-Cut Algorithms for Fair and Strongly Fair Division'. Together they form a unique fingerprint.

Cite this