{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:04Z","timestamp":1750221004802,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T00:00:00Z","timestamp":1563926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2019,7,24]]},"abstract":"<jats:p>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).<\/jats:p>","DOI":"10.1145\/3351452.3351462","type":"journal-article","created":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T12:34:33Z","timestamp":1564058073000},"page":"31-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Guest Column"],"prefix":"10.1145","volume":"50","author":[{"given":"William","family":"Gasarch","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Scott","family":"Huddleston","sequence":"additional","affiliation":[{"name":", Beaverton, OR, USA"}]},{"given":"Erik","family":"Metz","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Jacob","family":"Prinz","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,7,24]]},"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3351452.3351462","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3351452.3351462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:52Z","timestamp":1750206352000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3351452.3351462"}},"subtitle":["The Muffin Problem"],"short-title":[],"issued":{"date-parts":[[2019,7,24]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,7,24]]}},"alternative-id":["10.1145\/3351452.3351462"],"URL":"https:\/\/doi.org\/10.1145\/3351452.3351462","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2019,7,24]]},"assertion":[{"value":"2019-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}