Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA New Perspective on Multi-user Power Control Games in Interference Channels
130
0
0.0
(
0
)
Added by
Yi Su
Publication date
2008
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic 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 users 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.
rate research
Read More
In this paper, we consider the problem of wireless power control in an interference channel where transmitters aim to maximize their own benefit. When the individual payoff or utility function is derived from the transmission efficiency and the spent power, previous works typically study the Nash equilibrium of the resulting power control game. We propose to introduce concepts of correlated and communication equilibria from game theory to find efficient solutions (compared to the Nash equilibrium) for this problem. Communication and correlated equilibria are analyzed for the power control game, and we provide algorithms that can achieve these equilibria. Simulation results demonstrate that the correlation is beneficial under some settings, and the players achieve better payoffs.
Spatial interference avoidance is a simple and effective way of mitigating interference in multi-antenna wireless networks. The deployment of this technique requires channel-state information (CSI) feedback from each receiver to all interferers, resulting in substantial network overhead. To address this issue, this paper proposes the method of distributive control that intelligently allocates CSI bits over multiple feedback links and adapts feedback to channel dynamics. For symmetric channel distributions, it is optimal for each receiver to equally allocate the average sum-feedback rate for different feedback links, thereby decoupling their control. Using the criterion of minimum sum-interference power, the optimal feedback-control policy is shown using stochastic-optimization theory to exhibit opportunism. Specifically, a specific feedback link is turned on only when the corresponding transmit-CSI error is significant or interference-channel gain large, and the optimal number of feedback bits increases with this gain. For high mobility and considering the sphere-cap-quantized-CSI model, the optimal feedback-control policy is shown to perform water-filling in time, where the number of feedback bits increases logarithmically with the corresponding interference-channel gain. Furthermore, we consider asymmetric channel distributions with heterogeneous path losses and high mobility, and prove the existence of a unique optimal policy for jointly controlling multiple feedback links. Given the sphere-cap-quantized-CSI model, this policy is shown to perform water-filling over feedback links. Finally, simulation demonstrates that feedback-control yields significant throughput gains compared with the conventional differential-feedback method.
Incentive mechanisms for crowdsourcing have been extensively studied under the framework of all-pay auctions. Along a distinct line, this paper proposes to use Tullock contests as an alternative tool to design incentive mechanisms for crowdsourcing. We are inspired by the conduciveness of Tullock contests to attracting user entry (yet not necessarily a higher revenue) in other domains. In this paper, we explore a new dimension in optimal Tullock contest design, by superseding the contest prize---which is fixed in conventional Tullock contests---with a prize function that is dependent on the (unknown) winners contribution, in order to maximize the crowdsourcers utility. We show that this approach leads to attractive practical advantages: (a) it is well-suited for rapid prototyping in fully distributed web agents and smartphone apps; (b) it overcomes the disincentive to participate caused by players antagonism to an increasing number of rivals. Furthermore, we optimize conventional, fixed-prize Tullock contests to construct the most superior benchmark to compare against our mechanism. Through extensive evaluations, we show that our mechanism significantly outperforms the optimal benchmark, by over three folds on the crowdsourcers utility cum profit and up to nine folds on the players social welfare.
We investigate a class of weighted voting games for which weights are randomly distributed over the standard probability simplex. We provide close-formed formulae for the expectation and density of the distribution of weight of the $k$-th largest player under the uniform distribution. We analyze the average voting power of the $k$-th largest player and its dependence on the quota, obtaining analytical and numerical results for small values of $n$ and a general theorem about the functional form of the relation between the average Penrose--Banzhaf power index and the quota for the uniform measure on the simplex. We also analyze the power of a collectivity to act (Coleman efficiency index) of random weighted voting games, obtaining analytical upper bounds therefor.
In this paper, a multi-user cooperative computing framework is applied to enable mobile users to utilize available computing resources from other neighboring users via direct communication links. An incentive scheme based on Bertrand game is proposed for the user to determine textit{who} and textit{how} to cooperate. We model the resource demand users as textit{buyers} who aim to use minimal payments to maximize energy savings, whereas resource supply users as textit{sellers} who aim to earn payments for their computing resource provision. A Bertrand game against textit{buyers market} is formulated. When the users have textit{complete information} of their opponents, the Nash equilibrium (NE) of the game is obtained in closed form, while in the case of textit{incomplete information}, a distributed iterative algorithm is proposed to find the NE. The simulation results verify the effectiveness of the proposed scheme.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
