{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T00:27:52Z","timestamp":1781310472550,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T00:00:00Z","timestamp":1594598400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["SERB - SB\/S2\/RJN- 128\/2015"],"award-info":[{"award-number":["SERB - SB\/S2\/RJN- 128\/2015"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,13]]},"DOI":"10.1145\/3391403.3399512","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T16:00:25Z","timestamp":1594310425000},"page":"401-437","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Fair Cake Division Under Monotone Likelihood Ratios"],"prefix":"10.1145","author":[{"given":"Siddharth","family":"Barman","sequence":"first","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nidhi","family":"Rathi","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3298239.3298288"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(87)90055-7"},{"key":"e_1_3_2_1_3_1","volume-title":"Fair and Efficient Cake Division with Connected Pieces. In International Conference on Web and Internet Economics. Springer, 57--70","author":"Arunachaleswaran Eshwar Ram","year":"2019","unstructured":"Eshwar Ram Arunachaleswaran , Siddharth Barman , Rachitesh Kumar , and Nidhi Rathi . 2019 . Fair and Efficient Cake Division with Connected Pieces. In International Conference on Web and Internet Economics. Springer, 57--70 . Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, and Nidhi Rathi. 2019. Fair and Efficient Cake Division with Connected Pieces. In International Conference on Web and Internet Economics. Springer, 57--70."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems. International Foundation for Autonomous Agents and Multiagent Systems, 343--350","author":"Aumann Yonatan","year":"2013","unstructured":"Yonatan Aumann , Yair Dombb , and Avinatan Hassidim . 2013 . Computing socially-efficient cake divisions . In Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems. International Foundation for Autonomous Agents and Multiagent Systems, 343--350 . Yonatan Aumann, Yair Dombb, and Avinatan Hassidim. 2013. Computing socially-efficient cake divisions. In Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems. International Foundation for Autonomous Agents and Multiagent Systems, 343--350."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.52"},{"key":"e_1_3_2_1_6_1","volume-title":"Twenty-sixth AAAI Conference on Artificial Intelligence.","author":"Bei Xiaohui","year":"2012","unstructured":"Xiaohui Bei , Ning Chen , Xia Hua , Biaoshuai Tao , and Endong Yang . 2012 . Optimal proportional cake cutting with connected pieces . In Twenty-sixth AAAI Conference on Artificial Intelligence. Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, and Endong Yang. 2012. Optimal proportional cake cutting with connected pieces. In Twenty-sixth AAAI Conference on Artificial Intelligence."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1995.11990526"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975"},{"key":"e_1_3_2_1_9_1","volume-title":"Statistical inference","author":"Casella George","unstructured":"George Casella and Roger L Berger . 2002. Statistical inference . Vol. 2 . Duxbury Pacific Grove , CA. George Casella and Roger L Berger. 2002. Statistical inference. Vol. 2. Duxbury Pacific Grove, CA."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2012.08.001"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.10.009"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2900423.2900523"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2448473.2448478"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1961.11989615"},{"key":"e_1_3_2_1_15_1","unstructured":"Duncan K Foley. 1967. Resource allocation and the public sector. (1967).  Duncan K Foley. 1967. Resource allocation and the public sector. (1967)."},{"key":"e_1_3_2_1_16_1","unstructured":"George Gamow and Marvin Stern. 1958. Puzzle-Math.  George Gamow and Marvin Stern. 1958. Puzzle-Math."},{"key":"e_1_3_2_1_17_1","volume-title":"Geometric algorithms and combinatorial optimization","author":"Gr\u00f6tschel Martin","unstructured":"Martin Gr\u00f6tschel , L\u00e1szl\u00f3 Lov\u00e1sz , and Alexander Schrijver . 2012. Geometric algorithms and combinatorial optimization . Vol. 2 . Springer Science & Business Media . Martin Gr\u00f6tschel, L\u00e1szl\u00f3 Lov\u00e1sz, and Alexander Schrijver. 2012. Geometric algorithms and combinatorial optimization. Vol. 2. Springer Science & Business Media."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"A Hollender PW Goldberg and W Suksompong. 2019. Contiguous cake cutting: Hardness results and approximation algorithms. (2019).  A Hollender PW Goldberg and W Suksompong. 2019. Contiguous cake cutting: Hardness results and approximation algorithms. (2019).","DOI":"10.1613\/jair.1.12222"},{"key":"e_1_3_2_1_19_1","volume-title":"Applications of likelihood ratio orderings in economics. Lecture Notes-Monograph Series (1991), 174--189","author":"Jewitt Ian","unstructured":"Ian Jewitt . 1991. Applications of likelihood ratio orderings in economics. Lecture Notes-Monograph Series (1991), 174--189 . Ian Jewitt. 1991. Applications of likelihood ratio orderings in economics. Lecture Notes-Monograph Series (1991), 174--189."},{"key":"e_1_3_2_1_20_1","volume-title":"The Nash social welfare function. Econometrica: Journal of the Econometric Society","author":"Kaneko Mamoru","year":"1979","unstructured":"Mamoru Kaneko and Kenjiro Nakamura . 1979. The Nash social welfare function. Econometrica: Journal of the Econometric Society ( 1979 ), 423--435. Mamoru Kaneko and Kenjiro Nakamura. 1979. The Nash social welfare function. Econometrica: Journal of the Econometric Society (1979), 423--435."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2891460.2891537"},{"key":"e_1_3_2_1_22_1","unstructured":"Richard J Larsen Morris L Marx etal 2001. An introduction to mathematical statistics and its applications. Vol. 5. Prentice Hall Upper Saddle River NJ.  Richard J Larsen Morris L Marx et al. 2001. An introduction to mathematical statistics and its applications. Vol. 5. Prentice Hall Upper Saddle River NJ."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988792"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16170-4_25"},{"key":"e_1_3_2_1_25_1","volume-title":"Fair division and collective welfare","author":"Moulin Herv\u00e9","unstructured":"Herv\u00e9 Moulin . 2004. Fair division and collective welfare . MIT press . Herv\u00e9 Moulin. 2004. Fair division and collective welfare. MIT press."},{"key":"e_1_3_2_1_26_1","volume-title":"The bargaining problem. Econometrica: Journal of the Econometric Society","author":"Nash John F","year":"1950","unstructured":"John F Nash Jr . 1950. The bargaining problem. Econometrica: Journal of the Econometric Society ( 1950 ), 155--162. John F Nash Jr. 1950. The bargaining problem. Econometrica: Journal of the Econometric Society (1950), 155--162."},{"key":"e_1_3_2_1_27_1","volume-title":"Handbook of Computational Social Choice","author":"Procaccia Ariel D","unstructured":"Ariel D Procaccia . 2015. Cake cutting algorithms . In Handbook of Computational Social Choice , chapter 13. Citeseer . Ariel D Procaccia. 2015. Cake cutting algorithms. In Handbook of Computational Social Choice, chapter 13. Citeseer."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Jack Robertson and William Webb. 1998. Cake-cutting algorithms: Be fair if you can. AK Peters\/CRC Press.  Jack Robertson and William Webb. 1998. Cake-cutting algorithms: Be fair if you can. AK Peters\/CRC Press.","DOI":"10.1201\/9781439863855"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/14-SS107"},{"key":"e_1_3_2_1_30_1","unstructured":"FW Simmons. 1980. Private communication to Michael Starbird. (1980).  FW Simmons. 1980. Private communication to Michael Starbird. (1980)."},{"key":"e_1_3_2_1_31_1","first-page":"101","article-title":"The Problem of Fair Division","volume":"16","author":"Steinhaus Hugo","year":"1948","unstructured":"Hugo Steinhaus . 1948 . The Problem of Fair Division . Econometrica 16 (1948), 101 -- 104 . Hugo Steinhaus. 1948. The Problem of Fair Division. Econometrica 16 (1948), 101--104.","journal-title":"Econometrica"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1980.11995109"},{"key":"e_1_3_2_1_33_1","volume-title":"Envy-free cake divisions cannot be found by finite protocols. the electronic journal of combinatorics 15, 1","author":"Stromquist Walter","year":"2008","unstructured":"Walter Stromquist . 2008. Envy-free cake divisions cannot be found by finite protocols. the electronic journal of combinatorics 15, 1 ( 2008 ), 11. Walter Stromquist. 2008. Envy-free cake divisions cannot be found by finite protocols. the electronic journal of combinatorics 15, 1 (2008), 11."},{"key":"e_1_3_2_1_34_1","volume-title":"Rental harmony: Sperner's lemma in fair division. The American mathematical monthly 106, 10","author":"Francis Edward Su.","year":"1999","unstructured":"Francis Edward Su. 1999. Rental harmony: Sperner's lemma in fair division. The American mathematical monthly 106, 10 ( 1999 ), 930--942. Francis Edward Su. 1999. Rental harmony: Sperner's lemma in fair division. The American mathematical monthly 106, 10 (1999), 930--942."},{"key":"e_1_3_2_1_35_1","volume-title":"Cake Cutting with Single-Peaked Valuations. In International Conference on Combinatorial Optimization and Applications. Springer, 507--516","author":"Wang Chenhao","year":"2019","unstructured":"Chenhao Wang and Xiaoying Wu . 2019 . Cake Cutting with Single-Peaked Valuations. In International Conference on Combinatorial Optimization and Applications. Springer, 507--516 . Chenhao Wang and Xiaoying Wu. 2019. Cake Cutting with Single-Peaked Valuations. In International Conference on Combinatorial Optimization and Applications. Springer, 507--516."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4068(85)90023-0"}],"event":{"name":"EC '20: The 21st ACM Conference on Economics and Computation","location":"Virtual Event Hungary","acronym":"EC '20","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 21st ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3391403.3399512","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3391403.3399512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:40Z","timestamp":1750200100000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3391403.3399512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,13]]},"references-count":36,"alternative-id":["10.1145\/3391403.3399512","10.1145\/3391403"],"URL":"https:\/\/doi.org\/10.1145\/3391403.3399512","relation":{},"subject":[],"published":{"date-parts":[[2020,7,13]]},"assertion":[{"value":"2020-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}