Game Theory for Networks. Third International ICST Conference, GameNets 2012, Vancouver, BC, Canada, May 24-26, 2012, Revised Selected Papers

Research Article

Achievability of Efficient Satisfaction Equilibria in Self-Configuring Networks

Download
382 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-35582-0_1,
        author={Fran\`{e}ois M\^{e}riaux and Samir Perlaza and Samson Lasaulce and Zhu Han and Vincent Poor},
        title={Achievability of Efficient Satisfaction Equilibria in Self-Configuring Networks},
        proceedings={Game Theory for Networks. Third International ICST Conference, GameNets 2012, Vancouver, BC, Canada, May 24-26, 2012, Revised Selected Papers},
        proceedings_a={GAMENETS},
        year={2012},
        month={12},
        keywords={Supermodular games Power control Efficient Satisfaction Equilibrium Games in Satisfaction Form},
        doi={10.1007/978-3-642-35582-0_1}
    }
    
  • François Mériaux
    Samir Perlaza
    Samson Lasaulce
    Zhu Han
    Vincent Poor
    Year: 2012
    Achievability of Efficient Satisfaction Equilibria in Self-Configuring Networks
    GAMENETS
    Springer
    DOI: 10.1007/978-3-642-35582-0_1
François Mériaux1, Samir Perlaza2, Samson Lasaulce1, Zhu Han3, Vincent Poor2
  • 1: CNRS-SUPELEC-Paris Sud
  • 2: Princeton University
  • 3: University of Houston

Abstract

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.