Bounded rationality, strategy simplification, and equilibrium (Q361802): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s00182-011-0293-7 / rank | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Anna Jaśkiewicz / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 91A26 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 91A05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 91A20 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6199381 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bounded rationality | |||
Property / zbMATH Keywords: bounded rationality / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
repeated game | |||
Property / zbMATH Keywords: repeated game / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
automata | |||
Property / zbMATH Keywords: automata / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
simplification | |||
Property / zbMATH Keywords: simplification / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1563707431 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1002.4577 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Structure of Nash Equilibrium in Repeated Games with Finite Automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some notes on Church's thesis and the theory of games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Repeated games, finite automata, and complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of computing a best response automaton in repeated games with mixed strategies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Repeated games with finite automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rationality, Computability, and Nash Equilibrium / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of computing best-response automata in repeated games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic rationality: game theory with costly computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cooperation in the prisoner's dilemma / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3351186 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite Rationality and Interpersonal Complexity in Repeated Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4352265 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3576736 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On players with a bounded number of states / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On complexity as bounded rationality (extended abstract) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite automata play a repeated extensive game / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite automata play the repeated prisoner's dilemma / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simplicity of beliefs and delay tactics in a concession game / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Testing threats in repeated games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Program equilibrium / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00182-011-0293-7 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:24, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bounded rationality, strategy simplification, and equilibrium |
scientific article |
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