Mark-Choose-Cut Algorithms For Fair And Strongly Fair Division

Harunor Shishido () and Dao-Zhi Zeng ()
Additional contact information
Harunor Shishido: Kagawa University, cKagawa

Group Decision and Negotiation, 1999, vol. 8, issue 2, No 3, 125-137

Abstract: 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.

Keywords: entitlement sequence; mark-choose-cut algorithm; (strongly) fair cake division (search for similar items in EconPapers)
Date: 1999
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1023/A:1008620404353 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:grdene:v:8:y:1999:i:2:d:10.1023_a:1008620404353

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10726/PS2

DOI: 10.1023/A:1008620404353

Access Statistics for this article

Group Decision and Negotiation is currently edited by Gregory E. Kersten

More articles in Group Decision and Negotiation from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().