Finite automata play the repeated prisoner's dilemma (Q1084866): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0022-0531(86)90021-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2131724520 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3956774 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of economic decision rules / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3323650 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592246 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3252269 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equilibrium in supergames with the overtaking criterion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5648104 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Prisoner's Dilemma and Dynamical Systems Associated to Non-Cooperative Games / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:44, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finite automata play the repeated prisoner's dilemma |
scientific article |
Statements
Finite automata play the repeated prisoner's dilemma (English)
0 references
1986
0 references
The paper studies two-person supergames. Each player is restricted to carry out his strategies by finite automata. A player's aim is to maximize his average payoff and subject to that, to minimize the number of states of his machine. A solution is defined as a pair of machines in which the choice of machine is optimal for each player at every stage of the game. Several properties of the solution are studied and are applied to the repeated prisoner's dilemma. In particular it is shown that cooperation cannot be the outcome of a solution of the infinitely repeated prisoner's dilemma.
0 references
bounded rationality
0 references
two-person supergames
0 references
cooperation
0 references
infinitely repeated prisoner's dilemma
0 references