{"title":"Guest Column: The Muffin Problem","authors":"W. Gasarch, S. Huddleston, Erik Metz, Jacob Prinz","doi":"10.1145/3351452.3351462","DOIUrl":null,"url":null,"abstract":"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 m s muffins and the minimum piece is maximized. Let f(m; s) be the minimum piece in the optimal protocol. We present, by examples, several methods to obtain upper and lower bounds on f(m; s).","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3351452.3351462","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
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 m s muffins and the minimum piece is maximized. Let f(m; s) be the minimum piece in the optimal protocol. We present, by examples, several methods to obtain upper and lower bounds on f(m; s).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
