Efficient Equilibrium Concepts in Non-cooperative Network Formation
We review here some recently proposed models of non-cooperative network creation games where the nodes of a network perform edge swaps in order to improve their communication costs. Our focus is on examining the structure of stable (equilibrium) networks that correspond to efficient notions of equil...
        Saved in:
      
    
          | Published in | Algorithms, Probability, Networks, and Games Vol. 9295; pp. 384 - 395 | 
|---|---|
| Main Author | |
| Format | Book Chapter | 
| Language | English | 
| Published | 
        Switzerland
          Springer International Publishing AG
    
        2015
     Springer International Publishing  | 
| Series | Lecture Notes in Computer Science | 
| Subjects | |
| Online Access | Get full text | 
| ISBN | 9783319240237 3319240234  | 
| ISSN | 0302-9743 1611-3349  | 
| DOI | 10.1007/978-3-319-24024-4_22 | 
Cover
| Summary: | We review here some recently proposed models of non-cooperative network creation games where the nodes of a network perform edge swaps in order to improve their communication costs. Our focus is on examining the structure of stable (equilibrium) networks that correspond to efficient notions of equilibria, in the sense that the nodes of the network are able to decide which links to add and which to remove in order to achieve a minimal cost, given the strategies of the other nodes. We also review results on the capability of the network nodes of converging into an equilibrium network by performing local selfish improvement steps. | 
|---|---|
| Bibliography: | This work was partially supported by the European Social Fund and Greek national funds through the research funding program Thales on “Algorithmic Game Theory” and by the EU ERC Project “ALGAME”. | 
| ISBN: | 9783319240237 3319240234  | 
| ISSN: | 0302-9743 1611-3349  | 
| DOI: | 10.1007/978-3-319-24024-4_22 |