A New Perspective on Multi-user Power Control Games in Interference Channels

Yi Su; Mihaela van der Schaar

Home/Archive/arXiv

arXiv · 0709.3880

A New Perspective on Multi-user Power Control Games in Interference Channels

Yi Su·Mihaela van der Schaar

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper considers the problem of how to allocate power among competing users sharing a frequency-selective interference channel. We model the interaction between selfish users as a non-cooperative game. As opposed to the existing iterative water-filling algorithm that studies the myopic users, this paper studies how a foresighted user, who knows the channel state information and response strategies of its competing users, should optimize its transmission strategy. To characterize this multi-user interaction, the Stackelberg equilibrium is introduced, and the existence of this equilibrium for the investigated non-cooperative game is shown. We analyze this interaction in more detail using a simple two-user example, where the foresighted user determines its transmission strategy by solving as a bi-level program which allows him to account for the myopic user's response. It is analytically shown that a foresighted user can improve its performance, if it has the necessary information about its competitors. Since the optimal solution of Stackelberg equilibrium is computationally prohibitive, we propose a practical low-complexity approach based on Lagrangian duality theory. Numerical simulations verify the performance improvements. Possible ways to acquire the required information and to extend the formulation to more than two users are also discussed.

Explore related subjects

cs.GT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Yi Su, Mihaela van der Schaar. 2008-12-16. A New Perspective on Multi-user Power Control Games in Interference Channels. https://arxiv.org/abs/0709.3880

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Selling to Non-linear Agents: A Demand-Based Auction

Auctions allocate scarce goods, from car licenses to online advertising, to buyers whose utilities are often not linear in money, as with budgets or risk aversion. We ask how a seller should sell to such buyers and what learning their preferences is worth. We propose demand-based auctions, which elicit demand curves and are dominant-strategy incentive compatible for any non-linear utilities. The revenue-maximizing one takes familiar second-price forms and is max-min optimal when the seller observes only demand curves. Under standard assumptions, learning risk attitudes beyond demand curves adds relatively little revenue, as does learning budgets unless they correlate with values.

cs.GT↗

arXiv2026

Voting with Partial Orders: The Plurality and Anti-Plurality Classes

In the theory of voting, the Plurality rule for preferences that come in the form of linear orders selects the alternatives most frequently appearing in the first position of those orders, while the Anti-Plurality rule selects the alternatives least often occurring in the final position. We explore extensions of these rules to preferences that are partial orders, offering axiomatic characterisations for them.

cs.GT↗

arXiv2026

Fair Division with Indivisible Goods, Chores, and Cake

We study the problem of fairly allocating indivisible items and a desirable heterogeneous divisible good (i.e., cake) to agents with additive utilities. In our paper, each indivisible item can be a good that yields non-negative utilities to some agents and a chore that yields negative utilities to the other agents. Given a fixed set of divisible and indivisible resources, we investigate almost envy-free allocations, captured by the natural fairness concept of envy-freeness for mixed resources (EFM). It requires that an agent $i$ not envy another agent $j$ if agent $j$'s bundle contains any piece of cake yielding positive utility to agent $i$ (i.e., envy-freeness), and that agent $i$ be envy-free up to one item (EF1) towards agent $j$ otherwise. We prove that with indivisible items and a cake, an EFM allocation always exists for any number of agents with additive utilities. We reduce the problem of showing the existence of EFM to the problem of proving the compatibility of EF1 and envy-freeability. An allocation of indivisible items is said to be envy-freeable if the allocation can be made envy-free by allocating a sufficient amount of money to each of the agents. We show that for indivisible items, an EF1 and envy-freeable allocation always exists. Moreover, such an allocation can be found in polynomial time. This result, in and of itself, is of independent interest.

cs.GT↗