Quality-Of-Service Provisioning in Decentralized Networks: A Satisfaction Equilibrium Approach

  title={Quality-Of-Service Provisioning in Decentralized Networks: A Satisfaction Equilibrium Approach},
  author={Samir Medina Perlaza and Hamidou Tembine and Samson Lasaulce and M{\'e}rouane Debbah},
  journal={IEEE Journal of Selected Topics in Signal Processing},
This paper introduces a particular game formulation and its corresponding notion of equilibrium, namely the satisfaction form (SF) and the satisfaction equilibrium (SE). A game in SF models the case where players are uniquely interested in the satisfaction of some individual performance constraints, instead of individual performance optimization. Under this formulation, the notion of equilibrium corresponds to the situation where all players can simultaneously satisfy their individual… 

Figures from this paper

Generalized Satisfaction Equilibrium for Service-Level Provisioning in Wireless Networks

A generalization of the satisfaction equilibrium for games in satisfaction form (SF) is presented and Bayesian games in SF and the corresponding Bayesian GSE are introduced, providing a theoretical framework for studying service-level provisioning problems in communications networks.

Generalized Satisfaction Equilibrium: A Model for Service-Level Provisioning in Networks

A generalization of the existing notion of satisfaction equilibrium (SE) for games in satisfaction form, which is referred to as the generalized SE (GSE), is particularly adapted for modeling problems such as service-level provisioning in decentralized self configuration networks.

Achievability of Efficient Satisfaction Equilibria in Self-Configuring Networks

A behavioral rule that allows radio devices to achieve an efficient satisfaction equilibrium (ESE) in fully decentralized self-configuring networks (DSCNs) is presented and convergence from any initial action profile to an ESE is formally proved.

Learning efficient satisfaction equilibria via trial and error

  • S. PerlazaH. PoorZhu Han
  • Economics
    2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)
  • 2012
In this paper, the problem of quality-of-service (QoS) provisioning is formulated as a game in satisfaction form. The corresponding solution is shown to be either a satisfaction equilibrium (SE), an

Redesigning Resource Management in Wireless Networks based on Games in Satisfaction Form

It is proved that at the MESE point the system achieves the lowest possible cumulative cost, while each user individually is penalized with the minimum cost compared to the corresponding cost of any Efficient Satisfaction Equilibrium point.

A New Theoretical Evaluation Framework for Satisfaction Equilibria in Wireless Networks

Specific measures for evaluating the efficiency of various satisfaction equilibria, in a formal and quantitative manner, expressing the tradeoff with respect to the achieved utility or a given objective function and corresponding cost, are defined and analyzed.

A fully distributed satisfactory power control for QoS self-provisioning in 5G networks

It is shown that, at the ESE, no player can increase its Quality of Service without degrading the energy performance, and a fully distributed scheme based on the Banach-Picard algorithm is proposed and its qualitative properties are shown.

QoS Satisfaction Games for Spectrum Sharing-Technical Report

This study shows that the QoS satisfaction game has the finite improvement property, and the users can self-organize into a pure Nash equilibrium in polynomial time, and demonstrates that the worst casepure Nash equilibrium can be close to the global optimal solution when users’ QoS demands are not too diverse.

Distributed quality of service provision using coalitions and the Nash bargaining solution

The proposed scheduler offers better QoS outage performance than others and also offers fairness and sum rate that are comparable to the PF scheduler, while the comparison with the Greedy scheduler indicates significantly better fairness, but lower sum rate.



Satisfaction Equilibrium: A General Framework for QoS Provisioning in Self-Configuring Networks

It is proved that contrary to the (generalized) NE, at least one ESE always exists whenever the network is able to simultaneously support the individual QoS requests.

Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels

This paper considers the minimization of transmit power in Gaussian parallel interference channels, subject to a rate constraint for each user, as a (generalized) Nash equilibrium (NE) game and proposes two distributed algorithms based on the single user water-filling solution.

Nash Equilibrium Problems With Scaled Congestion Costs and Shared Constraints

A class of convex Nash games where strategy sets are coupled across agents through a common constraint and payoff functions are linked via a scaled congestion cost metric is considered, showing that the equilibrium is locally unique both in the primal space as well as in the larger primal-dual space.

Learning equilibria with partial information in decentralized wireless networks

A survey of several important equilibrium concepts for decentralized networks is presented, described in terms of information requirements and convergence properties, and illustrated by a simple case study, an interference channel with two transmitter-receiver pairs.

Convex Optimization, Game Theory, and Variational Inequality Theory

A unified view of some basic theoretical foundations and main techniques in convex optimization, game theory, and VI theory is provided, putting special emphasis on the generality of the VI framework, showing how it allows to tackle several interesting problems in nonlinear analysis, classical optimization, and equilibrium programming.

Satisfaction Equilibrium: Achieving Cooperation in Incomplete Information Games

This work introduces the satisfaction principle from which an equilibrium can arise as the result of the agents' individual learning experiences, and defines such an equilibrium and presents different algorithms that can be used to reach it.

Game theory and the design of self-configuring, adaptive wireless networks

This article presents applications of game theory to problems in random access and power control, and shows that game theoretic techniques can yield an optimal operating point without the intervention of an external controller.

Learning to Play a Satisfaction Equilibrium

In real life problems, agents are generally faced with situations where they only have partial or no knowledge about their environment and the other agents evolving in it. In this case all an agent

Constrained Games: The Impact of the Attitude to Adversary's Constraints

It is shown that the utilities of each player associated with that player's own performance and constraints are not sufficient to model a constrained game and to define equilibria; for the latter, one also needs to model how a player values the fact that other players meet their constraints.

Flexible design of cognitive radio wireless systems

The goal of this article is to show how many challenging unsolved resource allocation problems in the emerging field of cognitive radio (CR) networks fit naturally either in the game theoretical