You are previewing Game Theory in Wireless and Communication Networks.
O'Reilly logo
Game Theory in Wireless and Communication Networks

Book Description

This unified treatment of game theory focuses on finding state-of-the-art solutions to issues surrounding the next generation of wireless and communications networks. Future networks will rely on autonomous and distributed architectures to improve the efficiency and flexibility of mobile applications, and game theory provides the ideal framework for designing efficient and robust distributed algorithms. This 2001 book enables readers to develop a solid understanding of game theory, its applications and its use as an effective tool for addressing wireless communication and networking problems. The key results and tools of game theory are covered, as are various real-world technologies including 3G networks, wireless LANs, sensor networks, dynamic spectrum access and cognitive networks. The book also covers a wide range of techniques for modeling, designing and analysing communication networks using game theory, as well as state-of-the-art distributed design techniques. This is an ideal resource for communications engineers, researchers, and graduate and undergraduate students.

Table of Contents

  1. Cover
  2. Half Title
  3. Title Page
  4. Copyright
  5. Dedication
  6. Contents
  7. Preface
  8. 1. Introduction
    1. 1.1 Brief introduction to the history of game theory
    2. 1.2 Game theory in wireless and communication networks
    3. 1.3 Organization and targeted audience
      1. 1.3.1 Timeliness of the book
      2. 1.3.2 Outline of the book
  9. 2. Wireless networks: an introduction
    1. 2.1 Wireless channel models
      1. 2.1.1 Radio propagation
      2. 2.1.2 Interference channel
    2. 2.2 Categorization of wireless networks
      1. 2.2.1 3G cellular networks and beyond
      2. 2.2.2 WiMAX networks
      3. 2.2.3 WiFi networks
      4. 2.2.4 Wireless personal area networks
      5. 2.2.5 Wireless ad hoc networks
      6. 2.2.6 Wireless sensor networks
    3. 2.3 Advanced wireless technology
      1. 2.3.1 OFDM technology
      2. 2.3.2 Multiple-antenna systems
      3. 2.3.3 Cognitive radio
  10. Part I: Fundamentals of game theory
    1. 3. Non-cooperative games
      1. 3.1 Non-cooperative games: preliminaries
        1. 3.1.1 Introduction
        2. 3.1.2 Basics of non-cooperative games
      2. 3.2 Non-cooperative games in strategic form
        1. 3.2.1 Matrix games
        2. 3.2.2 Dominating strategies
        3. 3.2.3 Nash equilibrium
        4. 3.2.4 Static continuous-kernel games
        5. 3.2.5 Mixed strategies
        6. 3.2.6 Efficiency and equilibrium selection
      3. 3.3 Dynamic non-cooperative games
        1. 3.3.1 Non-cooperative games in extensive form
        2. 3.3.2 Repeated games
        3. 3.3.3 Stochastic games
      4. 3.4 Special classes of non-cooperative games
        1. 3.4.1 Potential games
        2. 3.4.2 Stackelberg games
        3. 3.4.3 Correlated equilibrium
        4. 3.4.4 Supermodular games
        5. 3.4.5 Wardrop equilibrium
      5. 3.5 Summary
    2. 4. Bayesian games
      1. 4.1 Overview of Bayesian games
        1. 4.1.1 Simple example
        2. 4.1.2 Static Bayesian game
        3. 4.1.3 Bayesian dynamic games in extensive form
        4. 4.1.4 Cournot duopoly model with incomplete information
        5. 4.1.5 Auction with incomplete information
      2. 4.2 Applications in wireless communications and networking
        1. 4.2.1 Packet-forwarding game
        2. 4.2.2 K-player Bayesian water-filling game
        3. 4.2.3 Channel-access game
        4. 4.2.4 Bandwidth-auction game
        5. 4.2.5 Bandwidth-allocation game
      3. 4.3 Summary
    3. 5. Differential games
      1. 5.1 Optimal-control theory
        1. 5.1.1 Dynamic programming
        2. 5.1.2 The maximum principle
      2. 5.2 Differential games
        1. 5.2.1 Main ingredients and general results
        2. 5.2.2 Stackelberg differential game
      3. 5.3 Applications of differential games in wireless communications and networking
      4. 5.4 Summary
    4. 6. Evolutionary games
      1. 6.1 The evolutionary process
        1. 6.1.1 Evolutionarily stable strategies
        2. 6.1.2 Replicator dynamics
        3. 6.1.3 The evolutionary game and reinforcement learning
      2. 6.2 Applications of evolutionary games in wireless communications and networking
        1. 6.2.1 Congestion control
        2. 6.2.2 Evolutionary game for the Aloha protocol
        3. 6.2.3 Evolutionary game for WCDMA access
        4. 6.2.4 Routing-potential game
        5. 6.2.5 Cooperative sensing in cognitive radio
        6. 6.2.6 TCP throughput adaptation
        7. 6.2.7 User churning behavior
        8. 6.2.8 Dynamic bandwidth allocation with evolutionary network selection
      3. 6.3 Summary
    5. 7. Cooperative games
      1. 7.1 Bargaining theory
        1. 7.1.1 Introduction
        2. 7.1.2 The Nash bargaining solution
        3. 7.1.3 Sample applications in wireless and communication networks
      2. 7.2 Coalitional game theory: basics
        1. 7.2.1 Introduction
        2. 7.2.2 Coalitional-game theory: preliminaries
      3. 7.3 Class I: canonical coalitional games
        1. 7.3.1 Main properties of canonical coalitional games
        2. 7.3.2 The core as a solution for canonical coalitional games
        3. 7.3.3 The Shapley value
        4. 7.3.4 The nucleolus
        5. 7.3.5 Sample applications in wireless and communication networks
      4. 7.4 Class II: coalition-formation games
        1. 7.4.1 Main properties of coalition-formation games
        2. 7.4.2 Impact of a coalitional structure on solution concepts for canonical coalitional games
        3. 7.4.3 Dynamic coalition-formation algorithms
        4. 7.4.4 Sample applications in wireless and communication networks
      5. 7.5 Class III: coalitional graph games
        1. 7.5.1 Main properties of coalitional graph games
        2. 7.5.2 Coalitional graph games and network-formation games
        3. 7.5.3 Sample applications in wireless and communication networks
      6. 7.6 Summary
    6. 8. Auction theory and mechanism design
      1. 8.1 Introduction and auction basics
      2. 8.2 Mechanism design
        1. 8.2.1 Equilibrium concepts
        2. 8.2.2 Participation and incentive compatibility
        3. 8.2.3 Revelation principle
        4. 8.2.4 Budget balance and efficiency
        5. 8.2.5 Groves mechanism
        6. 8.2.6 Impossibility and possibility
      3. 8.3 Special auctions
        1. 8.3.1 VCG auction
        2. 8.3.2 Share auction
        3. 8.3.3 Double auction
      4. 8.4 Examples of communication applications
        1. 8.4.1 Cognitive radio
        2. 8.4.2 Physical-layer security
      5. 8.5 Summary
  11. Part II: Applications of game theory in communications and networking
    1. 9. Cellular and broadband wireless access networks
      1. 9.1 Uplink power control in CDMA networks
        1. 9.1.1 Single-cell CDMA networks
        2. 9.1.2 Multi-cell wireless CDMA networks
      2. 9.2 Resource allocation in single-cell OFDMA networks
        1. 9.2.1 OFDMA resource-allocation model
        2. 9.2.2 Nash bargaining solution for subcarrier allocation
        3. 9.2.3 Algorithms for reaching the Nash bargaining solution
      3. 9.3 Power allocation in femtocell networks
        1. 9.3.1 Femtocell power control as a Stackelberg game
        2. 9.3.2 Multi-leader multi-follower Stackelberg equilibrium
        3. 9.3.3 Algorithm for reaching the Stackelberg equilibrium
      4. 9.4 IEEE 802.16 broadband wireless access networks
        1. 9.4.1 Resource allocation and admission control
        2. 9.4.2 Relay-station deployment in IEEE 802.16j
      5. 9.5 Network selection in multi-technology wireless networks
        1. 9.5.1 Network selection as a non-cooperative game
        2. 9.5.2 Network selection with incomplete information
      6. 9.6 Summary
    2. 10. Wireless local area networks
      1. 10.1 MAC protocol design
        1. 10.1.1 Static game
        2. 10.1.2 Dynamic game
        3. 10.1.3 Deviation detection and penalization
        4. 10.1.4 Related work
      2. 10.2 Random-access control
        1. 10.2.1 Choice of utility function
        2. 10.2.2 Dynamics of a random-access game
        3. 10.2.3 Extension with propagation delay and estimation error
        4. 10.2.4 Related work
      3. 10.3 Rate selection for VoIP service on WLAN
        1. 10.3.1 Game formulation
        2. 10.3.2 Payoff function
      4. 10.4 Access-point selection
        1. 10.4.1 Formulation of a population game
        2. 10.4.2 Price of anarchy
        3. 10.4.3 Access pricing
        4. 10.4.4 Related work
      5. 10.5 Admission control
        1. 10.5.1 Two-player game formulation
        2. 10.5.2 Interpretation of payoff
      6. 10.6 WiFi access-point pricing
        1. 10.6.1 Pricing scheme for direct payment
        2. 10.6.2 User with Web browsing
        3. 10.6.3 User with file transfer
        4. 10.6.4 Model for uncertain application
      7. 10.7 Summary
    3. 11. Multi-hop networks
      1. 11.1 Routing-game basics
      2. 11.2 Cooperation enforcement and learning using a repeated game
        1. 11.2.1 System model and problem formulation
        2. 11.2.2 Self-learning cooperation-enforcing framework
        3. 11.2.3 Asynchronous network
        4. 11.2.4 Case analysis and performance evaluations
      3. 11.3 Hierarchical routing using a network-formation game
        1. 11.3.1 System model and game formulation
        2. 11.3.2 Hierarchical network-formation game solution
        3. 11.3.3 Hierarchical network-formation algorithm
        4. 11.3.4 Simulation results and analysis
      4. 11.4 Other typical approaches
        1. 11.4.1 Price-based solution
        2. 11.4.2 Truthfulness and security using auction theory
        3. 11.4.3 Evolutionary-game approach
      5. 11.5 Summary
    4. 12. Cooperative-transmission networks
      1. 12.1 Basics of cooperative transmission
        1. 12.1.1 Cooperative-transmission protocols
        2. 12.1.2 State of the art and impact on different layers
      2. 12.2 Non-cooperative game for relay selection and power control
        1. 12.2.1 Relay-selection and power-control problem
        2. 12.2.2 Stackelberg-game approach
      3. 12.3 Auction-theory-based resource allocation
        1. 12.3.1 Resource-allocation objectives
        2. 12.3.2 Share-auction approach
      4. 12.4 Cooperative transmission using a cooperative game in MANET
        1. 12.4.1 Selfishness in packet-forwarding networks
        2. 12.4.2 Cooperative transmission using a coalitional game
      5. 12.5 Cooperative routing
        1. 12.5.1 Cooperative-routing algorithms
        2. 12.5.2 WiMAX IEEE 802.16j
      6. 12.6 Summary
    5. 13. Cognitive-radio networks
      1. 13.1 Cooperative spectrum sensing
        1. 13.1.1 System model
        2. 13.1.2 Coalitional-game formulation
        3. 13.1.3 Centralized approach and performance comparison
      2. 13.2 Power allocation as a non-cooperative game
        1. 13.2.1 Underlay spectrum access and power allocation
        2. 13.2.2 Properties of the Nash equilibrium for power allocation
        3. 13.2.3 Distributed algorithm
        4. 13.2.4 Pigouvian taxation and social optimality
        5. 13.2.5 Related work
      3. 13.3 Medium access control
        1. 13.3.1 Channel allocation
        2. 13.3.2 Channel access
        3. 13.3.3 Distributed algorithms
      4. 13.4 Decentralized dynamic spectrum access
        1. 13.4.1 Overlay dynamic spectrum access
        2. 13.4.2 Utility function
        3. 13.4.3 Decentralized algorithm for channel access
        4. 13.4.4 Alternative algorithms
      5. 13.5 Radio resource competition based on a stochastic learning game
        1. 13.5.1 System model of radio resource competition
        2. 13.5.2 Auction mechanism
        3. 13.5.3 Secondary-user strategy
        4. 13.5.4 Learning algorithm
      6. 13.6 Cheat-proof strategies for open spectrum sharing
        1. 13.6.1 One-shot non-cooperative game
        2. 13.6.2 Cooperative strategy
        3. 13.6.3 Repeated games
        4. 13.6.4 Cheat-proof strategy
      7. 13.7 Spectrum leasing and cooperation
        1. 13.7.1 Game formulation with instantaneous CSI
        2. 13.7.2 Game formulation with long-term CSI
      8. 13.8 Service-provider competition for dynamic spectrum allocation
        1. 13.8.1 User demand
        2. 13.8.2 Optimal price
        3. 13.8.3 Related work
      9. 13.9 Summary
    6. 14. Internet networks
      1. 14.1 Combined flow control and routing in communication networks
        1. 14.1.1 Single user with multiple links
        2. 14.1.2 Multiple users with multiple parallel links
        3. 14.1.3 Sample Nash equilibria
      2. 14.2 Congestion control in networks with a single service provider
        1. 14.2.1 Pricing and congestion control
        2. 14.2.2 Non-cooperative Nash game between followers
        3. 14.2.3 Optimal pricing policy for the service provider
        4. 14.2.4 Network with a large number of followers
      3. 14.3 Pricing and revenue sharing for Internet service providers
        1. 14.3.1 Pricing game among Internet service providers
        2. 14.3.2 Revenue-sharing strategies
        3. 14.3.3 Distributed algorithm for finding a Nash equilibrium
      4. 14.4 Cooperative file sharing in peer-to-peer networks
        1. 14.4.1 Cooperative vs. non-cooperative file sharing
        2. 14.4.2 File sharing as a coalitional game in partition form
        3. 14.4.3 Distributed algorithm for coalition formation
        4. 14.4.4 Coalition formation in two-peer and N-peer networks
      5. 14.5 Summary
  12. References
  13. Index