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

Group Decision and Negotiation

Volumn 8, Issue 2, 1999, Pages 125-137

  Shishido, Harunori ^a   Zeng, Dao Zhi ^a  

^a KAGAWA UNIVERSITY   (Japan)

Author keywords

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

Indexed keywords

EID: 0033415102     PISSN: 09262644     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008620404353     Document Type: Article

References (8)

1. Barbanel, J. B. (1995). "Game-theoretic algorithms for fair and strongly fair cake division with entitlements," Colloquium Mathematicum 69, 59-73.
2. Brams, S. J. and A. D. Taylor. (1995a). "An envy-free cake division protocol," American Mathematical Monthly 102, 9-18.
3. Brams, S. J. and A. D. Taylor. (1995b). "A note on envy-free cake division," Journal of Combinatorial Theory, Series A 70, 170-173.
4. Brams, S. J. and A. D. Taylor. (1996). Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge University Press.
5. Brams, S. J., A. D. Taylor and W.S. Zwicker. (1997). "A moving-knife solution to the four-person envy-free cake division problem," Proceedings of the American Mathematical Society 125, 547-554.
6. Even S. and A. Paz. (1984). "A note on cake cutting," Discrete Applied Mathematics 7, 285-296.
7. Rockafellar R. T. (1970). Convex Analysis. Princeton University Press.
8. Woodall D. R. (1986). "A note on the cake division problem," Journal of Combinatorial Theory, Series A 42, 300-301.