Game Theory for Wireless Engineers

MacKenzie, Allen B.; DaSilva, Luiz A.

doi:10.2200/s00014ed1v01y200508com001

Cited by 308 publications

(220 citation statements)

References 30 publications

Supporting

Mentioning

217

Contrasting

Unclassified

Order By: Relevance

“…In real, large-scale networks, decisions are often made by each agent independently, based on that agent's preferences or objectives. Game Theory models are well suited to explain these scenarios [25]. Game Theory studies the interaction of autonomous agents that make their own decisions while trying to optimize their goals.…”

Section: Related Workmentioning

confidence: 99%

“…Specifically, this problem has been studied in wireless and ad-hoc networks [35,25,10]. To deal with selfish agents, numerous approaches use reputation [18] (i.e., techniques based on monitoring the nodes' behavior from a cooperation perspective) or price-based techniques [17] (i.e., a node receives a payment for its cooperation in forwarding network messages and also pays other nodes which participate in forwarding its messages).…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A formal model based on Game Theory for the analysis of cooperation in distributed service discovery

Martínez-Cánovas

Val

Botti

et al. 2016

Information Sciences

View full text Add to dashboard Cite

ElsevierMartínez-Cánovas, G.; Del Val Noguera, E.; Botti Navarro, VJ.; Hernández, P.; Rebollo Pedruelo, M. (2016) AbstractNew systems can be designed, developed, and managed as societies of agents that interact with each other by offering and providing services. These systems can be viewed as complex networks where nodes are bounded rational agents. In order to deal with complex goals, agents must cooperate with other agents to be able to locate the required services. The aim of this paper is to formally and empirically analyze under what circumstances cooperation emerges in decentralized search for services. We propose a repeated game model that formalizes the interactions among agents in a search process where each agent has the freedom to choose whether or not to cooperate with other agents. Agents make decisions based on the cost of their actions and the expected reward if they participate by forwarding queries in a search process that ends successfully. We propose a strategy that is based on random-walks, and we study under what conditions the strategy is a Nash Equilibrium. We performed several experiments in order to evaluate the model and the strategy and to analyze which network structures are the most appropriate for promoting cooperation.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

A formal model based on Game Theory for the analysis of cooperation in distributed service discovery

Martínez-Cánovas

Val

Botti

et al. 2016

Information Sciences

View full text Add to dashboard Cite

show abstract

“…The mainstream of existing research in telecommunications networks focused on using non-cooperative games in various applications such as distributed resource allocation [25], congestion control [26], power control [27], and spectrum sharing in cognitive radio, among others. This need for non-cooperative games led to numerous tutorials and books outlining its concepts and usage in communication, such as [28], [29]. Another thrust of research analyzes the impact of user selfishness from a game theoretic perspective, e.g., [22], [30].…”

Section: Applications Of Game Theory In Telecommunicationsmentioning

confidence: 99%

“…In another line of work, in [27], the authors have shown that the simplest form of physical layer cooperation, namely multi hop forwarding, is an indispensable element in achieving the optimal capacity scaling law in networks with asymptotically large numbers of nodes. Multi-hop forwarding has also been shown to offer significant gains in the efficiency of energy limited wireless networks [28], [29]. These physical layer studies assume that each user is willing to expend energy in forwarding packets for other users.…”

Section: Applications Of Game Theory In Telecommunicationsmentioning

confidence: 99%

Theory of Games: an Introduction

Raoof¹,

Al-Raweshidy²

2010

Game Theory

View full text Add to dashboard Cite

“…A preference relationship is defined as a complete and transitive binary relationship between the elements of a given set [45]. In general, we denote by m the preference relationship of player m, where b m a indicates that player m prefers b to a.…”

mentioning

confidence: 99%

Graph-Based Joint User-Centric Overlapped Clustering and Resource Allocation in Ultradense Networks

Lin

Zhang

et al. 2018

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-With the increase of access point (AP) density and the exponential growth of mobile devices supported by ultra dense networks (UDNs), user-centric overlapped clustering relying on AP cooperation is becoming a promising design principle for guaranteeing the quality of service (QoS) required by each UE. This ambitious goal can be achieved by the joint design of user-centric overlapped clustering and resource allocation. In this context, both the traffic-load balancing and the limited availability of orthogonal resource blocks (RBs) have to be carefully considered in UDNs. To tackle these challenges, we formulate a joint user-centric overlapped clustering and resource allocation problem with the goal of maximizing the system's spectral efficiency (SE). To efficiently solve this problem, it is decoupled into two subproblems, which can be solved independently with the aid of our graph-theoretical framework. We first develop a novel distributed three-stage user-centric clustering solution, which is aware of the APs' traffic-loads. Then, based on the overlapped clusters constructed, we propose a novel two-stage graph-based user-centric resource allocation scheme for mitigating the resultant inter-cluster interference, despite the limited availability of orthogonal RBs. Our numerical results confirm the benefits of the proposed framework and show that it outperforms the benchmark solutions in terms of both its per area aggregated user rate (PAAR) and user rate.

show abstract

Game Theory for Wireless Engineers

Cited by 308 publications

References 30 publications

A formal model based on Game Theory for the analysis of cooperation in distributed service discovery

A formal model based on Game Theory for the analysis of cooperation in distributed service discovery

Theory of Games: an Introduction

Graph-Based Joint User-Centric Overlapped Clustering and Resource Allocation in Ultradense Networks

Contact Info

Product

Resources

About