Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,329,587 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Computer science
Simmons–Su protocols
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Cutting a Cake with both Good and Bad Parts
Erel Segal-Halevi
arXiv.org
2017
Corpus ID: 16912345
There is a heterogeneous resource that contains both good parts and bad parts, for example, a cake with some parts burnt, or a…
Expand
2017
2017
WAGNER AND PETERSEN ARE UNIFORMLY MOST-RELIABLE GRAPHS
P. Romero
2017
Corpus ID: 52839755
If we are given n nodes and m links, what is the most reliable network topology? Partial answers are offered in the literature…
Expand
2016
2016
An online allocation algorithm of indivisible goods
Kohei Shimizu
,
Yoshifumi Manabe
International Conference on Information…
2016
Corpus ID: 15114103
This paper proposes a new online allocation algorithm of indivisible goods. In online algorithms, participants arrive to execute…
Expand
2015
2015
Envy-Free Cake-Cutting in Two Dimensions
Erel Segal-Halevi
,
A. Hassidim
,
Y. Aumann
AAAI Conference on Artificial Intelligence
2015
Corpus ID: 15815336
We consider the problem of fair division of a two dimensional heterogeneous good among several agents. Applications include…
Expand
2014
2014
Cake Cutting – Fair and Square
Erel Segal-Halevi
,
S. Nitzan
2014
Corpus ID: 16242268
The classic fair cake-cutting problem [Steinhaus, 1948] is extended by introducing geometric constraints on the allocated pieces…
Expand
2013
2013
A Protocol for Cutting Matroids Like Cakes
L. Gourvès
,
J. Monnot
,
Lydia Tlilane
Workshop on Internet and Network Economics
2013
Corpus ID: 13606057
We study a problem that generalizes the fair allocation of indivisible goods. The input is a matroid and a set of agents. Each…
Expand
2012
2012
Cake Cutting Mechanisms
Egor Ianovski
arXiv.org
2012
Corpus ID: 9719307
We examine the history of cake cutting mechanisms and discuss the efficiency of their allocations. In the case of piecewise…
Expand
2010
2010
Meta-Envy-Free Cake-Cutting Protocols
Yoshifumi Manabe
,
T. Okamoto
International Symposium on Mathematical…
2010
Corpus ID: 11953154
This paper discusses cake-cutting protocols when the cake is a heterogeneous good that is represented by an interval in the real…
Expand
2007
2007
Globalizing utilitarianism : distributive justice beyond the state
Helena de Bres
2007
Corpus ID: 147076242
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 2007.
2005
2005
Hardness Results for Cake Cutting
C. Busch
,
M. Krishnamoorthy
,
M. Magdon-Ismail
Bull. EATCS
2005
Corpus ID: 31050008
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE