The Analysis of Nash Equilibria of the One-Shot Random-Access Game for Wireless Networks and the Behavior of Selfish Nodes

Free registration required

Executive Summary

The authors address the fundamental question of whether or not there exist stable operating points in a network in which selfish nodes share a common channel, and if they exist, how the nodes behave at these stable operating points. They begin with a wireless communication network in which n nodes (agents), which might have different utility functions, contend for access on a common, wireless communication channel. They characterize this distributed multiple-access problem in terms of a one-shot random-access game, and then analyze the behavior of the nodes using the tools of game theory.

  • Format: PDF
  • Size: 859.54 KB