{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:29Z","timestamp":1750306529798,"version":"3.41.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T00:00:00Z","timestamp":1418083200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2014,12,9]]},"DOI":"10.1145\/2696081.2696102","type":"journal-article","created":{"date-parts":[[2014,12,16]],"date-time":"2014-12-16T13:39:54Z","timestamp":1418737194000},"page":"105-119","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["SIGACT News Online Algorithms Column 25"],"prefix":"10.1145","volume":"45","author":[{"given":"Zhiyi","family":"Huang","sequence":"first","affiliation":[{"name":"University of Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2014,12,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.93"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095213"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374412"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496846"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339123.2339126"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/846241.846250"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.68"},{"key":"e_1_2_1_8_1","unstructured":"Niv Buchbinder and Rica Gonen. Incentive compatible multi-unit combinatorial auctions: a primal dual approach. Algorithmica (to appear).  Niv Buchbinder and Rica Gonen. Incentive compatible multi-unit combinatorial auctions: a primal dual approach. Algorithmica (to appear)."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000024"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000024"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0363"},{"key":"e_1_2_1_12_1","first-page":"253","volume-title":"Algorithms-ESA","author":"Buchbinder Niv","year":"2007"},{"volume-title":"Princeton University Press","year":"1998","author":"Dantzig George B.","key":"e_1_2_1_13_1"},{"key":"e_1_2_1_14_1","first-page":"1123","volume-title":"Proceedings of the 25th Annual Symposium on Discrete Algorithms","author":"Nikhil","year":"2014"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213992"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627824"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-642-38016-7_15","volume-title":"Approximation and Online Algorithms","author":"Gupta Anupam","year":"2013"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.6"},{"volume-title":"Univ. of Chicago","year":"1939","author":"Karush William","key":"e_1_2_1_19_1"},{"volume-title":"Proceedings of 2nd Berkeley Symposium","year":"1951","author":"Harold","key":"e_1_2_1_20_1"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"key":"e_1_2_1_22_1","first-page":"755","volume-title":"Algorithms-ESA","author":"Nguyen Kim Thang","year":"2013"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2696081.2696102","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2696081.2696102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:11Z","timestamp":1750227131000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2696081.2696102"}},"subtitle":["Online Primal Dual: Beyond Linear Programs"],"short-title":[],"issued":{"date-parts":[[2014,12,9]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12,9]]}},"alternative-id":["10.1145\/2696081.2696102"],"URL":"https:\/\/doi.org\/10.1145\/2696081.2696102","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2014,12,9]]},"assertion":[{"value":"2014-12-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}