{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:59:53Z","timestamp":1725515993794},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688655"},{"type":"electronic","value":"9783540688808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_16","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:59Z","timestamp":1217486279000},"page":"155-164","source":"Crossref","is-referenced-by-count":4,"title":["Confidently Cutting a Cake into Approximately Fair Pieces"],"prefix":"10.1007","author":[{"given":"Jeff","family":"Edmonds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaisingh","family":"Solanki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/BFb0029569","volume-title":"Online Algorithms - The State of the Art","author":"Y. Azar","year":"1998","unstructured":"Azar, Y.: On-line Load Balancing. In: Online Algorithms - The State of the Art, pp. 178\u2013195. Springer, Heidelberg (1998)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"2000","unstructured":"Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced Allocations. SIAM Journal of Computing\u00a029, 180\u2013200 (2000)","journal-title":"SIAM Journal of Computing"},{"key":"16_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair Division \u2013 From cake cutting to dispute resolution","author":"S.J. Brams","year":"1996","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division \u2013 From cake cutting to dispute resolution. Cambridge University Press, Cambridge (1996)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Edmonds, J., Pruhs, K.: Cake cutting really isn\u2019t a piece of cake. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006) (2006)","DOI":"10.1145\/1109557.1109588"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Edmonds, J., Pruhs, K.: Balanced Allocations of Cake. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 623\u2013634 (2006)","DOI":"10.1109\/FOCS.2006.17"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0166-218X(84)90005-2","volume":"7","author":"S. Even","year":"1984","unstructured":"Even, S., Paz, A.: A note on cake cutting. Discrete Applied Mathematics\u00a07, 285\u2013296 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1007\/3-540-36494-3_52","volume-title":"STACS 2003","author":"M. Magdon-Ismail","year":"2003","unstructured":"Magdon-Ismail, M., Busch, C., Krishnamoorthy, M.S.: Cake cutting is not a piece of cake. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 596\u2013607. Springer, Heidelberg (2003)"},{"key":"16_CR8","volume-title":"Handbook of Randomized Computing","author":"M. Mitzenmacher","year":"2000","unstructured":"Mitzenmacher, M., Richa, A., Sitaraman, R.: The power of two random choices: A survey of the techniques and results. In: Pardalos, P., Rajasekaran, S., Rolim, J. (eds.) Handbook of Randomized Computing, Kluwer, Dordrecht (2000)"},{"key":"16_CR9","volume-title":"Urn Models and Their Application","author":"N. Johnson","year":"1977","unstructured":"Johnson, N., Kotz, S.: Urn Models and Their Application. John Wiley and Sons, Chichester (1977)"},{"key":"16_CR10","unstructured":"Krumke, S.O., Lipmann, M., de Paepe, W., Poensgen, D., Rambau, J., Stougie, L., Woeginger, G.J.: How to cut a cake almost fairly. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 263\u2013264 (2002)"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/0097-3165(95)90073-X","volume":"72","author":"J.M. Robertson","year":"1995","unstructured":"Robertson, J.M., Webb, W.A.: Approximating fair division with a limited number of cuts. Journal of Combinatorial Theory, Series A\u00a072, 340\u2013344 (1995)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Robertson, J.M., Webb, W.A.: Cake-cutting algorithms: Be fair if you can. A.K. Peters Ltd. (1998)","DOI":"10.1201\/9781439863855"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/978-3-540-39658-1_42","volume-title":"Algorithms - ESA 2003","author":"J. Sgall","year":"2003","unstructured":"Sgall, J., Woeginger, G.J.: A Lower Bound for Cake Cutting. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 459\u2013469. Springer, Heidelberg (2003)"},{"key":"16_CR14","first-page":"101","volume":"16","author":"H. Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica\u00a016, 101\u2013104 (1948)","journal-title":"Econometrica"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1007\/3-540-45749-6_77","volume-title":"Algorithms - ESA 2002","author":"G.J. Woeginger","year":"2002","unstructured":"Woeginger, G.J.: An approximation scheme for cake division with a linear number of cuts. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 896\u2013901. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:17:00Z","timestamp":1620015420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}