Game Theory for Next Generation Wireless and Communication Networks

Han, Zhu; Niyato, Dusit; Saad, Walid; Başar, Tamer

doi:10.1017/9781108277402

Cited by 61 publications

(39 citation statements)

References 368 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This randomly decision-making is because of the uncertainty of the environment which is managed by stochastic states in the reaction of the players' behaviors. 42 In potential games theory, which is a nonzero-sum game, the goal is to maximize the potential function cooperatively by all the players, which is the determination of a Nash equilibrium. 15 In minority GT, there are the odd number of users (ie, players) who choose their desired actions between two choices.…”

Section: Noncooperative-based Gt Offloading Mechanismsmentioning

confidence: 99%

See 1 more Smart Citation

A review on the computation offloading approaches in mobile edge computing: A game‐theoreticperspective

2020

View full text Add to dashboard Cite

In recent years, novel mobile applications such as augmented reality, virtual reality, and three-dimensional gaming, running on handy mobile devices have been pervasively popular. With rapid developments of such mobile applications, decentralized mobile edge computing (MEC) as an emerging distributed computing paradigm is developed for serving them near the smart devices, usually in one hop, to meet their computation, and delay requirements. In the literature, offloading mechanisms are designed to execute such mobile applications in the MEC environments through transferring resource-intensive tasks to the MEC servers. On the other hand, due to the resource limitations, resource heterogeneity, dynamic nature, and unpredictable behavior of MEC environments, it is necessary to consider the computation offloading issues as the challenging problem in the MEC environment. However, to the best of our knowledge, despite its importance, there is not any systematic, comprehensive, and detailed survey in game theory (GT)-based computation offloading mechanisms in the MEC environment. In this article, we provide a systematic literature review on the GT-based computation offloading approaches in the MEC environment in the form of a classical taxonomy to recognize the state-of-the-art mechanisms on this important topic and to provide open issues as well. The proposed taxonomy is classified into four main fields: classical game mechanisms, auction theory, evolutionary game mechanisms, and hybrid-base game mechanisms. Next, these classes are compared with each other according to the important factors such as performance metrics, case studies, utilized techniques, and evaluation tools, and their advantages and disadvantages are discussed, as well. Finally, open issues and future uncovered or weakly covered research challenges are discussed and the survey is concluded. K E Y W O R D S game theory, mobile edge computing, offloading, systematic review 1 INTRODUCTION Thanks to the recent improvements in hardware and software capabilities and accordingly complex mobile applications of mobile devices, they are becoming more popular in recent years. In the presence of emerging technologies,

show abstract

Section: Noncooperative-based Gt Offloading Mechanismsmentioning

confidence: 99%

“…The players take new stages randomly based on the current state and the selected actions. This randomly decision‐making is because of the uncertainty of the environment which is managed by stochastic states in the reaction of the players' behaviors …”

Section: Game‐theoretic‐based Offloading Mechanisms In Mecmentioning

confidence: 99%

A review on the computation offloading approaches in mobile edge computing: A game‐theoreticperspective

2020

View full text Add to dashboard Cite

show abstract

“…The coalitional game (CG) has been researched [32]- [34] and has been applied into wireless communications from many aspects, e.g., resource allocation for D2D communications [35], [36], content distribution [37], [38], and spectrum sensing [39], [40], etc.. BCFG is the expanded version of the CG used in the case with incomplete information and its definition is as following.…”

Section: A the Modelmentioning

confidence: 99%

Bayesian Coalition Formation Game for Virtual 5G Core Network Functions

et al. 2019

IEEE Access

Self Cite

View full text Add to dashboard Cite

