Corpus ID: 119129982

The Muffin Problem

@inproceedings{Cui2017TheMP,
title={The Muffin Problem},
author={Guangiqi Cui and John Dickerson and Naveen Durvasula and William Gasarch and Erik Metz and Jacob Prinz and Naveen Raman and Daniel Smolyak and Sung Hyun Yoo},
year={2017}
}
• Guangiqi Cui, +6 authors Sung Hyun Yoo
• Published 2017
• Mathematics
• You have $m$ muffins and $s$ students. You want to divide the muffins into pieces and give the shares to students such that every student has $\frac{m}{s}$ muffins. Find a divide-and-distribute protocol that maximizes the minimum piece. Let $f(m,s)$ be the minimum piece in the optimal protocol. We prove that $f(m,s)$ exists, is rational, and finding it is computable (though possibly difficult). We show that $f(m,s)$ can be derived from $f(s,m)$; hence we need only consider $m\ge s$. We give a… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

A Muffin-Theorem Generator

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents

• Computer Science, Mathematics
• 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
• 2016
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

Cake cutting really is not a piece of cake

• Mathematics
• SODA 2006
• 2006
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

Cake-cutting algorithms - be fair if you can

• Mathematics, Computer Science
• 1998
VIEW 1 EXCERPT
HIGHLY INFLUENTIAL

Fair division - from cake-cutting to dispute resolution

• Political Science, Mathematics, Computer Science
• 1996
VIEW 1 EXCERPT
HIGHLY INFLUENTIAL

An Envy-Free Cake Division Protocol

• Mathematics
• 1995
VIEW 1 EXCERPT
HIGHLY INFLUENTIAL

A note on cake cutting

• Computer Science, Mathematics
• Discret. Appl. Math.
• 1984
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

Described to Jeremy Copeland and in the New York Times Numberplay Online Blog wordplay.blogs.nytimes.com/2013/08/19/cake

• A. Frank
• The muffin problem,
• 2013
VIEW 2 EXCERPTS