{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T01:05:08Z","timestamp":1775523908473,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"New Generation of Artificial Intelligence","award":["2018AAA0100903"],"award-info":[{"award-number":["2018AAA0100903"]}]},{"name":"Innovation Program of Shanghai Municipal Education Commission"},{"name":"NSFC","award":["61922052&61932002"],"award-info":[{"award-number":["61922052&61932002"]}]},{"name":"Aly Kaufman Fellowship"},{"name":"Program for Innovative Research Team of Shanghai University of Finance and Economics"},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467555","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:50Z","timestamp":1626604130000},"page":"630-631","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["An Algorithmic Framework for Approximating Maximin Share Allocation of Chores"],"prefix":"10.1145","author":[{"given":"Xin","family":"Huang","sequence":"first","affiliation":[{"name":"Technion-Israel Institute of Technology, Haifa, Israel"}]},{"given":"Pinyan","family":"Lu","sequence":"additional","affiliation":[{"name":"Shanghai University of Finance and Economics, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147173"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11590"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.52"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/3298239.3298291"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90018-5"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085136"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219176"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA14564"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-015-9287-3"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1086\/664613"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329574"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940726"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399511"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.162"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1625275.1625476"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175469"},{"key":"e_1_3_2_1_21_1","unstructured":"D\u00f3sa G. The tight bound of first fit decreasing bin-packing algorithm is $FFD (I)\u0142e 11\/9OPT (I)  D\u00f3sa G. The tight bound of first fit decreasing bin-packing algorithm is $FFD (I)\u0142e 11\/9OPT (I)"},{"key":"e_1_3_2_1_22_1","first-page":"1","volume-title":"International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","year":"2007","unstructured":"6\/9$. In International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies ( 2007 ), Springer , pp. 1 -- 11 . 6\/9$. In International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (2007), Springer, pp. 1--11."},{"key":"e_1_3_2_1_23_1","first-page":"45","article-title":"Resource allocation and the public sector","volume":"7","author":"Foley D","year":"1967","unstructured":"Foley , D . Resource allocation and the public sector . Yale Economic Essays 7 ( 1967 ), 45 -- 98 . Foley, D. Resource allocation and the public sector. Yale Economic Essays 7 (1967), 45--98.","journal-title":"Yale Economic Essays"},{"key":"e_1_3_2_1_24_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"Garey , M. R. , and Johnson , D. S . Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman , 1979 . Garey, M. R., and Johnson, D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979."},{"key":"e_1_3_2_1_25_1","volume-title":"2nd Symposium on Simplicity in Algorithms, SOSA@SODA 2019","volume":"69","author":"Garg J.","year":"2019","unstructured":"Garg , J. , McGlaughlin , P. , and Taki , S . Approximating maximin share allocations . In 2nd Symposium on Simplicity in Algorithms, SOSA@SODA 2019 , January 8 --9 , 2019 - San Diego, CA, USA (2019), J. T. Fineman and M. Mitzenmacher, Eds., vol. 69 of OASICS, Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, pp. 20:1--20:11. Garg, J., McGlaughlin, P., and Taki, S. Approximating maximin share allocations. In 2nd Symposium on Simplicity in Algorithms, SOSA@SODA 2019, January 8--9, 2019 - San Diego, CA, USA (2019), J. T. Fineman and M. Mitzenmacher, Eds., vol. 69 of OASICS, Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, pp. 20:1--20:11."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399526"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219238"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"e_1_3_2_1_29_1","series-title":"SIAM journal on Applied Mathematics 17, 2","volume-title":"Bounds on multiprocessing timing anomalies","author":"Graham R. L.","year":"1969","unstructured":"Graham , R. L. Bounds on multiprocessing timing anomalies . SIAM journal on Applied Mathematics 17, 2 ( 1969 ), 416--429. Graham, R. L. Bounds on multiprocessing timing anomalies. SIAM journal on Applied Mathematics 17, 2 (1969), 416--429."},{"key":"e_1_3_2_1_30_1","volume-title":"Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of the ACM (JACM) 34, 1","author":"Hochbaum D. S.","year":"1987","unstructured":"Hochbaum , D. S. , and Shmoys , D. B . Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of the ACM (JACM) 34, 1 ( 1987 ), 144--162. Hochbaum, D. S., and Shmoys, D. B. Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of the ACM (JACM) 34, 1 (1987), 144--162."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/090749451"},{"key":"e_1_3_2_1_32_1","volume-title":"43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)","author":"Jansen K.","year":"2016","unstructured":"Jansen , K. , Klein , K.-M. , and Verschae , J . Closing the gap for makespan scheduling via sparsification techniques. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) ( 2016 ), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Jansen, K., Klein, K.-M., and Verschae, J. Closing the gap for makespan scheduling via sparsification techniques. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (2016), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(85)90022-6"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140756"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988792"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2954.001.0001"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.09.010"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175470"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781439863855"},{"key":"e_1_3_2_1_41_1","first-page":"1","article-title":"The problem of fair division","volume":"16","author":"Steinhaus H","year":"1948","unstructured":"Steinhaus , H . The problem of fair division . Econometrica 16 , 1 ( 1948 ), 101--104. Steinhaus, H. The problem of fair division. Econometrica 16, 1 (1948), 101--104.","journal-title":"Econometrica"},{"key":"e_1_3_2_1_42_1","volume-title":"A simple proof of the inequality FFD(L)\u0142e 11\/9 OPT(L), forall L for the FFD bin-packing algorithm. Acta mathematicae applicatae sinica 7, 4","author":"Yue M.","year":"1991","unstructured":"Yue , M. A simple proof of the inequality FFD(L)\u0142e 11\/9 OPT(L), forall L for the FFD bin-packing algorithm. Acta mathematicae applicatae sinica 7, 4 ( 1991 ), 321--331. Yue, M. A simple proof of the inequality FFD(L)\u0142e 11\/9 OPT(L), forall L for the FFD bin-packing algorithm. Acta mathematicae applicatae sinica 7, 4 (1991), 321--331."}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","location":"Budapest Hungary","acronym":"EC '21","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467555","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467555","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:31Z","timestamp":1750191511000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467555"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":41,"alternative-id":["10.1145\/3465456.3467555","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467555","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}