{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:18:10Z","timestamp":1763468290594,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,5,13]],"date-time":"2013-05-13T00:00:00Z","timestamp":1368403200000},"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":[[2013,5,13]]},"DOI":"10.1145\/2488388.2488490","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T20:43:24Z","timestamp":1454705004000},"page":"1167-1178","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":167,"title":["Truthful incentives in crowdsourcing tasks using regret minimization mechanisms"],"prefix":"10.1145","author":[{"given":"Adish","family":"Singla","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Andreas","family":"Krause","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2013,5,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Mechanical turk platform. https:\/\/www.mturk.com\/.  Mechanical turk platform. https:\/\/www.mturk.com\/."},{"key":"e_1_3_2_1_2_1","first-page":"991","volume-title":"SODA","author":"Archer A.","year":"2002","unstructured":"A. Archer and E. Tardos . Frugal path mechanisms . In SODA , pages 991 -- 999 , 2002 . A. Archer and E. Tardos. Frugal path mechanisms. In SODA, pages 991--999, 2002."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_4_1","first-page":"454","volume-title":"COLT","author":"Auer P.","year":"2007","unstructured":"P. Auer , R. Ortner , and C. Szepesvari . Improved rates for the stochastic continuum-armed bandit problem . In COLT , pages 454 -- 468 , 2007 . P. Auer, R. Ortner, and C. Szepesvari. Improved rates for the stochastic continuum-armed bandit problem. In COLT, pages 454--468, 2007."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496905"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229023"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229026"},{"key":"e_1_3_2_1_9_1","first-page":"964","volume-title":"SODA","author":"Z.","year":"2002","unstructured":"Z. Bar-yossef, K. Hildrum , and F. Wu . Incentive-compatible online auctions for digital goods . In SODA , pages 964 -- 970 , 2002 . Z. Bar-yossef, K. Hildrum, and F. Wu. Incentive-compatible online auctions for digital goods. In SODA, pages 964--970, 2002."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0640"},{"key":"e_1_3_2_1_11_1","volume-title":"SODA","author":"Blum A.","year":"2005","unstructured":"A. Blum and J. Hartline . Near-optimal online auctions . In SODA , 2005 . A. Blum and J. Hartline. Near-optimal online auctions. In SODA, 2005."},{"key":"e_1_3_2_1_12_1","volume-title":"SODA","author":"Blum A.","year":"2003","unstructured":"A. Blum , V. Kumar , A. Rudra , and F. Wu . Online learning in online auctions . In SODA , 2003 . A. Blum, V. Kumar, A. Rudra, and F. Wu. Online learning in online auctions. In SODA, 2003."},{"key":"e_1_3_2_1_13_1","volume-title":"Regret minimization, and Equilibria in Algorithmic Game Theory","author":"Blum A.","year":"2007","unstructured":"A. Blum and Y. Monsour . Learning , Regret minimization, and Equilibria in Algorithmic Game Theory . Cambridge University Press , 2007 . A. Blum and Y. Monsour. Learning, Regret minimization, and Equilibria in Algorithmic Game Theory. Cambridge University Press, 2007."},{"key":"e_1_3_2_1_14_1","first-page":"304","volume-title":"SODA","author":"Cary M. C.","year":"2008","unstructured":"M. C. Cary , A. D. Flaxman , J. D. Hartline , and A. R. Karlin . Auctions for structured procurement . In SODA , pages 304 -- 313 , 2008 . M. C. Cary, A. D. Flaxman, J. D. Hartline, and A. R. Karlin. Auctions for structured procurement. In SODA, pages 304--313, 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258179"},{"key":"e_1_3_2_1_16_1","volume-title":"EC","author":"Chawla S.","year":"2010","unstructured":"S. Chawla , J. D. Hartline , D. L. Malec , and B. Sivan . Multi-parameter mechanism design and sequential posted pricing . In EC , 2010 . S. Chawla, J. D. Hartline, D. L. Malec, and B. Sivan. Multi-parameter mechanism design and sequential posted pricing. In EC, 2010."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807372"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566381"},{"key":"e_1_3_2_1_19_1","first-page":"735","volume-title":"SODA","author":"Goldberg A.","year":"2001","unstructured":"A. Goldberg , J. Hartline , and A. Wright . Competitive auctions and digital goods . In SODA , pages 735 -- 744 , 2001 . A. Goldberg, J. Hartline, and A. Wright. Competitive auctions and digital goods. In SODA, pages 735--744, 2001."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988784"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807376"},{"key":"e_1_3_2_1_22_1","volume-title":"CrowdConf","author":"Horton J. J.","year":"2010","unstructured":"J. J. Horton and R. J. Zeckhauser . Algorithmic wage negotiations: Applications to paid crowsourcing . In CrowdConf , 2010 . J. J. Horton and R. J. Zeckhauser. Algorithmic wage negotiations: Applications to paid crowsourcing. In CrowdConf, 2010."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.25"},{"key":"e_1_3_2_1_24_1","volume-title":"NIPS","author":"Kleinberg R.","year":"2004","unstructured":"R. Kleinberg . Nearly tight bounds for the continuum-armed bandit problem . In NIPS , 2004 . R. Kleinberg. Nearly tight bounds for the continuum-armed bandit problem. In NIPS, 2004."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946352"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352897"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1009"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1809400.1809422"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1958824.1958865"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.78"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124381"},{"key":"e_1_3_2_1_32_1","volume-title":"Workshop on Human Computation. ACM","author":"Singer Y.","year":"2011","unstructured":"Y. Singer and M. Mittal . Pricing tasks in online labor markets . In Workshop on Human Computation. ACM , 2011 . Y. Singer and M. Mittal. Pricing tasks in online labor markets. In Workshop on Human Computation. ACM, 2011."},{"key":"e_1_3_2_1_33_1","volume-title":"ICML","author":"Srinivas N.","year":"2010","unstructured":"N. Srinivas , A. Krause , S. Kakade , and M. Seeger . Gaussian process optimization in the bandit setting: No regret and experimental design . In ICML , 2010 . N. Srinivas, A. Krause, S. Kakade, and M. Seeger. Gaussian process optimization in the bandit setting: No regret and experimental design. In ICML, 2010."},{"key":"e_1_3_2_1_34_1","first-page":"1211","volume-title":"AAAI","author":"de Cote L., C. A., J. E. M.","year":"2010","unstructured":"Tran-Thanh, L., C. A., J. E. M. de Cote , A. Rogers , and N. R. Jennings . Epsilon-first policies for budget-limited multi-armed bandits . In AAAI , pages 1211 -- 1216 , 2010 . Tran-Thanh, L., C. A., J. E. M. de Cote, A. Rogers, and N. R. Jennings. Epsilon-first policies for budget-limited multi-armed bandits. In AAAI, pages 1211--1216, 2010."},{"key":"e_1_3_2_1_35_1","unstructured":"L. Tran-Thanh A. Chapman A. Rogers and N. R. Jennings. Knapsack based optimal policies for budget-limited multi-armed bandits. http:\/\/arxiv.org\/abs\/1204.1909 2013. Technical report.  L. Tran-Thanh A. Chapman A. Rogers and N. R. Jennings. Knapsack based optimal policies for budget-limited multi-armed bandits. http:\/\/arxiv.org\/abs\/1204.1909 2013. Technical report."},{"key":"e_1_3_2_1_36_1","volume-title":"AAAI","author":"Tran-Thanh L.","year":"2012","unstructured":"L. Tran-Thanh , A. Chapman , A. Rogers , and N. R. Jennings . Knapsack based optimal policies for budget-limited multi-armed bandits . In AAAI , 2012 . L. Tran-Thanh, A. Chapman, A. Rogers, and N. R. Jennings. Knapsack based optimal policies for budget-limited multi-armed bandits. In AAAI, 2012."},{"key":"e_1_3_2_1_37_1","volume-title":"AAAI","author":"Tran-Thanh L.","year":"2012","unstructured":"L. Tran-Thanh , S. Stein , A. Rogers , and N. R. Jennings . Efficient crowdsourcing of unknown experts using multi-armed bandits . In AAAI , 2012 . L. Tran-Thanh, S. Stein, A. Rogers, and N. R. Jennings. Efficient crowdsourcing of unknown experts using multi-armed bandits. In AAAI, 2012."}],"event":{"name":"WWW '13: 22nd International World Wide Web Conference","sponsor":["NICBR Nucleo de Informatcao e Coordenacao do Ponto BR","CGIBR Comite Gestor da Internet no Brazil","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Rio de Janeiro Brazil","acronym":"WWW '13"},"container-title":["Proceedings of the 22nd international conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488388.2488490","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488388.2488490","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:03Z","timestamp":1750235943000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488388.2488490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,13]]},"references-count":37,"alternative-id":["10.1145\/2488388.2488490","10.1145\/2488388"],"URL":"https:\/\/doi.org\/10.1145\/2488388.2488490","relation":{},"subject":[],"published":{"date-parts":[[2013,5,13]]},"assertion":[{"value":"2013-05-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}