TY - GEN
T1 - Satisfaction equilibrium
T2 - 53rd IEEE Global Communications Conference, GLOBECOM 2010
AU - Perlaza, Samir M.
AU - Tembine, Hamidou
AU - Lasaulce, Samson
AU - Debbah, Mérouane
PY - 2010
Y1 - 2010
N2 - This paper is concerned with the concept of equilibrium and quality of service (QoS) provisioning in self-configuring wireless networks with non-cooperative radio devices (RD). In contrast with the Nash equilibrium (NE), where RDs are interested in selfishly maximizing its QoS, we present a concept of equilibrium, named satisfaction equilibrium (SE), where RDs are interested only in guaranteing a minimum QoS. We provide the conditions for the existence and the uniqueness of the SE. Later, in order to provide an equilibrium selection framework for the SE, we introduce the concept of effort or cost of satisfaction, for instance, in terms of transmit power levels, constellation sizes, etc. Using the idea of effort, the set of efficient SE (ESE) is defined. At the ESE, transmitters satisfy their minimum QoS incurring in the lowest effort. We prove that contrary to the (generalized) NE, at least one ESE always exists whenever the network is able to simultaneously support the individual QoS requests. Finally, we provide a fully decentralized algorithm to allow self-configuring networks to converge to one of the SE relying only on local information.
AB - This paper is concerned with the concept of equilibrium and quality of service (QoS) provisioning in self-configuring wireless networks with non-cooperative radio devices (RD). In contrast with the Nash equilibrium (NE), where RDs are interested in selfishly maximizing its QoS, we present a concept of equilibrium, named satisfaction equilibrium (SE), where RDs are interested only in guaranteing a minimum QoS. We provide the conditions for the existence and the uniqueness of the SE. Later, in order to provide an equilibrium selection framework for the SE, we introduce the concept of effort or cost of satisfaction, for instance, in terms of transmit power levels, constellation sizes, etc. Using the idea of effort, the set of efficient SE (ESE) is defined. At the ESE, transmitters satisfy their minimum QoS incurring in the lowest effort. We prove that contrary to the (generalized) NE, at least one ESE always exists whenever the network is able to simultaneously support the individual QoS requests. Finally, we provide a fully decentralized algorithm to allow self-configuring networks to converge to one of the SE relying only on local information.
UR - http://www.scopus.com/inward/record.url?scp=79551622302&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79551622302&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2010.5685235
DO - 10.1109/GLOCOM.2010.5685235
M3 - Conference contribution
AN - SCOPUS:79551622302
SN - 9781424456383
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 6 December 2010 through 10 December 2010
ER -