相关论文: On the Base Station Selection and Base Station Sha…

Intelligent network selection plays an important role in achieving an effective data offloading in the integrated cellular and Wi-Fi networks. However, previously proposed network selection schemes mainly focused on offloading as much data…

In this paper, we deal with the problem of maximizing the profit of Network Operators (NOs) of green cellular networks in situations where Quality-of-Service (QoS) guarantees must be ensured to users, and Base Stations (BSs) can be shared…

In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists of various demands on different resources. The player's utility is at most the sum of these demands, provided they are fully satisfied. Every resource has a…

This paper studies a significant problem in green networking called switching off base stations in case of cooperating service providers by means of stochastic geometric and coalitional game tools. The coalitional game herein considered is…

Interactions among selfish users sharing a common transmission channel can be modeled as a non-cooperative game using the game theory framework. When selfish users choose their transmission probabilities independently without any…

As wireless communication becomes an ever-more evolving and pervasive part of the existing world, system capacity and Quality of Service (QoS) provisioning are becoming more critically evident. In order to improve system capacity and QoS,…

The use of orthogonal signaling schemes such as time-, frequency-, or code-division multiplexing (T-, F-, CDM) in multi-user systems allows for power-efficient simple receivers. It is shown in this paper that by using orthogonal signaling…

We consider multiple access games in which primary users are interested in maximizing their confidential data rate at the minimum possible transmission power and secondary users employ eavesdropping as a leverage to maximize their data rate…

In classical job-scheduling games, each job behaves as a selfish player, choosing a machine to minimize its own completion time. To reduce the equilibria inefficiency, coordination mechanisms are employed, allowing each machine to follow…

Distributed Opportunistic Scheduling (DOS) is inherently harder than conventional opportunistic scheduling due to the absence of a central entity that has knowledge of all the channel states. With DOS, stations contend for the channel using…

We consider the capacitated selfish replication (CSR) game with binary preferences, over general undirected networks. We first show that such games have an associated ordinary potential function, and hence always admit a pure-strategy Nash…

This paper investigates Nash equilibrium (NE) seeking problems for noncooperative games over multi-players networks with finite bandwidth communication. A distributed quantized algorithm is presented, which consists of local gradient play,…

We develop a stochastic game-theoretic model for intraday dispatch of grid-scale battery energy storage systems (BESSs). We assume that each BESS operator competitively manages her state-of-charge to maximize energy arbitrage revenues,…

In this paper, we propose a novel class of Nash problems for Cognitive Radio (CR) networks, modeled as Gaussian frequency-selective interference channels, wherein each secondary user (SU) competes against the others to maximize his own…

In this paper, an energy efficiency (EE) game in a MIMO multiple access channel (MAC) communication system is considered. The existence and the uniqueness of the Nash Equilibrium (NE) is affirmed. A bisection search algorithm is designed to…

This paper is concerned with the concept of equilibrium and quality of service (QoS) provisioning in self-configuring wireless networks with non-cooperative radio devices (RD). In contrast with the Nash equilibrium (NE), where RDs are…

A new game theoretical solution concept for open spectrum sharing in cognitive radio (CR) environments is presented, the Lorenz equilibrium (LE). Both Nash and Pareto solution concepts have limitations when applied to real world problems.…

In this paper we introduce a capacity allocation game which models the problem of maximizing network utility from the perspective of distributed noncooperative agents. Motivated by the idea of self-managed networks, in the developed…

We consider the uplink of a cellular massive MIMO network. Acquiring channel state information at the base stations (BSs) requires uplink pilot signaling. Since the number of orthogonal pilot sequences is limited by the channel coherence,…

Best response (BR) dynamics is a natural method by which players proceed toward a pure Nash equilibrium via a local search method. The quality of the equilibrium reached may depend heavily on the order by which players are chosen to perform…