乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:37:43Z","timestamp":1705142263950},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T00:00:00Z","timestamp":1659744000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T00:00:00Z","timestamp":1659744000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005645","name":"B\u00f4\u0323 Gi\u00e1o du\u0323c v\u00e0 \u00e0o ta\u0323o","doi-asserted-by":"publisher","award":["The 911 Project"],"id":[{"id":"10.13039\/501100005645","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/V022067\/1"],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,4]]},"abstract":"Abstract<\/jats:title>The success of crowdsourcing projects relies critically on motivating a crowd to contribute. One particularly effective method for incentivising participants to perform tasks is to run contests where participants compete against each other for rewards. However, there are numerous ways to implement such contests in specific projects, that vary in how performance is evaluated, how participants are rewarded, and the sizes of the prizes. Also, the best way to implement contests in a particular project is still an open challenge, as the effectiveness of each contest implementation (henceforth, incentive<\/jats:italic>) is unknown in advance. Hence, in a crowdsourcing project, a practical approach to maximise the overall utility of the requester (which can be measured by the total number of completed tasks or the quality of the task submissions) is to choose a set of incentives suggested by previous studies from the literature or from the requester\u2019s experience. Then, an effective mechanism can be applied to automatically select appropriate incentives from this set over different time intervals so as to maximise the cumulative utility within a given financial budget and a time limit. To this end, we present a novel approach to this incentive selection problem<\/jats:italic>. Specifically, we formalise it as an online decision making problem, where each action corresponds to offering a specific incentive. After that, we detail and evaluate a novel algorithm, , to solve the incentive selection problem efficiently and adaptively. In theory, in the case that all the estimates in (except the estimates of the effectiveness of each incentive) are correct, we show that the algorithm achieves the regret bound of

