Network game with a probabilistic description of user types

Hongxia Shen, M Tamer Basar

Research output: Contribution to journalArticlepeer-review

Abstract

This paper presents a hierarchical network game of ISPs and users, and introduces three classes of network games based on information structure: complete information, partially incomplete information, and totally incomplete information. Following the approach developed in [5], the existence and uniqueness of the Nash equilibrium is established for the users' game under complete information (and thus also under partially incomplete information). Furthermore, a sufficient condition for the existence of a unique and stable pure strategy Bayesian equilibrium is obtained for a special two user case under totally incomplete information. The multiple user case with quadratic utility functions is also investigated. Our analysis concludes that incomplete information is a disadvantage for the ISP and the less aggressive users, but is advantageous for the more aggressive users. Also, numerical results indicate that whether the ISP benefits or not from partially incomplete information (users sharing information) compared with totally incomplete information is determined by the number of users.

Original languageEnglish (US)
Pages (from-to)4225-4230
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume4
StatePublished - 2004

Keywords

  • Complete information
  • Nash equilibrium
  • Noncooperative game
  • Partially incomplete information
  • Pure strategy Bayesian equilibrium
  • Stackelberg game
  • Totally incomplete information

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Safety, Risk, Reliability and Quality
  • Chemical Health and Safety

Fingerprint

Dive into the research topics of 'Network game with a probabilistic description of user types'. Together they form a unique fingerprint.

Cite this