{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:11Z","timestamp":1750307411755,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,7]],"date-time":"2010-06-07T00:00:00Z","timestamp":1275868800000},"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":[],"published-print":{"date-parts":[[2010,6,7]]},"DOI":"10.1145\/1807342.1807349","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"43-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Truthful mechanisms with implicit payment computation"],"prefix":"10.1145","author":[{"given":"Moshe","family":"Babaioff","sequence":"first","affiliation":[{"name":"Microsoft Research, Mountain View, CA, USA"}]},{"given":"Robert D.","family":"Kleinberg","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Aleksandrs","family":"Slivkins","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"SODA","author":"Archer A.","year":"2003","unstructured":"A. Archer , C. Papadimitriou , K. Talwar , and \u00c9. Tardos. An approximate truthful mechanism for combinatorial auctions with single parameter agents. Internet Mathematics, 1, 2004 . In SODA 2003 . A. Archer, C. Papadimitriou, K. Talwar, and \u00c9. Tardos. An approximate truthful mechanism for combinatorial auctions with single parameter agents. Internet Mathematics, 1, 2004. In SODA 2003."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875583"},{"key":"e_1_3_2_1_3_1","volume-title":"Mar.","author":"Athey S.","year":"2007","unstructured":"S. Athey and I. Segal . An efficient dynamic mechanism. Working paper , Mar. 2007 . S. Athey and I. Segal. An efficient dynamic mechanism. Working paper, Mar. 2007."},{"key":"e_1_3_2_1_4_1","volume-title":"COLT","author":"Audibert J.-Y.","year":"2009","unstructured":"J.-Y. Audibert and S. Bubeck . Minimax policies for adversarial and stochastic bandits . In COLT , 2009 . J.-Y. Audibert and S. Bubeck. Minimax policies for adversarial and stochastic bandits. In COLT, 2009."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386807"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566386"},{"key":"e_1_3_2_1_9_1","volume-title":"Oct.","author":"Bergemann D.","year":"2006","unstructured":"D. Bergemann and J. V\u00e4lim\u00e4ki . Efficient dynamic auctions. Working paper , Oct. 2006 . D. Bergemann and J. V\u00e4lim\u00e4ki. Efficient dynamic auctions. Working paper, Oct. 2006."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566388"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.42"},{"key":"e_1_3_2_1_12_1","first-page":"425","volume-title":"21st COLT","author":"Kleinberg R.","year":"2008","unstructured":"R. Kleinberg , A. Niculescu-Mizil , and Y. Sharma . Regret bounds for sleeping experts and bandits . In 21st COLT , pages 425 -- 436 , 2008 . R. Kleinberg, A. Niculescu-Mizil, and Y. Sharma. Regret bounds for sleeping experts and bandits. In 21st COLT, pages 425--436, 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301287"}],"event":{"name":"EC '10: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Cambridge Massachusetts USA","acronym":"EC '10"},"container-title":["Proceedings of the 11th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807342.1807349","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807342.1807349","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:34Z","timestamp":1750246774000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807342.1807349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,7]]},"references-count":15,"alternative-id":["10.1145\/1807342.1807349","10.1145\/1807342"],"URL":"https:\/\/doi.org\/10.1145\/1807342.1807349","relation":{},"subject":[],"published":{"date-parts":[[2010,6,7]]},"assertion":[{"value":"2010-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}