{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:18:40Z","timestamp":1743088720096,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496134"},{"type":"electronic","value":"9783031496141"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49614-1_11","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"152-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mechanism Design for\u00a0Time-Varying Value Tasks in\u00a0High-Load Edge Computing Markets"],"prefix":"10.1007","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"}]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Zhang, C., Du, H., Ye, Q., Liu, C., Yuan, H.: DMRA: a decentralized resource allocation scheme for multi-SP mobile edge computing. In: 2019 IEEE 39th international conference on distributed computing systems (ICDCS), pp. 390\u2013398. IEEE(2019)","DOI":"10.1109\/ICDCS.2019.00046"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-030-64843-5_44","volume-title":"Combinatorial Optimization and Applications","author":"G Zeng","year":"2020","unstructured":"Zeng, G., Zhang, C., Du, H.: An efficient mechanism for resource allocation in mobile edge computing. In: Wu, W., Zhang, Z. (eds.) COCOA 2020. LNCS, vol. 12577, pp. 657\u2013668. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64843-5_44"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Chen, W., Su, Z., Xu, Q., Luan, T.H., Li, R.: VFC-based cooperative UAV computation task offloading for post-disaster rescue. In: IEEE INFOCOM 2020-IEEE Conference on Computer Communications, pp. 228\u2013236. IEEE. (2020)","DOI":"10.1109\/INFOCOM41043.2020.9155397"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1109\/TCCN.2022.3147196","volume":"8","author":"H Qiu","year":"2022","unstructured":"Qiu, H., et al.: Applications of auction and mechanism design in edge computing: a survey. IEEE Trans. Cogn. Commun. Netw. 8(2), 1034\u201358 (2022)","journal-title":"IEEE Trans. Cogn. Commun. Netw."},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TMC.2019.2901786","volume":"19","author":"YH Hung","year":"2019","unstructured":"Hung, Y.H., Wang, C.Y., Hwang, R.H.: Optimizing social welfare of live video streaming services in mobile edge computing. IEEE Trans. Mob. Comput. 19(4), 922\u201334 (2019)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"53261","DOI":"10.1109\/ACCESS.2020.2980567","volume":"8","author":"S Yang","year":"2020","unstructured":"Yang, S.: A task offloading solution for internet of vehicles using combination auction matching model based on mobile edge computing. IEEE Access. 8, 53261\u201373 (2020)","journal-title":"IEEE Access."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Kaul, S., Yates, R., Gruteser, M.: Real-time status: how often should one update?. In: 2012 Proceedings IEEE INFOCOM, pp. 2731\u20132735. IEEE. (2012)","DOI":"10.1109\/INFCOM.2012.6195689"},{"issue":"5","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1109\/JSAC.2021.3065072","volume":"39","author":"RD Yates","year":"2021","unstructured":"Yates, R.D., Sun, Y., Brown, D.R., Kaul, S.K., Modiano, E., Ulukus, S.: Age of information: an introduction and survey. IEEE J. Sel. Areas Commun. 39(5), 1183\u2013210 (2021)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"5","key":"11_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.: Strategy-proof online mechanisms for weighted AoI minimization in edge computing. IEEE J. Sel. Areas Commun. 39(5), 1277\u201392 (2021)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.future.2020.02.045","volume":"108","author":"Y Chen","year":"2020","unstructured":"Chen, Y., Li, Z., Yang, B., Nai, K., Li, K.: A Stackelberg game approach to multiple resources allocation and pricing in mobile edge computing. Futur. Gener. Comput. Syst. 108, 273\u201387 (2020)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"11_CR11","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.: An online auction-based incentive mechanism for soft-deadline tasks in collaborative edge computing. Futur. Gener. Comput. Syst. 137, 1\u20133 (2022)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6(1), 58\u201373 (1981)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49614-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:03:31Z","timestamp":1707555811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49614-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496134","9783031496141"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49614-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}