TY - GEN
T1 - Achievability of efficient satisfaction equilibria in self-configuring networks
AU - Mériaux, François
AU - Perlaza, Samir
AU - Lasaulce, Samson
AU - Han, Zhu
AU - Poor, Vincent
PY - 2012
Y1 - 2012
N2 - In this paper, a behavioral rule that allows radio devices to achieve an efficient satisfaction equilibrium (ESE) in fully decentralized self-configuring networks (DSCNs) is presented. The relevance of ESE in the context of DSCNs is that at such state, radio devices adopt a transmission/receive configuration such that they are able to simultaneously satisfy their individual quality-of-service (QoS) constraints. An ESE is also an efficient network configuration, i.e., individual QoS satisfaction is achieved by investing the lowest possible effort. Here, the notion of effort refers to a preference each radio device independently establishes among its own set of actions. In particular, the proposed behavioral rule requires less information than existing rules, as in the case of the classical best response dynamics and its variants. Sufficient conditions for convergence are presented in a general framework. Numerical results are provided in the context of a particular uplink power control scenario, and convergence from any initial action profile to an ESE is formally proved in this scenario. This property ensures the proposed rule to be robust to the dynamic arrival or departure of radio devices in the network.
AB - In this paper, a behavioral rule that allows radio devices to achieve an efficient satisfaction equilibrium (ESE) in fully decentralized self-configuring networks (DSCNs) is presented. The relevance of ESE in the context of DSCNs is that at such state, radio devices adopt a transmission/receive configuration such that they are able to simultaneously satisfy their individual quality-of-service (QoS) constraints. An ESE is also an efficient network configuration, i.e., individual QoS satisfaction is achieved by investing the lowest possible effort. Here, the notion of effort refers to a preference each radio device independently establishes among its own set of actions. In particular, the proposed behavioral rule requires less information than existing rules, as in the case of the classical best response dynamics and its variants. Sufficient conditions for convergence are presented in a general framework. Numerical results are provided in the context of a particular uplink power control scenario, and convergence from any initial action profile to an ESE is formally proved in this scenario. This property ensures the proposed rule to be robust to the dynamic arrival or departure of radio devices in the network.
KW - Efficient Satisfaction Equilibrium
KW - Games in Satisfaction Form
KW - Power control
KW - Supermodular games
UR - http://www.scopus.com/inward/record.url?scp=84873957476&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84873957476&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-35582-0_1
DO - 10.1007/978-3-642-35582-0_1
M3 - Conference contribution
AN - SCOPUS:84873957476
SN - 9783642355813
T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
SP - 1
EP - 15
BT - Game Theory for Networks - Third International ICST Conference, GameNets 2012, Revised Selected Papers
T2 - 3rd International ICST Conference on Game Theory for Networks, GameNets 2012
Y2 - 24 May 2012 through 26 May 2012
ER -