{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T17:57:05Z","timestamp":1770832625849,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T00:00:00Z","timestamp":1686528000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T00:00:00Z","timestamp":1686528000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,12]]},"DOI":"10.23919\/ifipnetworking57963.2023.10186401","type":"proceedings-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T17:38:31Z","timestamp":1690220311000},"page":"1-9","source":"Crossref","is-referenced-by-count":2,"title":["Game Theoretic Resource Planning and Request Scheduling in Mobile Edge Computing Networks"],"prefix":"10.23919","author":[{"given":"Bin","family":"Xiang","sequence":"first","affiliation":[{"name":"CNRS@CREATE,Singapore"}]},{"given":"Jocelyne","family":"Elias","sequence":"additional","affiliation":[{"name":"University of Bologna,Italy"}]},{"given":"Fabio","family":"Martignon","sequence":"additional","affiliation":[{"name":"University of Bergamo,Italy"}]},{"given":"Elisabetta","family":"Di Nitto","sequence":"additional","affiliation":[{"name":"Politecnico di Milano,Italy"}]},{"given":"Dusit","family":"Niyato","sequence":"additional","affiliation":[{"name":"Nanyang Technological University,Singapore"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3041029"},{"key":"ref12","article-title":"Edge resource pricing and scheduling for blockchain: A stackelberg game approach","author":"huang","year":"2022","journal-title":"IEEE Trans Serv Comput"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2019.2903240"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737385"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3153089"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00057"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2891736"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3059692"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.03.015"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2018.04.007"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3146514"},{"key":"ref18","article-title":"Joint planning of network slicing and mobile edge computing: Models and algorithms","author":"xiang","year":"2021","journal-title":"IEEE Trans Cloud Comput"},{"key":"ref24","author":"dempe","year":"2002","journal-title":"Foundations of Bilevel Programming"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-007-0054-4"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On Random Graphs I","volume":"6","author":"erd?s","year":"1959","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0913069"},{"key":"ref20","first-page":"64","article-title":"A rank-based mechanism for service placement in the fog","author":"velasquez","year":"2020","journal-title":"IFIP Networking"},{"key":"ref22","year":"2023","journal-title":"Technical Report"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218477"},{"key":"ref28","year":"0","journal-title":"SCIP"},{"key":"ref27","year":"0","journal-title":"OpenCell"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.3037674"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.02.045"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS47774.2020.00036"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2938944"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488779"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TNET.2018.2880874","article-title":"Decentralized algorithm for randomized task allocation in fog computing systems","volume":"27","author":"jo\u0161ilo","year":"2018","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.2970698"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3063509"}],"event":{"name":"2023 IFIP Networking Conference (IFIP Networking)","location":"Barcelona, Spain","start":{"date-parts":[[2023,6,12]]},"end":{"date-parts":[[2023,6,15]]}},"container-title":["2023 IFIP Networking Conference (IFIP Networking)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10186376\/10186354\/10186401.pdf?arnumber=10186401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T17:40:12Z","timestamp":1693244412000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10186401\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,12]]},"references-count":29,"URL":"https:\/\/doi.org\/10.23919\/ifipnetworking57963.2023.10186401","relation":{},"subject":[],"published":{"date-parts":[[2023,6,12]]}}}