2026-07-20T15:08:07Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8806 2024-03-12T11:58:04Z ddc:004 open_access

A Muffin-Theorem Generator Cui, Guangqi Dickerson, John Durvasula, Naveen Gasarch, William Metz, Erik Prinz, Jacob Raman, Naveen Smolyak, Daniel Yoo, Sung Hyun Fair Division Theorem Generation Consider the following FUN problem. Given m,s you want to divide m muffins among s students so that everyone gets m/(s) muffins; however, you want to maximize the minimum piece so that nobody gets crumbs. Let f(m,s) be the size of the smallest piece in an optimal procedure. We study the case where ceil(2m/s)=3 because (1) many of our hardest open problems were of this form until we found this method, (2) we have used the technique to generate muffin-theorems, and (3) we conjecture this can be used to solve the general case. We give (1) an algorithm to find an upper bound for f(m,s) when ceil(2m/s)(and some ways to speed up that algorithm if certain conjectures are true), (2) an algorithm that uses the information from (1) to try to find a lower bound on f(m,s) (a procedure) which matches the upper bound, (3) an algorithm that uses the information from (1) to generate muffin-theorems, and (4) an algorithm that we think works well in practice to find f(m,s) for any m,s. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Guangqi 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 2018 Is Part Of LIPIcs, Volume 100, 9th International Conference on Fun with Algorithms (FUN 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FUN.2018.15 urn:nbn:de:0030-drops-88062 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.15 eng https://creativecommons.org/licenses/by/3.0/legalcode