{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T13:23:57Z","timestamp":1778765037696,"version":"3.51.4"},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5951,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0166-218x(96)00032-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"183-190","source":"Crossref","is-referenced-by-count":8,"title":["How to cut a cake fairly using a minimal number of cuts"],"prefix":"10.1016","volume":"74","author":[{"given":"William A.","family":"Webb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"437","key":"10.1016\/S0166-218X(96)00032-7_BIB1","doi-asserted-by":"crossref","first-page":"212","DOI":"10.2307\/3616548","article-title":"Sharing a cake","volume":"66","author":"Austin","year":"1982","journal-title":"Math. Gaz."},{"key":"10.1016\/S0166-218X(96)00032-7_BIB2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.2307\/2322417","article-title":"Constructing a fair border","volume":"94","author":"Beck","year":"1987","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB3","series-title":"The Apportionment Problem","author":"Bennett","year":"1986"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2974850","article-title":"An envy-free cake division protocol","volume":"102","author":"Brams","year":"1995","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB5","unstructured":"S.J. Brams and A.D. Taylor, A note on envy-free cake division, J. Combin. Theory Ser. A, to appear."},{"key":"10.1016\/S0166-218X(96)00032-7_BIB6","doi-asserted-by":"crossref","unstructured":"S.J. Brams and A.D. Taylor, Fair Division: Procedures for Allocating Divisible and Indivisible Goods, to appear.","DOI":"10.1017\/CBO9780511598975"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB7","doi-asserted-by":"crossref","unstructured":"S.J. Brams, A.D. Taylor and W.S. Zwicker, Old and new moving-knife schemes, Math. Intelligencer, to appear.","DOI":"10.1007\/BF03024785"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB8","unstructured":"S.J. Brams, A.D. Taylor and W.S. Zwicker, A moving-knife solution to the four-person envy-free cake division problem, preprint."},{"key":"10.1016\/S0166-218X(96)00032-7_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2311357","article-title":"How to cut a cake fairly","volume":"68","author":"Dubins","year":"1961","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0166-218X(84)90005-2","article-title":"A note on cake cutting","volume":"7","author":"Even","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00032-7_BIB11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.2307\/2689255","article-title":"A note on the fair division problem","author":"Fink","year":"1964","journal-title":"Math. Mag."},{"issue":"1","key":"10.1016\/S0166-218X(96)00032-7_BIB12","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF03025257","article-title":"Mathematical entertainments","volume":"15","author":"Gale","year":"1993","journal-title":"Math. Intelligencer"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB13","first-page":"123","article-title":"Aha! Insight","author":"Gardner","year":"1978"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB14","doi-asserted-by":"crossref","first-page":"438","DOI":"10.2307\/2975720","article-title":"Determining a fair border","volume":"90","author":"Hill","year":"1983","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB15","first-page":"228","article-title":"Sur le probl\u00e8me du partage pragmatique de H","volume":"19","author":"Knaster","year":"1946","journal-title":"Steinhaus Ann. Soc. Polonaise Math."},{"key":"10.1016\/S0166-218X(96)00032-7_BIB16","series-title":"Essays in Mathematical Economics in honor of Oskar Morgenstern","article-title":"On games of fair division","author":"K\u00fchn","year":"1967"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB17","series-title":"Aspects of fair division","author":"Lewis","year":"1980"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB18","unstructured":"J. Malkevitch, fair = fair Consortium."},{"issue":"2","key":"10.1016\/S0166-218X(96)00032-7_BIB19","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01204722","article-title":"Ramsey partitions of integers and fair division","volume":"12","author":"McAvaney","year":"1992","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB20","first-page":"52","article-title":"Preferred shared","author":"Olivastro","year":"1992","journal-title":"The Sciences"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB21","series-title":"Mathematical Plums","first-page":"22","article-title":"How to get (at least) a fair share of the cake","author":"Rebman","year":"1979"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB22","first-page":"191","article-title":"Minimal number of cuts for fair division","volume":"31","author":"Robertson","year":"1991","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(96)00032-7_BIB23","doi-asserted-by":"crossref","unstructured":"J.M. Robertson and W.A. Webb, Approximating fair division with a limited number of cuts, J. Combin. Theory Ser. A, to appear.","DOI":"10.1016\/0097-3165(95)90073-X"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB24","doi-asserted-by":"crossref","first-page":"391","DOI":"10.2307\/1055235","article-title":"Extensions of the classical rule \u201cDivide and Choose\u201d","volume":"28","author":"Singer","year":"1962","journal-title":"South. Econom. J."},{"key":"10.1016\/S0166-218X(96)00032-7_BIB25","series-title":"For All Practical Purposes","year":"1988"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB26","first-page":"101","article-title":"The problem of fair division","volume":"16","author":"Steinhaus","year":"1948","journal-title":"Econometrica"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB27","doi-asserted-by":"crossref","first-page":"315","DOI":"10.2307\/1907319","article-title":"Sur la division pragmatique","volume":"17","author":"Steinhaus","year":"1949","journal-title":"Econometrica (suppl.)"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB28","doi-asserted-by":"crossref","first-page":"640","DOI":"10.2307\/2320951","article-title":"How to cut a cake fairly","volume":"87","author":"Stromquist","year":"1980","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0166-218X(96)00032-7_BIB29","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0195-6698(13)80129-1","article-title":"A combinatorial algorithm to establish a fair border","volume":"11","author":"Webb","year":"1990","journal-title":"European. J. Combin."},{"key":"10.1016\/S0166-218X(96)00032-7_BIB30","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0022-247X(80)90225-5","article-title":"Dividing a cake fairly","volume":"78","author":"Woodall","year":"1980","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0166-218X(96)00032-7_BIB31","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0097-3165(86)90101-9","article-title":"A note on the cake-division problem","volume":"42","author":"Woodall","year":"1986","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000327?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000327?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T19:54:43Z","timestamp":1556394883000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0166218X96000327"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00032-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}