{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:29:24Z","timestamp":1762100964016,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,6]],"date-time":"2009-07-06T00:00:00Z","timestamp":1246838400000},"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":[[2009,7,6]]},"DOI":"10.1145\/1566374.1566386","type":"proceedings-article","created":{"date-parts":[[2009,7,15]],"date-time":"2009-07-15T13:51:31Z","timestamp":1247665891000},"page":"79-88","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["Characterizing truthful multi-armed bandit mechanisms"],"prefix":"10.1145","author":[{"given":"Moshe","family":"Babaioff","sequence":"first","affiliation":[{"name":"Microsoft Research, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yogeshwer","family":"Sharma","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandrs","family":"Slivkins","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"263","volume-title":"Conf. on Learning Theory (COLT)","author":"Abernethy Jacob","year":"2008","unstructured":"Jacob Abernethy , Elad Hazan , and Alexander Rakhlin . Competing in the dark: An efficient algorithm for bandit linear optimization . In Conf. on Learning Theory (COLT) , pages 263 -- 274 , 2008 . Jacob Abernethy, Elad Hazan, and Alexander Rakhlin. Competing in the dark: An efficient algorithm for bandit linear optimization. In Conf. on Learning Theory (COLT), pages 263--274, 2008."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134708"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.88"},{"key":"e_1_3_2_1_4_1","first-page":"482","volume-title":"IEEE Symp. on Foundations of Computer Science (FOCS)","author":"Aaron","year":"2001","unstructured":"Aaron Archer and \u00c9va Tardos. Truthful mechanisms for one-parameter agents . In IEEE Symp. on Foundations of Computer Science (FOCS) , pages 482 -- 491 , 2001 . Aaron Archer and \u00c9va Tardos. Truthful mechanisms for one-parameter agents. In IEEE Symp. on Foundations of Computer Science (FOCS), pages 482--491, 2001."},{"key":"e_1_3_2_1_5_1","volume-title":"March","author":"Athey Susan","year":"2007","unstructured":"Susan Athey and Ilya Segal . An efficient dynamic mechanism. Available from http:\/\/www.stanford.edu\/~isegal\/agv.pdf , March 2007 . Susan Athey and Ilya Segal. An efficient dynamic mechanism. Available from http:\/\/www.stanford.edu\/~isegal\/agv.pdf, March 2007."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"e_1_3_2_1_9_1","first-page":"335","volume-title":"Conf. on Learning Theory (COLT)","author":"Bartlett Peter L.","year":"2008","unstructured":"Peter L. Bartlett , Varsha Dani , Thomas Hayes , Sham Kakade , Alexander Rakhlin , and Ambuj Tewari . High-probability regret bounds for bandit online linear optimization . In Conf. on Learning Theory (COLT) , pages 335 -- 342 , 2008 . Peter L. Bartlett, Varsha Dani, Thomas Hayes, Sham Kakade, Alexander Rakhlin, and Ambuj Tewari. High-probability regret bounds for bandit online linear optimization. In Conf. on Learning Theory (COLT), pages 335--342, 2008."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.58"},{"key":"e_1_3_2_1_11_1","volume-title":"October","author":"Bergemann Dirk","year":"2006","unstructured":"Dirk Bergemann and Juuso V\u00e4lim\u00e4ki . Efficient dynamic auctions. Available from cowles.econ.yale.edu\/P\/cd\/d15b\/d1584.pdf , October 2006 . Dirk Bergemann and Juuso V\u00e4lim\u00e4ki. Efficient dynamic auctions. Available from cowles.econ.yale.edu\/P\/cd\/d15b\/d1584.pdf, October 2006."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-3711-7","volume-title":"Bandit problems: sequential allocation of experiments","author":"Berry Donald","year":"1985","unstructured":"Donald Berry and Bert Fristedt . Bandit problems: sequential allocation of experiments . Chapman &Hall, 1985 . Donald Berry and Bert Fristedt. Bandit problems: sequential allocation of experiments. Chapman&Hall, 1985."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, learning, and games","author":"Cesa-Bianchi Nicol\u00f2","year":"2006","unstructured":"Nicol\u00f2 Cesa-Bianchi and G\u00e1bor Lugosi . Prediction, learning, and games . Cambridge University Press , 2006 . Nicol\u00f2 Cesa-Bianchi and G\u00e1bor Lugosi. Prediction, learning, and games. Cambridge University Press, 2006."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109660"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566388"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386798"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.97.1.242"},{"key":"e_1_3_2_1_18_1","volume-title":"Multi-Armed Bandit Allocation Indices","author":"Gittins J.C.","year":"1989","unstructured":"J.C. Gittins . Multi-Armed Bandit Allocation Indices . John Wiley &Sons, 1989 . J.C. Gittins. Multi-Armed Bandit Allocation Indices. John Wiley&Sons, 1989."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281174"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11600930_5"},{"key":"e_1_3_2_1_21_1","first-page":"881","volume-title":"18th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Karp Richard","year":"2007","unstructured":"Richard Karp and Robert Kleinberg . Noisy binary search and its applications . In 18th ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 881 -- 890 , 2007 . Richard Karp and Robert Kleinberg. Noisy binary search and its applications. In 18th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 881--890, 2007."},{"key":"e_1_3_2_1_22_1","volume-title":"Spring","author":"Kleinberg Robert","year":"2007","unstructured":"Robert Kleinberg . Lecture notes: CS683: Learning, Games, and Electronic Markets (week 8) , Spring 2007 . Available at http:\/\/www.cs.cornell.edu\/courses\/cs683\/2007sp. Robert Kleinberg. Lecture notes: CS683: Learning, Games, and Electronic Markets (week 8), Spring 2007. Available at http:\/\/www.cs.cornell.edu\/courses\/cs683\/2007sp."},{"key":"e_1_3_2_1_23_1","volume-title":"Spring","author":"Kleinberg Robert","year":"2007","unstructured":"Robert Kleinberg . Lecture notes: CS683: Learning, Games, and Electronic Markets (week 9) , Spring 2007 . Available at http:\/\/www.cs.cornell.edu\/courses\/cs683\/2007sp. Robert Kleinberg. Lecture notes: CS683: Learning, Games, and Electronic Markets (week 9), Spring 2007. Available at http:\/\/www.cs.cornell.edu\/courses\/cs683\/2007sp."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374475"},{"key":"e_1_3_2_1_25_1","volume-title":"Chapter 28, Sponsored search auctions","author":"Lahaie Sebastien","year":"2007","unstructured":"Sebastien Lahaie , David M. Pennock , Amin Saberi , and Rakesh V . Vohra . In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani (eds.) Chapter 28, Sponsored search auctions . Cambridge University Press ., 2007 . Sebastien Lahaie, David M. Pennock, Amin Saberi, and Rakesh V. Vohra. In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani (eds.) Chapter 28, Sponsored search auctions. Cambridge University Press., 2007."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946351"},{"key":"e_1_3_2_1_28_1","first-page":"1146","volume-title":"ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Lavi Ron","year":"2005","unstructured":"Ron Lavi and Noam Nisan . Online ascending auctions for gradually expiring items . In ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 1146 -- 1155 , 2005 . Ron Lavi and Noam Nisan. Online ascending auctions for gradually expiring items. In ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 1146--1155, 2005."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367522"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0790"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1296179"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.54"},{"key":"e_1_3_2_1_35_1","volume-title":"IFIP International Conference on Theoretical Computer Science (TCS). An invited survey.","author":"Roughgarden Tim","year":"2008","unstructured":"Tim Roughgarden . An algorithmic game theory primer . IFIP International Conference on Theoretical Computer Science (TCS). An invited survey. , 2008 . Tim Roughgarden. An algorithmic game theory primer. IFIP International Conference on Theoretical Computer Science (TCS). An invited survey., 2008."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijindorg.2006.10.002"}],"event":{"name":"EC '09: ACM Conference on Electronic Commerce","sponsor":["ACM Association for Computing Machinery","SIGecom Special Interest Group on Economics and Computation"],"location":"Stanford California USA","acronym":"EC '09"},"container-title":["Proceedings of the 10th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1566374.1566386","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1566374.1566386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:10Z","timestamp":1750249390000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1566374.1566386"}},"subtitle":["extended abstract"],"short-title":[],"issued":{"date-parts":[[2009,7,6]]},"references-count":35,"alternative-id":["10.1145\/1566374.1566386","10.1145\/1566374"],"URL":"https:\/\/doi.org\/10.1145\/1566374.1566386","relation":{},"subject":[],"published":{"date-parts":[[2009,7,6]]},"assertion":[{"value":"2009-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}