Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
There is a heterogeneous resource that contains both good parts and bad parts, for example, a cake with some parts burnt, or a… 
2017
2017
If we are given n nodes and m links, what is the most reliable network topology? Partial answers are offered in the literature… 
2016
2016
This paper proposes a new online allocation algorithm of indivisible goods. In online algorithms, participants arrive to execute… 
2015
2015
We consider the problem of fair division of a two dimensional heterogeneous good among several agents. Applications include… 
2014
2014
The classic fair cake-cutting problem [Steinhaus, 1948] is extended by introducing geometric constraints on the allocated pieces… 
2013
2013
We study a problem that generalizes the fair allocation of indivisible goods. The input is a matroid and a set of agents. Each… 
2012
2012
We examine the history of cake cutting mechanisms and discuss the efficiency of their allocations. In the case of piecewise… 
2010
2010
This paper discusses cake-cutting protocols when the cake is a heterogeneous good that is represented by an interval in the real… 
2007
2007
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 2007. 
2005
2005
Fair cake-cutting is the division of a cake or resource among N users so that each user is content. Users may value a given piece…