Open AccessJournal Article
Near Exact and Envy Free Cake Division.
Reads0
Chats0
About:
This article is published in Ars Combinatoria.The article was published on 1997-01-01 and is currently open access. It has received 35 citations till now. The article focuses on the topics: Division (mathematics).read more
Citations
More filters
Proceedings ArticleDOI
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents
Haris Aziz,Simon Mackenzie +1 more
TL;DR: In this paper, a discrete and bounded envy-free protocol for any number of agents is proposed, and the maximum number of queries required by the protocol is nnnnnn. Even if we do not run our protocol to completion, it can find in at most nn+1 queries an envy free partial allocation of the cake in which each agent gets at least 1/n of the value of the whole cake.
Proceedings Article
Optimal envy-free cake cutting
TL;DR: This work considers the problem of fairly dividing a heterogeneous divisible good among agents with different preferences and provides tractable algorithms for doing so under different assumptions regarding the preferences of the agents.
Journal ArticleDOI
Cake division with minimal cuts: Envy-free procedures for three persons, four persons, and beyond
TL;DR: The minimal number of parallel cuts required to divide a cake into n pieces is n-1, and a new 3- person procedure is given that produces an envy- free division, whereby each person thinks he or she receives at least a tied- for- largest piece.
Proceedings ArticleDOI
A discrete and bounded envy-free cake cutting protocol for four agents
Haris Aziz,Simon Mackenzie +1 more
TL;DR: This work considers the well-studied cake cutting problem in which the goal is to identify an envy-free allocation based on a minimal number of queries from the agents and proposes a discrete and bounded envy- free protocol for four agents.