相关论文: Joint Sensing and Power Allocation in Nonconvex Co…
As data traffic grows, wireless systems shift to higher frequency bands (6 GHz and above), where radar systems also operate. This coexistence demands effective interference management and efficient wideband utilization. Cognitive Radio (CR)…
This paper studies random reshuffling (RR)-based distributed Nash equilibrium seeking for noncooperative games. The game is motivated as a sample-average approximation of an underlying expected-value stochastic game, while the algorithmic…
The cognitive radio (CR) network is a promising network architecture that meets the requirement of enhancing scarce radio spectrum utilization. Meanwhile, reconfigurable intelligent surfaces (RIS) is a promising solution to enhance the…
We consider multi-agent decision making, where each agent optimizes its cost function subject to constraints. Agents' actions belong to a compact convex Euclidean space and the agents' cost functions are coupled. We propose a distributed…
Over the last decade, combinatorial algorithms have been obtained for exactly solving several nonlinear convex programs. We first provide a formal context to this activity by introducing the notion of {\em rational convex programs} -- this…
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…
We design a distributed algorithm to seek generalized Nash equilibria of a robust game with uncertain coupled constraints. Due to the uncertainty of parameters in set constraints, we aim to find a generalized Nash equilibrium in the worst…
We introduce Cut-and-Play, a practically-efficient algorithm for computing Nash equilibria in simultaneous non-cooperative games where players decide via nonconvex and possibly unbounded optimization problems with separable payoff…
In this paper, we introduce a distributed dynamic routing algorithm for secondary users (SUs) to minimize their interference with the primary users (PUs) in multi-hop cognitive radio (CR) networks. We use the medial axis with a relaxation…
The property of the communication network and the constraints on the strategic space are two factors that determine the complexity of the distributed Nash equilibrium (DNE) seeking problem. The DNE seeking problem of aggregative games has…
In this paper, the problem of finding a generalized Nash equilibrium (GNE) of a networked game is studied. Players are only able to choose their decisions from a feasible action set. The feasible set is considered to be a private linear…
We consider a class of dynamic collective choice models with social interactions, whereby a large number of non-uniform agents have to individually settle on one of multiple discrete alternative choices, with the relevance of their would-be…
For multi-user transmissions over MIMO interference channels, each user designs the transmit covariance matrix to maximize its information rate. When passive radio-frequency (RF) energy harvesters are present in the network, the…
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 this paper, we enable the coexistence of multiple wireless body area networks (BANs) using a finite repeated non-cooperative game for transmit power control. With no coordination amongst these personal sensor networks, the proposed game…
Feedback Nash equilibrium strategies in multi-agent dynamic games require availability of all players' state information to compute control actions. However, in real-world scenarios, sensing and communication limitations between agents make…
In this paper, we investigate a prescribed-time and fully distributed Nash Equilibrium (NE) seeking problem for continuous-time noncooperative games. By exploiting pseudo-gradient play and consensus-based schemes, various distributed NE…
Graphical games are a useful framework for modeling the interactions of (selfish) agents who are connected via an underlying topology and whose behaviors influence each other. They have wide applications ranging from computer science to…
This paper is focused on the cross-layer design problem of joint multiuser detection and power control for energy-efficiency optimization in a wireless data network through a game-theoretic approach. Building on work of Meshkati, et al.,…
Dynamic spectrum sharing is a promising technology to improve spectrum utilization in the future wireless networks. The flexible spectrum management provides new opportunities for licensed primary user and unlicensed secondary users to…