{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:27:18Z","timestamp":1740173238113,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"22","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Natural Science Foundation of Huaian","award":["HAB202058"],"award-info":[{"award-number":["HAB202058"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Internet Things J."],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1109\/jiot.2023.3282193","type":"journal-article","created":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T17:35:08Z","timestamp":1685640908000},"page":"19972-19980","source":"Crossref","is-referenced-by-count":3,"title":["Ellipsoid-Pricing-Based Context-Feature Mechanisms for Noisy Sensing Tasks"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2014-6915","authenticated-orcid":false,"given":"Jiajun","family":"Sun","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology and the Huai’an Key Laboratory of Big Data Intelligent Computing and Analysis, Huaiyin Normal Universiy, Huaian, China"}]},{"given":"Dianliang","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Mechanical Engineering, Shanghai Jiaotong University, Shanghai, China"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1629"},{"key":"ref24","first-page":"1928","article-title":"Online pricing with reserve price constraint for personal data markets","volume":"34","author":"niu","year":"2022","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref12","article-title":"A survey of online experiment design with the stochastic multi-armed bandit","author":"burtini","year":"2015","journal-title":"arXiv 1510 00757"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72927-3_33"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3680"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2017.11.009"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC-DSS-SmartCity-DependSys57074.2022.00272"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.2765257"},{"key":"ref22","volume":"2","author":"gr\u00f6tschel","year":"2012","journal-title":"Geometric Algorithms and Combinatorial Optimization"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2018.1755"},{"key":"ref21","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"khachiyan","year":"1979","journal-title":"Doklady Akademii Nauk"},{"key":"ref2","first-page":"1732","article-title":"Incentive mechanisms for crowdsensing: Crowdsourcing with smartphones","volume":"24","author":"yang","year":"2016","journal-title":"Biol Cybern"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488490"},{"key":"ref17","article-title":"Adversarial combinatorial bandits with general non-linear reward functions","author":"chen","year":"2021","journal-title":"arXiv 2101 01301"},{"key":"ref16","article-title":"Context-based dynamic pricing with online clustering","author":"miao","year":"2019","journal-title":"arXiv 1902 06199"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2019.3485"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1639714.1639732"},{"key":"ref8","first-page":"1602","article-title":"Multi-armed bandits on implicit metric spaces","volume":"66","author":"slivkins","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref7","first-page":"697","article-title":"Nearly tight bounds for the continuum-armed bandit problem","volume":"17","author":"kleinberg","year":"2004","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2014.1294"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.2973980"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2018.2884713"},{"key":"ref6","article-title":"CrowdFL: Privacy-preserving mobile crowdsensing system via federated learning","author":"zhao","year":"2022","journal-title":"IEEE Trans Mobile Comput"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3081596"}],"container-title":["IEEE Internet of Things Journal"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488907\/10301752\/10142021.pdf?arnumber=10142021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T20:01:56Z","timestamp":1701115316000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10142021\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":24,"journal-issue":{"issue":"22"},"URL":"https:\/\/doi.org\/10.1109\/jiot.2023.3282193","relation":{},"ISSN":["2327-4662","2372-2541"],"issn-type":[{"type":"electronic","value":"2327-4662"},{"type":"electronic","value":"2372-2541"}],"subject":[],"published":{"date-parts":[[2023,11,15]]}}}