Related papers: Distributed Multi-User Wireless Charging Power All…

We propose fully-distributed algorithms for Nash equilibrium seeking in aggregative games over networks. We first consider the case where local constraints are present and we design an algorithm combining, for each agent, (i) the projected…

In order to increase the penetration of electric vehicles, a network of fast charging stations that can provide drivers with a certain level of quality of service (QoS) is needed. However, given the strain that such a network can exert on…

Efficient distributed spectrum sharing mechanism is crucial for improving the spectrum utilization. The spatial aspect of spectrum sharing, however, is less understood than many other aspects. In this paper, we generalize a recently…

In this paper, a green wireless communication system in which base stations are powered by renewable energy sources is considered. This system consists of a capacity-constrained renewable power supplier (RPS) and a base station (BS) that…

This paper considers a distributed gossip approach for finding a Nash equilibrium in networked games on graphs. In such games a player's cost function may be affected by the actions of any subset of players. An interference graph is…

We consider multi-agent decision making where each agent's cost function depends on all agents' strategies. We propose a distributed algorithm to learn a Nash equilibrium, whereby each agent uses only obtained values of her cost function at…

Utility-based power allocation in wireless ad-hoc networks is inherently nonconvex because of the global coupling induced by the co-channel interference. To tackle this challenge, we first show that the globally optimal point lies on the…

Motivated by the massive deployment of power-hungry data centers for service provisioning, we examine the problem of routing in optical networks with the aim of minimizing traffic-driven power consumption. To tackle this issue, routing must…

We consider the framework of aggregative games, in which the cost function of each agent depends on his own strategy and on the average population strategy. As first contribution, we investigate the relations between the concepts of Nash…

Power system operators and electric utility companies often impose a coincident peak demand charge on customers when the aggregate system demand reaches its maximum. This charge incentivizes customers to strategically shift their peak usage…

When multiple users share a common link in direct transmission, packet loss and network collision may occur due to the simultaneous arrival of traffics at the source node. To tackle this problem, users may resort to an indirect path: the…

This paper investigates online stochastic aggregative games subject to local set constraints and time-varying coupled inequality constraints, where each player possesses a time-varying expectation-valued cost function relying on not only…

A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mechanisms. In this paper, we propose a framework of spatial…

In this paper, we aim to develop distributed continuous-time algorithms over directed graphs to seek the Nash equilibrium in a noncooperative game. Motivated by the recent consensus-based designs, we present a distributed algorithm with a…

We consider the problem of cooperation in distributed wireless networks of selfish and free transmitters aiming at maximizing their energy-efficiency. The strategy of each transmitter consists in choosing his power control (PC) policy. Two…

We design the first fully-distributed algorithm for generalized Nash equilibrium seeking in aggregative games on a time-varying communication network, under partial-decision information, i.e., the agents have no direct access to the…

We consider the problem of two wireless networks operating on the same (presumably unlicensed) frequency band. Pairs within a given network cooperate to schedule transmissions, but between networks there is competition for spectrum. To make…

This paper considers the problem of Nash equilibrium (NE) seeking in aggregative games, where the payoff function of each player depends on an aggregate of all players' actions. We present a distributed continuous time algorithm such that…

As the number of prosumers with distributed energy resources (DERs) grows, the conventional centralized operation scheme may suffer from conflicting interests, privacy concerns, and incentive inadequacy. In this paper, we propose an energy…

In a heterogeneous wireless cellular network, each user may be covered by multiple access points such as macro/pico/relay/femto base stations (BS). An effective approach to maximize the sum utility (e.g., system throughput) in such a…