Conference paper · 2023 · Open access

Game Theoretic Resource Planning and Request Scheduling in Mobile Edge Computing Networks

Bin Xiang, Jocelyne Elias, Fabio Martignon, Elisabetta Di Nitto, Dusit Tao Niyato

IFIP Networking Conference (IFIP Networking), 1–9 · Published 12 June 2023 · DOI 10.23919/ifipnetworking57963.2023.10186401

Open PDFView at the publisherCite this paper

In brief

“Game Theoretic Resource Planning and Request Scheduling in Mobile Edge Computing Networks” is a 2023 conference paper by Bin Xiang and 4 co-authors, published in IFIP Networking Conference (IFIP Networking). OpenAlex counts 3 citations as of 19 November 2026. It is open access: the full text is free to read at Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna).

Citations
3
Most cited in
2026 (2)
Field-weighted impact
0.54
References
27
Authors
5

Abstract

Mobile Edge Computing (MEC) networks offer an increasing computing power through the collaboration among MEC nodes. This opens a large computing market and brings challenges for efficient resource management. In this paper, we study the joint optimization problem of planning cost-efficient edge networks, allocating link and computation resources, as well as scheduling and routing user requests in edge computing networks with arbitrary topologies and multiple ingress nodes. We formulate this problem as a Stackelberg game where the network operator, as the leader, aims at maximizing its profit, and the edge nodes, as the followers, minimize their users' costs and latency. Then, we prove the existence of the generalized Nash equilibrium for the follower subgame, and the Stackelberg equilibrium for the leader-follower game. We further propose a distributed best-response algorithm for the follower game and an alternating leader-follower optimization algorithm for the full game to compute the equilibrium and prove its convergence. A centralized optimization incorporating both profit and network latency targets is formulated and solved, which serves as benchmark for the game solution. Extensive numerical results demonstrate the effectiveness of the proposed game, achieving near-optimal planning and scheduling solutions in a very short time even for large-scale edge networks.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Xiang, B., Elias, J., Martignon, F., Di Nitto, E., & Niyato, D. T. (2023). Game Theoretic Resource Planning and Request Scheduling in Mobile Edge Computing Networks. IFIP Networking Conference (IFIP Networking), 1–9. https://doi.org/10.23919/ifipnetworking57963.2023.10186401

MLA 9

Xiang, Bin, et al. “Game Theoretic Resource Planning and Request Scheduling in Mobile Edge Computing Networks.” IFIP Networking Conference (IFIP Networking), 2023, pp. 1–9. https://doi.org/10.23919/ifipnetworking57963.2023.10186401.

Chicago

Xiang, Bin, Jocelyne Elias, Fabio Martignon, Elisabetta Di Nitto, and Dusit Tao Niyato. 2023. “Game Theoretic Resource Planning and Request Scheduling in Mobile Edge Computing Networks.” IFIP Networking Conference (IFIP Networking): 1–9. https://doi.org/10.23919/ifipnetworking57963.2023.10186401.

Harvard

Xiang, B. et al. (2023) ‘Game Theoretic Resource Planning and Request Scheduling in Mobile Edge Computing Networks’, IFIP Networking Conference (IFIP Networking), pp. 1–9. doi:10.23919/ifipnetworking57963.2023.10186401.

IEEE

B. Xiang, J. Elias, F. Martignon, E. Di Nitto, and D. T. Niyato, “Game Theoretic Resource Planning and Request Scheduling in Mobile Edge Computing Networks,” IFIP Networking Conference (IFIP Networking), pp. 1–9, 2023, doi: 10.23919/ifipnetworking57963.2023.10186401.

BibTeX

@inproceedings{xiang2023game,
  title     = {{Game Theoretic Resource Planning and Request Scheduling in Mobile Edge Computing Networks}},
  author    = {Xiang, Bin and Elias, Jocelyne and Martignon, Fabio and Di Nitto, Elisabetta and Niyato, Dusit Tao},
  booktitle = {IFIP Networking Conference (IFIP Networking)},
  year      = {2023},
  pages     = {1--9},
  doi       = {10.23919/ifipnetworking57963.2023.10186401},
  url       = {https://doi.org/10.23919/ifipnetworking57963.2023.10186401}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing

  • mobile edge computing
  • resource allocation
  • request scheduling
  • Stackelberg game
  • generalized Nash equilibrium
  • network latency

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Xiang, B., Elias, J., Martignon, F., Di Nitto, E., & Niyato, D. T. (2023). Game Theoretic Resource Planning and Request Scheduling in Mobile Edge Computing Networks. IFIP Networking Conference (IFIP Networking), 1–9. https://doi.org/10.23919/ifipnetworking57963.2023.10186401

How many times has this paper been cited?

3 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna): sign in and open the PDF from this page.

Who wrote this paper?

Bin Xiang, Jocelyne Elias, Fabio Martignon, Elisabetta Di Nitto, Dusit Tao Niyato.

What is the DOI of this paper?

10.23919/ifipnetworking57963.2023.10186401, permanently at https://doi.org/10.23919/ifipnetworking57963.2023.10186401. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.