Characterizing Solution Concepts in Games Using Knowledge-Based Programs
Joseph Y. Halpern, Yoram Moses
Abstract
We show how solution concepts in games such as Nash equilibrium, correlated equilibrium, rationalizability, and sequential equilibrium can be given a uniform definition in terms of knowledge-based programs. Intuitively, all solution concepts are implementations of two knowledge-based programs, one appropriate for games represented in normal form, the other for games represented in extensive form. These knowledge-based programs can be viewed as embodying rationality. The representation works even if (a) information sets do not capture an agent's knowledge, (b) uncertainty is not represented by probability, or (c) the underlying game is not common knowledge.
Create a lesson
Related papers
Algorithms for Robbins' Problem using Markov Decision Processes
Léonard Brice, F. Thomas Bruss, Anirban Majumdar et al.
Token-Level Advertising
Hanbing Liu, Bowei Zhang, Changyuan Yu et al.
Blindfolded pursuit with delays of your choice
Torben Schürenberg, Maximilian J. Stahlberg
Robust Lottery Compression for Metric Voting: A Transfer Principle for Bounded Randomness
Jianhao Jia, Bo Peng
A lone divider allocation algorithm with subjective divisibility
Uriel Feige
Trusting AI in Competitive Markets
Jussi Keppo, Yuze Li, Gerry Tsoukalas et al.