The network function virtualization (NFV) enables the virtual network functions (VNFs) to run as software components upon a virtualization system hosted in a cloud. Recently, due to its high flexibility and elasticity in terms of network services and functions deploying, NFV has been considered as one of the key enabling techniques of the fifth-generation (5G) wireless systems. Moreover, the creation of the core network functions is the key to the implementation of 5G. Currently, there are extensive studies researching into how to deploy cooperatively VNFs over a federated cloud for multiple cloud providers (CPs) to create the 5G Core. These studies have a critical assumption that each CP participating in the cooperation is fully informed of all the information about other CPs. However, the assumption may not hold in practice. Since CPs adopt diverse virtualization technologies (e.g., XEN, KVM, or containers), the cost to create an instance of one VNF for each CP may be different. Moreover, the cost information is private and will not be shared with each other. Consequently, it is difficult for each CP to determine whether to cooperate with others and the way of cooperation. Therefore, in this paper, we utilize the Bayesian coalition formation game (BCFG) to tackle this challenging situation with the unknown information about CPs and formulate the optimal coalition that can deploy cooperatively each VNFs of 5G Core. Specifically, we address the optimal number of VNF instances to instantiate, the number of virtual resources for each instance, and the placement decision in a specific CP over a federated cloud. We propose a BCFG-based non-myopic and full negotiation approach for the creation of the virtual 5G Core network functions. Simulation results demonstrate the comprehensive performance of the proposed method in terms of convergence properties and the profits that each participating CP can obtain.

show abstract

“…Os autores também agradecem ao Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) e a Fundação de Amparo à Pesquisa do Estado do Rio de Janeiro (FAPERJ). sistemas de engenharia, comportamentais e financeiros tornam este tópico de pesquisa uma ferramenta extremamente importante com uma ampla gama de aplicações (Han et al, 2019;Başar and Zaccour, 2018). De fato, podemos encontrar numerosos resultados para teoria e prática na literatura correspondente a jogos diferenciais (Wang et al, 2018;Cotrina and Zúñiga, 2018;Aussel and Svensson, 2019;Alasseur et al, 2020).…”

Section: Introductionunclassified

“…Por outro lado, atrasos são uns dos fenômenos mais comuns que surgem na prática da engenharia e indústria, envolvendo problemas em áreas como: virtualização de redes, redes definidas por software, computação em nuvem, internet das coisas, redes verdes e segurança (Han et al, 2019;Alpcan and Başar, 2011). Portanto, a motivação para empregar a busca extremal para otimização desses processos com atrasos, comumente modelados com a estrutura teórica dos jogos, é clara e justificada.…”

Section: Introductionunclassified

Busca do Equilíbrio de Nash em Jogos Não-cooperativos com Atrasos

Oliveira

Rodrigues

Krstić

et al. 2020

Anais Do Congresso Brasileiro De Automática 2020

View full text Add to dashboard Cite

Neste artigo, propomos uma estratégia de Busca pelo Equilíbrio de Nash baseada no não-conhecimento do modelo que garanta ao sistema de malha fechada convergência local com propriedades de estabilidade em jogos quadrático não-cooperativos, do tipo duopólio, com ações arbitrariamente atrasadas. Em nosso cenário não-cooperativo, os jogadores têm acesso apenas aos seus próprios lucros. Para compensar atrasos distintos nas entradas dos dois jogadores, emprega-se a busca extremal por controle de fronteira via realimentação por predição com estimativas baseadas na média. Aplica-se uma análise de pequenos ganhos para a malha formada por equações diferencias ordinárias (EDO) - equações diferencias parciais (EDP), bem como a teoria da média em dimensões infinitas, devido ao estado dimensional infinito dos atrasos temporais, a fim de obter resultados de convergência local a uma pequena vizinhança do Equilíbrio de Nash. Quantifica-se o tamanho desse conjunto residual e os resultados teóricos validados através de um exemplo de simulação.

show abstract

Game Theory for Next Generation Wireless and Communication Networks

Cited by 61 publications

References 368 publications

A review on the computation offloading approaches in mobile edge computing: A game‐theoreticperspective

A review on the computation offloading approaches in mobile edge computing: A game‐theoreticperspective

Bayesian Coalition Formation Game for Virtual 5G Core Network Functions

Busca do Equilíbrio de Nash em Jogos Não-cooperativos com Atrasos

Contact Info

Product

Resources

About