Bounded rationality, strategy simplification, and equilibrium (Q361802)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bounded rationality, strategy simplification, and equilibrium |
scientific article; zbMATH DE number 6199381
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounded rationality, strategy simplification, and equilibrium |
scientific article; zbMATH DE number 6199381 |
Statements
Bounded rationality, strategy simplification, and equilibrium (English)
0 references
19 August 2013
0 references
A new notion of equilibrium intended to capture maximally simplified strategies is introduced. However, the simplification procedure is more careful in a way that a player is not going to simplify if the simplification incents other players to deviate. Such equilibria are studied for two-player machine games, where each player chooses a finite-state automaton representing a strategy in an infinitely repeated game. Different complexity measures are analyzed.
0 references
bounded rationality
0 references
repeated game
0 references
automata
0 references
simplification
0 references
0 references
0.8982818
0 references
0.8770431
0 references
0.87484705
0 references
0.8723116
0 references
0.8711642
0 references
0.87033165
0 references
0.86615586
0 references
