Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Algorithms for closed under rational behavior (CURB) sets
Journal of Artificial Intelligence Research
Computing a self-confirming equilibrium in two-player extensive-form games
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Hi-index | 0.00 |
The adoption of Nash equilibrium (NE) in real--world settings is often impractical due to its too restrictive assumptions. Game theory and artificial intelligence provide alternative solution concepts. When knowledge about opponents utilities and types is not available, the appropriate solution concept for extensive--form games is the self--confirming equilibrium (SCE), which relaxes NE allowing agents to have incorrect beliefs off the equilibrium path. In this paper, we extend SCEs to capture situations in which a two--agent extensive--form game is played by heterogeneous populations of individuals that repeatedly match (e.g., eBay).