Generalized Satisfaction Equilibrium for Service-Level Provisioning in Wireless Networks

  title={Generalized Satisfaction Equilibrium for Service-Level Provisioning in Wireless Networks},
  author={Mathew Goonewardena and Samir Medina Perlaza and Animesh Yadav and Wessam Ajib},
  journal={IEEE Transactions on Communications},
In this paper, a generalization of the satisfaction equilibrium (SE) for games in satisfaction form (SF) is presented. This new solution concept is referred to as the generalized satisfaction equilibrium (GSE). In games in SF, players choose their actions to satisfy an individual constraint that depends on the actions of all the others. At a GSE, players that are unsatisfied are unable to unilaterally deviate to be satisfied. The concept of GSE generalizes the SE in the sense that it allows… 

Figures from this paper

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.

Minimizing Base Stations’ ON/OFF Switchings in Self-Organizing Heterogeneous Networks: A Distributed Satisfactory Framework

The ON/OFF switching problem as a satisfaction game, where BSs seek to meet certain performance constraints in order to avoid the frequent BS switchings is formulated and a regret-based satisfaction algorithm and a satisfaction equilibrium search algorithm are applied.

Quality-of-Service Satisfaction Games for Noncooperative Underwater Acoustic Communications

Decentralized resource sharing for multiple noncooperative underwater acoustic (UWA) communication links is investigated and gains are shown both in terms of probability of QoS satisfaction and power consumed, even when a minimal knowledge of the environment is considered.

Distributed radio resource allocation in wireless heterogeneous networks

This thesis demonstrates that the HetSNets are amenable to self-organization, albeit with adapted incentives and equilibria to fit the wireless environment, and presents the generalized satisfaction equilibrium (GSE) for games in satisfaction-form.

A Paradigm Shift Toward Satisfaction, Realism and Efficiency in Wireless Networks Resource Sharing

This article argues and demonstrates that not only the stability of these solutions depends on whether or not each user achieves the highest performance possible, but they do not properly reflect in reality the most desirable operation points from both the user and system point of view.

On a Fixed Point Theorem for General Multivalued Mappings on Finite Sets with Applications in Game Theory

We propose a new fixed point theorem that completely characterizes the existence of fixed points for multivalued maps on finite sets. Our result can be seen as a generalization of Abian’s fixed point

Information-Centric Massive IoT-Based Ubiquitous Connected VR/AR in 6G: A Proposed Caching Consensus Approach

The information-centric massive Internet of Things (IC-mIoT) suitable for 6G large-scale VR/AR content distribution is proposed to improve the efficiency of IC-m IoT and fully guarantee the Quality of Service (QoS) of users.

On Decision Making In Human-Machine Networks

  • Baocheng GengP. Varshney
  • Computer Science
    2019 IEEE 16th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)
  • 2019
This paper discusses some aspects of human-machine networks by focusing on three schemes that include collaborative human decision making with random local thresholds, decision fusion in integrated human- machine networks and binary decision making under cognitive biases.



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.

Frequency allocation game in satisfaction form

In this paper, we analyse frequency allocation in wireless networks through a game in satisfaction form. Satisfaction form games are games without any optimisation aspects where a player is either

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.

Energy-efficient resource allocation in wireless networks with quality-of-service constraints

It is shown that the QoS requirements of a user translate into a "size" for the user which is an indication of the amount of network resources consumed by the user, and a closed-form expression for the utility achieved at equilibrium is obtained.

Existence of Equilibria in Joint Admission and Power Control for Inelastic Traffic

This letter considers the problem of admission and discrete power control, in the interfering-multiple-access channel, with rate constraints on admitted links, and the resulting Bayesian game is proven to possess at least one pure Bayesian-Nash equilibrium in on-off threshold strategies.

Quality of Service Games for Spectrum Sharing

This paper presents a game theoretic model for spectrum sharing, where users seek to satisfy their QoS demands in a distributed fashion, and proves that better response updating is still guaranteed to reach a pure Nash equilibrium in this more general spatial QoS satisfaction game.

Distributed power allocation with SINR constraints using trial and error learning

This paper model the network as a parallel Gaussian interference channel and introduces a fully decentralized algorithm able to statistically achieve a configuration where the performance demands are met, and shows that the converging points correspond to equilibrium points, namely Nash and satisfaction equilibrium.

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.

MIMO Cognitive Radio: A Game Theoretical Approach

This paper proposes and analyzes a totally decentralized approach, based on game theory, to design cognitive MIMO transceivers, who compete with each other to maximize their information rate through totally distributed and asynchronous algorithms.