Efficient cake-cutting

Known as: Cake-cutting 
Efficient cake-cutting is a problem in economics and computer science. It involves a heterogenous resource, such as a cake with different toppings or… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The classic fair cake-cutting problem [Steinhaus, 1948] is extended by introducing geometric constraints on the allocated pieces… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2013
Highly Cited
2013
How to fairly allocate divisible resources, and why computer scientists should take notice. 
Is this relevant?
2013
2013
The cake cutting problem models the fair division of a heterogeneous good between multiple agents. Previous work assumes that… (More)
Is this relevant?
2012
2012
We characterize methods of dividing a cake between two bidders in a way that is incentive-compatible and Pareto-efficient. In our… (More)
  • figure 2
Is this relevant?
2012
2012
We study the problem of finding an envy-free allocation of a cake to d+1 players using d cuts. Two models are considered, namely… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
We consider the problem of fairly dividing a heterogeneous divisible good among agents with different preferences. Previous work… (More)
  • figure 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1996
Highly Cited
1996
From Cake-Cutting to Dispute Resolution Steven J. Brams and Alan D. Taylor ... explains everything a layperson might need to know… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
The algorithmic aspects of the following problem are investigated: n (22) persons want to cut a cake into n shares so that every… (More)
Is this relevant?