$\\mathcal {O}(\\sqrt {B\/c})$<\/jats:tex-math>\n O<\/mml:mi>\n (<\/mml:mo>\n \n \n B<\/mml:mi>\n \/<\/mml:mo>\n c<\/mml:mi>\n <\/mml:mrow>\n <\/mml:msqrt>\n )<\/mml:mo>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, where B<\/jats:italic> denotes the financial budget and c<\/jats:italic> is the average cost of the incentives. In experiments, the performance of is about 93% (up to 98%) of the optimal solution and about 9% (up to 40%) better than state-of-the-art algorithms in a broad range of settings, which vary in budget sizes, time limits, numbers of incentives, values of the standard deviation of the incentives\u2019 utilities, and group sizes of the contests (i.e., the numbers of participants in a contest).<\/jats:p>","DOI":"10.1007\/s10489-022-03593-2","type":"journal-article","created":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T03:18:57Z","timestamp":1659755937000},"page":"9204-9234","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient and adaptive incentive selection for crowdsourcing contests"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-4945-8197","authenticated-orcid":false,"given":"Nhat Van-Quoc","family":"Truong","sequence":"first","affiliation":[]},{"given":"Le Cong","family":"Dinh","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Stein","sequence":"additional","affiliation":[]},{"given":"Long","family":"Tran-Thanh","sequence":"additional","affiliation":[]},{"given":"Nicholas R.","family":"Jennings","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,6]]},"reference":[{"key":"3593_CR1","unstructured":"Truong N V-Q, Stein S, Tran-Thanh L, Jennings NR (2018) Adaptive incentive selection for crowdsourcing contests. In: Proceedings of the 17th international conference on autonomous agents and multiagent systems (AAMAS). IFAAMAS, pp 2100\u20132102"},{"issue":"4","key":"3593_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1924421.1924442","volume":"54","author":"A Doan","year":"2011","unstructured":"Doan A, Ramakrishnan R, Halevy AY (2011) Crowdsourcing systems on the world-wide web. Commun ACM 54(4):86\u201396. https:\/\/doi.org\/10.1145\/1924421.1924442","journal-title":"Commun ACM"},{"issue":"2","key":"3593_CR3","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1111\/ijmr.12135","volume":"20","author":"A Ghezzi","year":"2018","unstructured":"Ghezzi A, Gabelloni D, Martini A, Natalicchio A (2018) Crowdsourcing: A review and suggestions for future research. Int J Manag Rev 20(2):343\u2013363. https:\/\/doi.org\/10.1111\/ijmr.12135","journal-title":"Int J Manag Rev"},{"key":"3593_CR4","doi-asserted-by":"publisher","unstructured":"Jain S, Deodhar SJ (2021) Social mechanisms in crowdsourcing contests: a literature review. Behaviour & Information Technology,, pp 1\u201335. https:\/\/doi.org\/10.1080\/0144929X.2021.1880638","DOI":"10.1080\/0144929X.2021.1880638"},{"issue":"2","key":"3593_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1111\/radm.12443","volume":"51","author":"S Vermicelli","year":"2021","unstructured":"Vermicelli S, Cricelli L, Grimaldi M (2021) How can crowdsourcing help tackle the COVID-19 pandemic? An explorative overview of innovative collaborative practices. R&D Management 51(2):183\u2013194. https:\/\/doi.org\/10.1111\/radm.12443","journal-title":"R&D Management"},{"key":"3593_CR6","doi-asserted-by":"publisher","unstructured":"Uzor S, Jacques JT, Dudley JJ, Kristensson PO (2021) Investigating the Accessibility of Crowdwork Tasks on Mechanical Turk. In: Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems. https:\/\/doi.org\/10.1145\/3411764.3445291. ACM, Yokohama Japan, pp 1\u201314","DOI":"10.1145\/3411764.3445291"},{"key":"3593_CR7","doi-asserted-by":"publisher","unstructured":"Zhen Y, Khan A, Nazir S, Huiqi Z, Alharbi A, Khan S (2021) Crowdsourcing usage, task assignment methods, and crowdsourcing platforms: A systematic literature review. Journal of Software: Evolution and Process. https:\/\/doi.org\/10.1002\/smr.2368","DOI":"10.1002\/smr.2368"},{"key":"3593_CR8","doi-asserted-by":"crossref","unstructured":"Callison-Burch C (2009) Fast, cheap, and creative: Evaluating translation quality using Amazon\u2019s Mechanical Turk. In: Proceedings of the 2009 conference on empirical methods in natural language processing (EMNLP), vol 1. ACL, pp 286\u2013295","DOI":"10.3115\/1699510.1699548"},{"key":"3593_CR9","doi-asserted-by":"crossref","unstructured":"Snow R, O\u2019Connor B, Jurafsky D, Ng AY (2008) Cheap and fast\u2014but is it good? Evaluating non-expert annotations for natural language tasks. In: Proceedings of the 2008 conference on empirical methods in natural language processing (EMNLP). ACL, pp 254\u2013263","DOI":"10.3115\/1613715.1613751"},{"issue":"193","key":"3593_CR10","first-page":"1","volume":"18","author":"JW Vaughan","year":"2018","unstructured":"Vaughan J W (2018) Making better use of the crowd: how crowdsourcing can advance machine learning research. J Mach Learn Res 18(193):1\u201346. http:\/\/jmlr.org\/papers\/v18\/17-234.html","journal-title":"J Mach Learn Res"},{"key":"3593_CR11","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 14th international conference on autonomous agents and multiagent systems (AAMAS). IFAAMAS, pp 1101\u20131109"},{"key":"3593_CR12","doi-asserted-by":"crossref","unstructured":"Itoh A, Matsubara S (2016) Designing incentives for crowdsourced tasks via multi-armed bandits. In: IEEE international conference on agents (ICA). IEEE, pp 70\u201373","DOI":"10.1109\/ICA.2016.024"},{"key":"3593_CR13","doi-asserted-by":"publisher","unstructured":"Itoh Y, Matsubara S (2021) Adaptive Budget Allocation for Cooperative Task Solving in Crowdsourcing. In: 2021 IEEE international conference on big data (Big Data). 00000. IEEE, Orlando, FL, USA, pp 3525\u20133533, DOI https:\/\/doi.org\/10.1109\/BigData52589.2021.9671713https:\/\/doi.org\/10.1109\/BigData52589.2021.9671713, (to appear in print)","DOI":"10.1109\/BigData52589.2021.9671713 10.1109\/BigData52589.2021.9671713"},{"key":"3593_CR14","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 15th international conference on autonomous agents and multiagent systems (AAMAS). IFAAMAS, pp 86\u201394"},{"key":"3593_CR15","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1613\/jair.5727","volume":"61","author":"YE Kara","year":"2018","unstructured":"Kara Y E, Genc G, Aran O, Akarun L (2018) Actively estimating crowd annotation consensus. J Artif Intell Res 61:363\u2013405. https:\/\/doi.org\/10.1613\/jair.5727","journal-title":"J Artif Intell Res"},{"key":"3593_CR16","doi-asserted-by":"publisher","first-page":"103538","DOI":"10.1016\/j.artint.2021.103538","volume":"299","author":"Y Luo","year":"2021","unstructured":"Luo Y, Jennings N R (2021) A budget-limited mechanism for category-aware crowdsourcing of multiple-choice tasks. Artif Intell 299:103538. https:\/\/doi.org\/10.1016\/j.artint.2021.103538, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370221000898","journal-title":"Artif Intell"},{"key":"3593_CR17","doi-asserted-by":"publisher","first-page":"e2","DOI":"10.1017\/S0269888918000061","volume":"33","author":"C Muldoon","year":"2018","unstructured":"Muldoon C, O\u2019Grady M J, O\u2019Hare G M P (2018) A survey of incentive engineering for crowdsourcing. The Knowledge Engineering Review 33:e2. https:\/\/doi.org\/10.1017\/S0269888918000061","journal-title":"The Knowledge Engineering Review"},{"key":"3593_CR18","unstructured":"Sen S, Ridgway A, Ripley M (2015) Adaptive budgeted bandit algorithms for trust development in a supply-chain. In: Proceedings of the 14th international conference on autonomous agents and multiagent systems (AAMAS). IFAAMAS, pp 137\u2013144"},{"key":"3593_CR19","unstructured":"Tran-Thanh L, Huynh T D, Rosenfeld A, Ramchurn S D, Jennings N R (2014) BudgetFix: Budget limited crowdsourcing for interdependent task allocation with quality guarantees. In: Proceedings of the 13th international conference on autonomous agents and multiagent systems (AAMAS). IFAAMAS, pp 477\u2013484"},{"key":"3593_CR20","doi-asserted-by":"crossref","unstructured":"Truong N V-Q, Stein S, Tran-Thanh L, Jennings N R (2019) What prize is right? How to learn the optimal structure for crowdsourcing contests. In: Proceedings of the 16th pacific rim international conference on artificial intelligence (PRICAI). Springer International Publishing, pp 85\u201397","DOI":"10.1007\/978-3-030-29908-8_7"},{"key":"3593_CR21","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1613\/jair.5175","volume":"56","author":"M Venanzi","year":"2016","unstructured":"Venanzi M, Guiver J, Kohli P, Jennings NR (2016) Time-sensitive bayesian information aggregation for crowdsourcing systems. J Artif Intell Res 56:517\u2013545. https:\/\/doi.org\/10.1613\/jair.5175","journal-title":"J Artif Intell Res"},{"key":"3593_CR22","doi-asserted-by":"publisher","unstructured":"Simula H (2013) The rise and fall of crowdsourcing?. In: Proceeding of the 46th Hawaii international conference on system sciences (HICSS). https:\/\/doi.org\/10.1109\/HICSS.2013.537https:\/\/doi.org\/10.1109\/HICSS.2013.537. IEEE, pp 2783\u20132791","DOI":"10.1109\/HICSS.2013.537 10.1109\/HICSS.2013.537"},{"issue":"2","key":"3593_CR23","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/1809400.1809422","volume":"11","author":"W Mason","year":"2010","unstructured":"Mason W, Watts DJ (2010) Financial incentives and the \u201cperformance of crowds\u201d. ACM SigKDD Explorations Newsletter 11(2):100\u2013108","journal-title":"ACM SigKDD Explorations Newsletter"},{"key":"3593_CR24","unstructured":"Harris C (2011) You\u2019re hired! An examination of crowdsourcing incentive models in human resource tasks. In: Proceedings of the workshop on crowdsourcing for search and data mining at the Fourth ACM International Conference on Web Search and Data Mining (WSDM). ACM, pp 15\u201318"},{"key":"3593_CR25","unstructured":"Yin M, Chen Y (2015) Bonus or not? Learn to reward in crowdsourcing. In: Proceedings of the 24th international joint conference on artificial intelligence (IJCAI). AAAI Press, pp 201\u2013207"},{"issue":"5","key":"3593_CR26","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1111\/1467-6419.00150","volume":"15","author":"BS Frey","year":"2001","unstructured":"Frey BS, Jegen R (2001) Motivation crowding theory. J Econ Surv 15(5):589\u2013611. https:\/\/doi.org\/10.1111\/1467-6419.00150","journal-title":"J Econ Surv"},{"issue":"11","key":"3593_CR27","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1111\/j.0956-7976.2004.00757.x","volume":"15","author":"J Heyman","year":"2004","unstructured":"Heyman J, Ariely D (2004) Effort for payment: A tale of two markets. Psychol Sci 15 (11):787\u2013793","journal-title":"Psychol Sci"},{"issue":"4","key":"3593_CR28","doi-asserted-by":"publisher","first-page":"57","DOI":"10.2753\/JEC1086-4415150402","volume":"15","author":"H Zheng","year":"2011","unstructured":"Zheng H, Li D, Hou W (2011) Task design, motivation, and participation in crowdsourcing contests. Int J Electron Commer 15(4):57\u201388. https:\/\/doi.org\/10.2753\/JEC1086-4415150402","journal-title":"Int J Electron Commer"},{"key":"3593_CR29","doi-asserted-by":"crossref","unstructured":"Ramchurn SD, Huynh TD, Venanzi M, Shi B (2013) Collabmap: Crowdsourcing maps for emergency planning. In: Proceedings of the 5th annual ACM Web science conference (WebSci). ACM, pp 326\u2013335","DOI":"10.1145\/2464464.2464508"},{"key":"3593_CR30","doi-asserted-by":"crossref","unstructured":"Tran-Thanh L, Chapman A, Munoz De Cote Flores Luna JE, Rogers A, Jennings NR (2010) Epsilon\u2013first policies for budget\u2013limited multi-armed bandits. In: Proceedings of the 24th AAAI conference on artificial intelligence. AAAI Press, pp 1211\u20131216","DOI":"10.1609\/aaai.v24i1.7758"},{"key":"3593_CR31","doi-asserted-by":"crossref","unstructured":"Tran-Thanh L, Chapman A C, Rogers A, Jennings N R (2012) Knapsack based optimal policies for budget-limited multi-armed bandits. In: Proceedings of the 26th AAAI conference on artificial intelligence. AAAI Press, pp 1134\u20131140","DOI":"10.1609\/aaai.v26i1.8279"},{"issue":"3","key":"3593_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3164539","volume":"65","author":"A Badanidiyuru","year":"2018","unstructured":"Badanidiyuru A, Kleinberg R, Slivkins A (2018) Bandits with knapsacks. J ACM 65 (3):1\u201355. https:\/\/doi.org\/10.1145\/3164539","journal-title":"J ACM"},{"key":"3593_CR33","unstructured":"Archak N, Sundararajan A (2009) Optimal design of crowdsourcing contests. In: Proceedings of the 13th international conference on information systems (ICIS). AIS, pp 1\u201316"},{"key":"3593_CR34","unstructured":"Cavallo R, Jain S (2012) Efficient crowdsourcing contests. In: Proceedings of the 11th international conference on autonomous agents and multiagent systems (AAMAS), vol 2. IFAAMAS, pp 677\u2013686"},{"key":"3593_CR35","doi-asserted-by":"crossref","unstructured":"Cavallo R, Jain S (2013) Winner-take-all crowdsourcing contests with stochastic production. In: Proceedings of the 1st AAAI conference on human computation and crowdsourcing (HCOMP). AAAI Press, pp 34\u201341","DOI":"10.1609\/hcomp.v1i1.13090"},{"key":"3593_CR36","doi-asserted-by":"crossref","unstructured":"Chawla S, Hartline J D, Sivan B (2012) Optimal crowdsourcing contests. In: Proceedings of the 23d annual ACM-SIAM symposium on discrete algorithms (SODA). SIAM, pp 856\u2013868","DOI":"10.1137\/1.9781611973099.69"},{"key":"3593_CR37","doi-asserted-by":"crossref","unstructured":"DiPalantino D, Vojnovic M (2009) Crowdsourcing and all-pay auctions. In: EC \u201909 Proceedings of the 10th ACM conference on Electronic commerce. ACM, pp 119\u2013128","DOI":"10.1145\/1566374.1566392"},{"issue":"3","key":"3593_CR38","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1287\/msom.2020.0935","volume":"23","author":"CG Korpeoglu","year":"2021","unstructured":"Korpeoglu CG, K\u00f6rpeo\u011flu E, Tun\u00e7 S (2021) Optimal duration of innovation contests. Manufacturing & Service Operations Management 23(3):657\u2013675. https:\/\/doi.org\/10.1287\/msom.2020.0935https:\/\/doi.org\/10.1287\/msom.2020.0935","journal-title":"Manufacturing & Service Operations Management"},{"key":"3593_CR39","doi-asserted-by":"crossref","unstructured":"Luo T, Kanhere SS, Tan H-P, Wu F, Wu H (2015) Crowdsourcing with tullock contests: A new perspective. In: IEEE conference on computer communications (INFOCOM). IEEE, pp 2515\u20132523","DOI":"10.1109\/INFOCOM.2015.7218641"},{"issue":"3","key":"3593_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2837029","volume":"7","author":"T Luo","year":"2016","unstructured":"Luo T, Das S K, Tan H P, Xia L (2016) Incentive mechanism design for crowdsourcing: An all-pay auction approach. ACM Trans Intell Syst Technol 7(3):1\u201326. https:\/\/doi.org\/10.1145\/2837029","journal-title":"ACM Trans Intell Syst Technol"},{"issue":"3","key":"3593_CR41","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1257\/aer.91.3.542","volume":"91","author":"B Moldovanu","year":"2001","unstructured":"Moldovanu B, Sela A (2001) The optimal allocation of prizes in contests. Am Econ Rev 91 (3):542\u2013558","journal-title":"Am Econ Rev"},{"issue":"3","key":"3593_CR42","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1162\/003355300554917","volume":"115","author":"U Gneezy","year":"2000","unstructured":"Gneezy U, Rustichini A (2000) Pay enough or don\u2019t pay at all. Q J Econ 115(3):791\u2013810","journal-title":"Q J Econ"},{"key":"3593_CR43","doi-asserted-by":"crossref","unstructured":"Rogstadius J, Kostakos V, Kittur A, Smus B, Laredo J, Vukovic M (2011) An assessment of intrinsic and extrinsic motivation on task performance in crowdsourcing markets. In: Proceedings of the 5th international AAAI conference on Weblogs and Social Media (ICWSM). AAAI Press, pp 321\u2013328","DOI":"10.1609\/icwsm.v5i1.14105"},{"issue":"1","key":"3593_CR44","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P Auer","year":"2002","unstructured":"Auer P, Cesa-Bianchi N, Freund Y, Schapire RE (2002) The nonstochastic multiarmed bandit problem. SIAM J Comput 32(1):48\u201377. https:\/\/doi.org\/10.1137\/S0097539701398375","journal-title":"SIAM J Comput"},{"issue":"3\/4","key":"3593_CR45","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2307\/2332286","volume":"25","author":"WR Thompson","year":"1933","unstructured":"Thompson W R (1933) On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3\/4):285\u2013294. https:\/\/doi.org\/10.2307\/2332286","journal-title":"Biometrika"},{"issue":"2-3","key":"3593_CR46","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":"3593_CR47","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1613\/jair.4940","volume":"55","author":"C-J Ho","year":"2016","unstructured":"Ho C-J, Slivkins A, Vaughan JW (2016) Adaptive contract design for crowdsourcing markets: Bandit algorithms for repeated principal-agent problems. J Artif Intell Res 55:317\u2013359. https:\/\/doi.org\/10.1613\/jair.4940","journal-title":"J Artif Intell Res"},{"key":"3593_CR48","unstructured":"Kaufmann N, Schulze T, Veit D (2011) More than fun and money. Worker motivation in crowdsourcing \u2013 A study on Mechanical Turk. In: AMCIS \u201911 Proceedings of the 7th Americas Conference on Information Systems, vol 11. AIS, pp 1\u201311"},{"key":"3593_CR49","doi-asserted-by":"crossref","unstructured":"Araujo R M (2013) 99designs: An analysis of creative competition in crowdsourced design. In: Proceedings of the 1st AAAI conference on human computation and crowdsourcing (HCOMP). AAAI Press, pp 17\u201324","DOI":"10.1609\/hcomp.v1i1.13081"},{"issue":"2","key":"3593_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3321700","volume":"2","author":"O Feyisetan","year":"2019","unstructured":"Feyisetan O, Simperl E (2019) Beyond monetary incentives: experiments in paid microtask contests. ACM Transactions on Social Computing 2(2):1\u201331 (en). https:\/\/doi.org\/10.1145\/3321700, http:\/\/dl.acm.org\/citation.cfm?doid=3340675.3321700","journal-title":"ACM Transactions on Social Computing"},{"key":"3593_CR51","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: from design to implementation","author":"E-G Talbi","year":"2009","unstructured":"Talbi E-G (2009) Metaheuristics: from design to implementation. John Wiley & Sons, Hoboken, N.J"},{"issue":"301","key":"3593_CR52","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. https:\/\/doi.org\/10.2307\/2282952","journal-title":"J Am Stat Assoc"},{"key":"3593_CR53","unstructured":"Sutton RS, Barto AG (2018) Reinforcement Learning: An Introduction, 2nd edn. Adaptive Computation and Machine Learning Series, The MIT Press"},{"key":"3593_CR54","doi-asserted-by":"crossref","unstructured":"Yang J, Adamic LA, Ackerman MS (2008) Crowdsourcing and knowledge sharing: Strategic user behavior on Taskcn. In: Proceedings of the 9th ACM conference on electronic commerce (EC). ACM, pp 246\u2013255","DOI":"10.1145\/1386790.1386829"},{"key":"3593_CR55","unstructured":"Snoek J, Larochelle H, Adams R P (2012) Practical Bayesian optimization of machine learning algorithms. In: Advances in neural information processing systems 25 (NIPS). 00000, vol 2. Curran Associates, Inc., Nevada, USA, pp 2951\u20132959"},{"issue":"1","key":"3593_CR56","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s12530-020-09345-2","volume":"12","author":"AH Victoria","year":"2021","unstructured":"Victoria A H, Maragatham G (2021) Automatic tuning of hyperparameters using Bayesian optimization. Evolving Systems 12(1):217\u2013223. https:\/\/doi.org\/10.1007\/s12530-020-09345-2","journal-title":"Evolving Systems"},{"key":"3593_CR57","doi-asserted-by":"crossref","unstructured":"Mandel T, Liu Y-E, Brunskill E, Popovic Z (2015) The queue method: Handling delay, heuristics, prior data, and evaluation in bandits. In: Proceedings of the 29th AAAI conference on artificial intelligence. AAAI Press, pp 2849\u20132856","DOI":"10.1609\/aaai.v29i1.9604"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03593-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03593-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03593-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T09:22:31Z","timestamp":1682846551000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03593-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,6]]},"references-count":57,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["3593"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03593-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,6]]},"assertion":[{"value":"6 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}