{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T02:49:35Z","timestamp":1781664575679,"version":"3.54.5"},"reference-count":16,"publisher":"Informa UK Limited","issue":"1","funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["The American Mathematical Monthly"],"published-print":{"date-parts":[[2021,1,2]]},"DOI":"10.1080\/00029890.2021.1835338","type":"journal-article","created":{"date-parts":[[2021,1,15]],"date-time":"2021-01-15T05:00:46Z","timestamp":1610686846000},"page":"79-83","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":11,"title":["How to Cut a Cake Fairly: A Generalization to Groups"],"prefix":"10.1080","volume":"128","author":[{"given":"Erel","family":"Segal-Halevi","sequence":"first","affiliation":[{"name":"Department of Computer Science, Ariel University","place":["Ariel, Israel"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Warut","family":"Suksompong","sequence":"additional","affiliation":[{"name":"School of Computing, National University of Singapore","place":["Singapore"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2021,1,15]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2014.06.006"},{"key":"e_1_3_3_3_1","unstructured":"Bade S. Segal-Halevi E. (2018). Fair and efficient division among families. arxiv.org\/abs\/1811.06684"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35311-6_12"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.2307\/2311357"},{"key":"e_1_3_3_7_1","doi-asserted-by":"crossref","unstructured":"Goldberg P. W. Hollender A. Suksompong W. (2019). Contiguous cake cutting: Hardness results and approximation algorithms. arxiv.org\/abs\/1911.05416","DOI":"10.1613\/jair.1.12222"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04651-4_39"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/57"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1192548"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781439863855"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-019-01210-9"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.103167"},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1980.11995109"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.37236\/735"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.2307\/2589747"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(80)90225-5"}],"container-title":["The American Mathematical Monthly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00029890.2021.1835338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T16:28:02Z","timestamp":1769704082000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00029890.2021.1835338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,2]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1,2]]}},"alternative-id":["10.1080\/00029890.2021.1835338"],"URL":"https:\/\/doi.org\/10.1080\/00029890.2021.1835338","relation":{},"ISSN":["0002-9890","1930-0972"],"issn-type":[{"value":"0002-9890","type":"print"},{"value":"1930-0972","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,2]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uamm20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uamm20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2020-01-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-31","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-31","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}