{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:34:29Z","timestamp":1769218469411,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10489-021-02387-2","type":"journal-article","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T13:03:03Z","timestamp":1625144583000},"page":"3209-3226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dominant strategy truthful, deterministic multi-armed bandit mechanisms with logarithmic regret for sponsored search auctions"],"prefix":"10.1007","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2287-0440","authenticated-orcid":false,"given":"Divya","family":"Padmanabhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satyanath","family":"Bhat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. J.","family":"Prabuchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shirish","family":"Shevade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Narahari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,1]]},"reference":[{"key":"2387_CR1","unstructured":"Agrawal S, Goyal N (2012) Analysis of thompson sampling for the multi-armed bandit problem. In: COLT, pp 39.1\u201339.26"},{"issue":"2-3","key":"2387_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time analysis of the multiarmed bandit problem. Mach learn 47(2-3):235\u2013256","journal-title":"Mach learn"},{"key":"2387_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff M, Kleinberg RD, Slivkins A (2010) Truthful mechanisms with implicit payment computation. In: Proceedings of the Eleventh ACM conference on electronic commerce (EC\u201910), ACM, pp 43\u201352","DOI":"10.1145\/1807342.1807349"},{"issue":"1","key":"2387_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/120878768","volume":"43","author":"M Babaioff","year":"2014","unstructured":"Babaioff M, Sharma Y, Slivkins A (2014) Characterizing truthful multi-armed bandit mechanisms. SIAM J Comput 43(1):194\u2013230","journal-title":"SIAM J Comput"},{"key":"2387_CR5","unstructured":"Bhat S, Padmanabhan D, Jain S, Narahari Y (2016) A truthful mechanism with biparameter learning for online crowdsourcing: (extended abstract). In: Proceedings of the 2016 international conference on autonomous agents & multiagent systems (AAMAS\u201916), Singapore, May 9-13, 2016, pp 1385\u20131386"},{"key":"2387_CR6","unstructured":"Biswas A, Jain S, Mandal D, Narahari Y (2015) A truthful budget feasible multi-armed bandit mechanism for crowdsourcing time critical tasks. In: Proceedings of the 2015 international conference on autonomous agents and multiagent systems (AAMAS\u201915), pp 1101\u20131109"},{"issue":"1","key":"2387_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000024","volume":"5","author":"S Bubeck","year":"2012","unstructured":"Bubeck S, Cesa-Bianchi N (2012) Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Found Trends Mach Learn 5(1):1\u2013122","journal-title":"Found Trends Mach Learn"},{"issue":"11","key":"2387_CR8","doi-asserted-by":"publisher","first-page":"7711","DOI":"10.1109\/TIT.2013.2277869","volume":"59","author":"S Bubeck","year":"2013","unstructured":"Bubeck S, Cesa-bianchi N, Lugosi G (2013) Bandits with heavy tail. IEEE Trans Inf Theory 59(11):7711\u20137717","journal-title":"IEEE Trans Inf Theory"},{"key":"2387_CR9","unstructured":"Chen W, Wang Y, Yuan Y (2013) Combinatorial multi-armed bandit: General framework and applications. In: International conference on machine learning (ICML), pp 151\u2013159"},{"key":"2387_CR10","doi-asserted-by":"crossref","unstructured":"Devanur NR, Kakade SM (2009) The price of truthfulness for pay-per-click auctions. In: Proceedings of the 10th ACM conference on electronic commerce (EC\u201909), pp 99\u2013106","DOI":"10.1145\/1566374.1566388"},{"issue":"1","key":"2387_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s11004-017-9695-9","volume":"50","author":"R Dirkx","year":"2018","unstructured":"Dirkx R, Dimitrakopoulos R (2018) Optimizing infill drilling decisions using multi-armed bandits: Application in a long-term, multi-element stockpile. Math Geosci 50(1):35\u201352","journal-title":"Math Geosci"},{"issue":"1","key":"2387_CR12","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1613\/jair.4432","volume":"51","author":"Z Feldman","year":"2014","unstructured":"Feldman Z, Domshlak C (2014) Simple regret optimization in online planning for markov decision processes. J Artif Intell Res (JAIR) 51(1):165\u2013205","journal-title":"J Artif Intell Res (JAIR)"},{"key":"2387_CR13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.artint.2015.05.012","volume":"227","author":"N Gatti","year":"2015","unstructured":"Gatti N, Lazaric A, Rocco M, Trov\u00f2 F (2015) Truthful learning mechanisms for multi-slot sponsored search auctions with externalities. Artif Intell 227:93\u2013139","journal-title":"Artif Intell"},{"key":"2387_CR14","doi-asserted-by":"crossref","unstructured":"Gatti N, Lazaric A, Trov\u00f2 F (2012) A truthful learning mechanism for contextual multi-slot sponsored search auctions with externalities. In: Proceedings of the 13th ACM conference on electronic commerce (EC\u201912), pp 605\u2013622","DOI":"10.1145\/2229012.2229057"},{"key":"2387_CR15","unstructured":"Ghalme Ganesh, Jain Shweta, Gujar Sujit, Narahari Y. (2017) Thompson sampling based mechanisms for stochastic multi-armed bandit problems. In: Proceedings of the 16th conference on autonomous agents and multiagent systems (AAMAS), pp 87\u2013 95"},{"key":"2387_CR16","doi-asserted-by":"crossref","unstructured":"Gonen Rica, Pavlov Elan (2007) An incentive-compatible multi-armed bandit mechanism. In: Proceedings of the Twenty-sixth annual ACM symposium on principles of distributed computing (PODC), pp 362\u2013363","DOI":"10.1145\/1281100.1281174"},{"key":"2387_CR17","doi-asserted-by":"crossref","unstructured":"Gonen R, Pavlov E (2009) Adaptive incentive-compatible sponsored search auction. In: SOFSEM 2009: theory and practice of computer science, pp 303\u2013316","DOI":"10.1007\/978-3-540-95891-8_29"},{"issue":"301","key":"2387_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J Am Stat Assoc 58(301):13\u201330","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"2387_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s13226-016-0186-3","volume":"47","author":"S Jain","year":"2016","unstructured":"Jain S, Bhat S, Ghalme G, Padmanabhan D, Narahari Y (2016) Mechanisms with learning for stochastic multi-armed bandit problems. Indian J Pure Appl Math 47(2):229\u2013272","journal-title":"Indian J Pure Appl Math"},{"key":"2387_CR20","unstructured":"Jain S, Ghalme G, Bhat S, Gujar S, Narahari Y (2016) A deterministic MAB mechanism for crowdsourcing with logarithmic regret and immediate payments. In: Proceedings of the 2016 international conference on autonomous agents & multiagent systems (AAMAS\u201916), Singapore, May 9-13, 2016, pp 86\u201394"},{"issue":"Supplement C","key":"2387_CR21","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.artint.2017.10.001","volume":"254","author":"S Jain","year":"2018","unstructured":"Jain S, Gujar S, Bhat S, Zoeter O, Narahari Y (2018) A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing. Artif Intell 254(Supplement C):44\u201363","journal-title":"Artif Intell"},{"key":"2387_CR22","doi-asserted-by":"crossref","unstructured":"Kapoor S, Patel KK, Kar P (2018) Corruption-tolerant bandit learning. Machine Learning, pp 1\u201329","DOI":"10.1007\/s10994-018-5758-5"},{"issue":"2","key":"2387_CR23","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-010-5178-7","volume":"80","author":"R Kleinberg","year":"2010","unstructured":"Kleinberg R, Niculescu-Mizil A, Sharma Y (2010) Regret bounds for sleeping experts and bandits. Mach Learn 80(2):245\u2013 272","journal-title":"Mach Learn"},{"key":"2387_CR24","unstructured":"Liu Chang, Cai Qingpeng, Zhang Yukui (2017) Multi-armed bandit mechanism with private histories. In: Proceedings of the 16th conference on autonomous agents and MultiAgent systems (AAMAS), pp 1607\u20131609"},{"key":"2387_CR25","unstructured":"Myerson RB (1991) Game Theory: Analysis of Conflict, Harvard University Press, Cambridge"},{"key":"2387_CR26","doi-asserted-by":"crossref","unstructured":"Narahari Y. (2014) Game Theory and Mechanism Design. IISc Press and the World Scientific Publishing Company","DOI":"10.1142\/8902"},{"issue":"1","key":"2387_CR27","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1613\/jair.2046","volume":"29","author":"Noam Nisan","year":"2007","unstructured":"Nisan Noam, Ronen Amir (2007) Computationally feasible vcg mechanisms. J Artif Intell Rese (JAIR) 29(1):19\u201347","journal-title":"J Artif Intell Rese (JAIR)"},{"key":"2387_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan N, Roughgarden T, Tardos E, Vazirani VV (2007) Algorithmic Game Theory. Cambridge University Press, New York"},{"key":"2387_CR29","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1613\/jair.5398","volume":"58","author":"Santiago Ontanon","year":"2017","unstructured":"Santiago Ontanon (2017) Combinatorial multi-armed bandits for real-time strategy games. J Artif Intell Res (JAIR) 58:665\u2013702","journal-title":"J Artif Intell Res (JAIR)"},{"key":"2387_CR30","doi-asserted-by":"crossref","unstructured":"Padmanabhan D, Bhat S, Garg D, Shevade SK, Narahari Y (2016) A robust UCB scheme for active learning in regression from strategic crowds. In: International joint conference on neural networks, IJCNN 2016, pp 2212\u20132219","DOI":"10.1109\/IJCNN.2016.7727473"},{"issue":"6","key":"2387_CR31","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1002\/asmb.874","volume":"26","author":"SL Scott","year":"2010","unstructured":"Scott SL (2010) A modern bayesian look at the multi-armed bandit. Appl Stoch Model Bus Ind 26(6):639\u2013658","journal-title":"Appl Stoch Model Bus Ind"},{"issue":"9","key":"2387_CR32","first-page":"1064","volume":"103","author":"A Das Sharma","year":"2012","unstructured":"Das Sharma A, Gujar S, Narahari Y (2012) Truthful multi-armed bandit mechanisms for multi-slot sponsored search auctions. Curr Sci 103(9):1064\u20131077","journal-title":"Curr Sci"},{"issue":"1","key":"2387_CR33","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey W (1961) Counterspeculation, Auctions, and competitive sealed tenders. The Journal of Finance 16(1):8\u201337","journal-title":"The Journal of Finance"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02387-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02387-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02387-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,10]],"date-time":"2022-02-10T05:31:20Z","timestamp":1644471080000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02387-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,1]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["2387"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02387-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,1]]},"assertion":[{"value":"24 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}