Algorithms for Nash and Pareto Equilibria for Resource Allocation in Multiple Femtocells
نویسندگان
چکیده
We consider a cellular system with multiple Femtocells operating in a Macrocell. They are sharing a set of communication channels. Each Femtocell has multiple users requiring certain minimum rate guarantees. Each channel has a peak power constraint to limit interference to the Macro Base Station (BS). We formulate the problem of channel allocation and power control at the Femtocells as a noncooperative Game. We develop decentralized algorithms to obtain a Coarse Correlated equilibrium that satisfies the QoS of each user. If the QoS of all the users cannot be satisfied, then we obtain a fair equilibrium. Finally we also provide a decentralized algorithm to reach a Pareto and a Nash Bargaining solution which has a much lower complexity than the algorithm to compute the NE. KeywordsFemtocell, QoS, game theory, decentralized algorithms, Nash Bargaining.
منابع مشابه
Equilibria in Sequential Allocation
Sequential allocation is a simple mechanism for sharing multiple indivisible items. We study strategic behavior in sequential allocation. In particular, we consider Nash dynamics, as well as the computation and Pareto optimality of pure equilibria, and Stackelberg strategies. We first demonstrate that, even for two agents, better responses can cycle. We then present a linear-time algorithm that...
متن کاملMultiobjective Games and Determining Pareto-Nash Equilibria
We consider the multiobjective noncooperative games with vector payoff functions of players. Pareto-Nash equilibria conditions for such class of games are formulated and algorithms for determining Pareto-Nash equilibria are proposed. Mathematics subject classification: 90B10, 90C35, 90C27.
متن کاملA strategic approach to multiple estate division problems
The classical bankruptcy problem (O’Neill, 1982) is extended by assuming that there are multiple estates to be divided. In the finite case, there are finitely many estates and the agents have homogenous preferences, i.e., constant utilities, per estate, but preferences may differ across estates. In the general case, i.e., the infinite estate problem, players have arbitrary preferences over an i...
متن کاملLearning Near-Pareto-Optimal Conventions in Polynomial Time
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focus on repeated coordination games of non-identical interest where agents do not know the game structure up front and receive noisy payoffs. We design efficient near-optimal algorithms for both the perfect monitoring and...
متن کاملThe Adjusted Winner Procedure: Characterizations and Equilibria
The Adjusted Winner procedure is an important fair division mechanism proposed by Brams and Taylor for allocating goods between two parties. It has been used in practice for divorce settlements and analyzing political disputes. Assuming truthful declaration of the valuations, it computes an allocation that is envy-free, equitable and Pareto optimal. We show that Adjusted Winner admits several e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1703.07647 شماره
صفحات -
تاریخ انتشار 2017