{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:28:23Z","timestamp":1766068103321,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172124"],"award-info":[{"award-number":["62172124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10878-024-01228-5","type":"journal-article","created":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T20:39:28Z","timestamp":1733258368000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Incentive mechanism design for value-decreasing tasks in dynamic competitive edge computing networks"],"prefix":"10.1007","volume":"49","author":[{"given":"Qie","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zichen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2138-749X","authenticated-orcid":false,"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"1228_CR1","doi-asserted-by":"crossref","unstructured":"Chen Y, Li Z, Yang B, Nai K, Li K (2020) A Stackelberg game approach to multiple resources allocation and pricing in mobile edge computing. Futur Gener Comput Syst 108:273\u201387","DOI":"10.1016\/j.future.2020.02.045"},{"key":"1228_CR2","doi-asserted-by":"crossref","unstructured":"Chen W, Su Z, Xu Q, Luan TH, Li R (2020) VFC-based cooperative UAV computation task offloading for post-disaster rescue. In: IEEE conference on computer communications (INFOCOM), pp 228\u2013236","DOI":"10.1109\/INFOCOM41043.2020.9155397"},{"key":"1228_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.future.2022.07.001","volume":"137","author":"X He","year":"2022","unstructured":"He X, Shen Y, Ren J, Wang S, Wang X, Xu S (2022) An online auction-based incentive mechanism for soft-deadline tasks in collaborative edge computing. Futur Gener Comput Syst 137:1\u20133","journal-title":"Futur Gener Comput Syst"},{"issue":"4","key":"1228_CR4","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TMC.2019.2901786","volume":"19","author":"YH Hung","year":"2019","unstructured":"Hung YH, Wang CY, Hwang RH (2019) Optimizing social welfare of live video streaming services in mobile edge computing. IEEE Trans Mob Comput 19(4):922\u201334","journal-title":"IEEE Trans Mob Comput"},{"issue":"1","key":"1228_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/TETC.2015.2487865","volume":"6","author":"AL Jin","year":"2015","unstructured":"Jin AL, Song W, Zhuang W (2015) Auction-based resource allocation for sharing cloudlets in mobile cloud computing. IEEE Trans Emerg Top Comput 6(1):45\u201357","journal-title":"IEEE Trans Emerg Top Comput"},{"key":"1228_CR6","doi-asserted-by":"crossref","unstructured":"Kaul S, Yates R, Gruteser M (2012) Real-time status: How often should one update?. In: IEEE conference on computer communications (INFOCOM), pp 2731\u20132735","DOI":"10.1109\/INFCOM.2012.6195689"},{"issue":"13","key":"1228_CR7","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1002\/cpe.1712","volume":"23","author":"KH Kim","year":"2011","unstructured":"Kim KH, Beloglazov A, Buyya R (2011) Power-aware provisioning of virtual machines for real-time Cloud services. Concurr Comput Pract Exp 23(13):1491\u2013505","journal-title":"Concurr Comput Pract Exp"},{"issue":"23","key":"1228_CR8","doi-asserted-by":"publisher","first-page":"23472","DOI":"10.1109\/JIOT.2022.3200431","volume":"9","author":"X Kong","year":"2022","unstructured":"Kong X, Wu Y, Wang H, Xia F (2022) Edge computing for internet of everything: a survey. IEEE Internet Things J 9(23):23472\u201323485","journal-title":"IEEE Internet Things J"},{"issue":"5","key":"1228_CR9","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1109\/JSAC.2021.3065078","volume":"39","author":"H Lv","year":"2021","unstructured":"Lv H, Zheng Z, Wu F, Chen G (2021) Strategy-proof online mechanisms for weighted AoI minimization in edge computing. IEEE J Sel Areas Commun 39(5):1277\u201392","journal-title":"IEEE J Sel Areas Commun"},{"key":"1228_CR10","doi-asserted-by":"crossref","unstructured":"Ng J S, Lim W Y B, Dai H N, Xiong Z, Huang J, Niyato D, Miao C (2020) Communication-efficient federated learning in UAV-enabled IOV: a joint auction-coalition approach. In: IEEE global communications conference (GLOBECOM), pp 1\u20136","DOI":"10.1109\/GLOBECOM42002.2020.9322584"},{"issue":"2","key":"1228_CR11","first-page":"1832","volume":"71","author":"JS Ng","year":"2021","unstructured":"Ng JS, Lim WYB, Xiong Z, Niyato D, Leung C, Miao C (2021) A double auction mechanism for resource allocation in coded vehicular edge computing[J]. IEEE Trans Veh Technol 71(2):1832\u20131845","journal-title":"IEEE Trans Veh Technol"},{"issue":"2","key":"1228_CR12","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1109\/TCCN.2022.3147196","volume":"8","author":"H Qiu","year":"2022","unstructured":"Qiu H, Zhu K, Luong NC, Yi C, Niyato D, Kim DI (2022) Applications of auction and mechanism design in edge computing: a survey. IEEE Trans Cognit Commun Netw 8(2):1034\u201358","journal-title":"IEEE Trans Cognit Commun Netw"},{"key":"1228_CR13","doi-asserted-by":"publisher","first-page":"53261","DOI":"10.1109\/ACCESS.2020.2980567","volume":"8","author":"S Yang","year":"2020","unstructured":"Yang S (2020) A task offloading solution for internet of vehicles using combination auction matching model based on mobile edge computing. IEEE Access 8:53261\u201373","journal-title":"IEEE Access"},{"issue":"5","key":"1228_CR14","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1109\/JSAC.2021.3065072","volume":"39","author":"RD Yates","year":"2021","unstructured":"Yates RD, Sun Y, Brown DR, Kaul SK, Modiano E, Ulukus S (2021) Age of information: an introduction and survey. IEEE J Sel Areas Commun 39(5):1183\u2013210","journal-title":"IEEE J Sel Areas Commun"},{"key":"1228_CR15","doi-asserted-by":"crossref","unstructured":"Zeng G, Zhang C, Du H (2020) An efficient mechanism for resource allocation in mobile edge computing. In: Combinatorial optimization and applications (COCOA), pp 657\u2013668","DOI":"10.1007\/978-3-030-64843-5_44"},{"key":"1228_CR16","doi-asserted-by":"crossref","unstructured":"Zhang C, Du H, Ye Q, Liu C, Yuan H (2019) DMRA: a decentralized resource allocation scheme for multi-SP mobile edge computing. In: IEEE international conference on distributed computing systems (ICDCS), pp 390\u2013398","DOI":"10.1109\/ICDCS.2019.00046"},{"key":"1228_CR17","doi-asserted-by":"crossref","unstructured":"Zheng T, Wan J, Zhang J, Jiang C, Jia G (2020) A survey of computation offloading in edge computing. In: International conference on computer, information and telecommunication systems (CITS), pp 1-6.x","DOI":"10.1109\/CITS49457.2020.9232457"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01228-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01228-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01228-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T19:04:02Z","timestamp":1737745442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01228-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1228"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01228-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"17 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"3"}}