English

State Information in Bayesian Games

Information Theory 2009-11-05 v1 Cryptography and Security Computer Science and Game Theory math.IT

Abstract

Two-player zero-sum repeated games are well understood. Computing the value of such a game is straightforward. Additionally, if the payoffs are dependent on a random state of the game known to one, both, or neither of the players, the resulting value of the game has been analyzed under the framework of Bayesian games. This investigation considers the optimal performance in a game when a helper is transmitting state information to one of the players. Encoding information for an adversarial setting (game) requires a different result than rate-distortion theory provides. Game theory has accentuated the importance of randomization (mixed strategy), which does not find a significant role in most communication modems and source coding codecs. Higher rates of communication, used in the right way, allow the message to include the necessary random component useful in games.

Keywords

Cite

@article{arxiv.0911.0874,
  title  = {State Information in Bayesian Games},
  author = {Paul Cuff},
  journal= {arXiv preprint arXiv:0911.0874},
  year   = {2009}
}

Comments

Presented at Allerton 2009, 6 pages, 5 eps figures, uses IEEEtran.cls

R2 v1 2026-06-21T14:07:35.963Z