{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:25:58Z","timestamp":1778495158507,"version":"3.51.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319131283","type":"print"},{"value":"9783319131290","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13129-0_1","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:08:41Z","timestamp":1417432121000},"page":"1-14","source":"Crossref","is-referenced-by-count":24,"title":["Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations"],"prefix":"10.1007","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s00182-010-0251-9","volume":"40","author":"S. Athanassoglou","year":"2011","unstructured":"Athanassoglou, S., Sethuraman, J.: House allocation with fractional endowments. International Journal of Game Theory\u00a040(3), 481\u2013513 (2011)","journal-title":"International Journal of Game Theory"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Aziz, H., Ye, C.: Cake cutting algorithms for piecewise constant and piecewise uniform valuations. Technical Report 1307.2908, arXiv.org (2013)","DOI":"10.1007\/978-3-319-13129-0_1"},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.econlet.2013.09.006","volume":"121","author":"H. Aziz","year":"2013","unstructured":"Aziz, H., Brandt, F., Brill, M.: The computational complexity of random serial dictatorship. Economics Letters\u00a0121(3), 341\u2013345 (2013)","journal-title":"Economics Letters"},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/jeth.2000.2710","volume":"100","author":"A. Bogomolnaia","year":"2001","unstructured":"Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. Journal of Economic Theory\u00a0100(2), 295\u2013328 (2001)","journal-title":"Journal of Economic Theory"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1111\/j.1468-0262.2004.00483.x","volume":"72","author":"A. Bogomolnaia","year":"2004","unstructured":"Bogomolnaia, A., Moulin, H.: Random matching under dichotomous preferences. Econometrica\u00a072(1), 257\u2013279 (2004)","journal-title":"Econometrica"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Brams, S.J.: Mathematics and Democracy: Designing Better Voting and Fair-Division Procedures. Princeton University Press (2008)","DOI":"10.1515\/9781400835591"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge University Press (1996)","DOI":"10.1017\/CBO9780511598975"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Feldman, M., Morgenstern, J., Lai, J.K., Procaccia, A.D.: On maxsum fair cake divisions. In: Proc. of 26th AAAI Conference, pp. 1285\u20131291. AAAI Press (2012)","DOI":"10.1609\/aaai.v26i1.8237"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Y., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Truth, justice, and cake cutting. In: Proc. of 24th AAAI Conference, pp. 756\u2013761 (2010)","DOI":"10.1609\/aaai.v24i1.7621"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.geb.2012.10.009","volume":"77","author":"Y. Chen","year":"2013","unstructured":"Chen, Y., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Truth, justice, and cake cutting. Games and Economic Behavior\u00a077(1), 284\u2013297 (2013)","journal-title":"Games and Economic Behavior"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Cohler, Y.J., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Optimal envy-free cake cutting. In: Proc. of 25th AAAI Conference, pp. 626\u2013631 (2011)","DOI":"10.1609\/aaai.v25i1.7874"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Devanur, N., Papadimitriou, C.H., Saberi, A., Vazirani, V.: Market equilibrium via a primal\u2013dual algorithm for a convex program. Journal of the ACM\u00a055(5) (2008)","DOI":"10.1145\/1411509.1411512"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.jet.2005.05.001","volume":"131","author":"A.-K. Katta","year":"2006","unstructured":"Katta, A.-K., Sethuraman, J.: A solution to the random assignment problem on the full preference domain. Journal of Economic Theory\u00a0131(1), 231\u2013250 (2006)","journal-title":"Journal of Economic Theory"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-35311-6_13","volume-title":"Internet and Network Economics","author":"A. Maya","year":"2012","unstructured":"Maya, A., Nisan, N.: Incentive compatible two player cake cutting. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol.\u00a07695, pp. 170\u2013183. Springer, Heidelberg (2012)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-16170-4_25","volume-title":"Algorithmic Game Theory","author":"E. Mossel","year":"2010","unstructured":"Mossel, E., Tamuz, O.: Truthful fair division. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol.\u00a06386, pp. 288\u2013299. Springer, Heidelberg (2010)"},{"key":"1_CR16","first-page":"291","volume":"83","author":"J.H. Reijnierse","year":"1998","unstructured":"Reijnierse, J.H., Potters, J.A.M.: On finding an envy-free Pareto-optimal division. Mathematical Programming\u00a083, 291\u2013311 (1998)","journal-title":"Mathematical Programming"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Robertson, J.M., Webb, W.A.: Cake Cutting Algorithms: Be Fair If You Can. A. K. Peters (1998)","DOI":"10.1201\/9781439863855"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-45046-4_34","volume-title":"Web and Internet Economics","author":"D. Saban","year":"2013","unstructured":"Saban, D., Sethuraman, J.: The complexity of computing the random priority allocation matrix. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol.\u00a08289, p. 421. Springer, Heidelberg (2013)"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s003550050050","volume":"14","author":"J. Schummer","year":"1997","unstructured":"Schummer, J.: Strategy-proofness versus efficiency on restricted domains of exchange economies. Social Choice and Welfare\u00a014, 47\u201356 (1997)","journal-title":"Social Choice and Welfare"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-642-45046-4_36","volume-title":"Web and Internet Economics","author":"Y. Tian","year":"2013","unstructured":"Tian, Y.: Strategy-proof and efficient offline interval scheduling and cake cutting. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol.\u00a08289, pp. 436\u2013437. Springer, Heidelberg (2013)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Zivan, R., Dud\u00edk, M., Okamoto, S., Sycara, K.: Reducing untruthful manipulation in envy-free pareto optimal resource allocation. In: IEEE\/WIC\/ACM International Conference on Web Intelligence and Intelligent Agent Technology, pp. 391\u2013398 (2010)","DOI":"10.1109\/WI-IAT.2010.37"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13129-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T10:10:46Z","timestamp":1690711846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13129-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131283","9783319131290"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13129-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}