Equilibrium payoffs in repeated two-player zero-sum games of finite automata (Q2002062): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00182-018-0634-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2808837421
@@ Property / OpenAlex ID: W2808837421 / rank @@
+Normal rank
@@ Property / cites work @@
+The Structure of Nash Equilibrium in Repeated Games with Finite Automata
+Normal rank
@@ Property / cites work @@
+Bounded Computational Capacity Equilibrium in Repeated Two-Player Zero-Sum Games
+Normal rank
@@ Property / cites work @@
+Repeated games with finite automata
@@ Property / cites work: Repeated games with finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded computational capacity equilibrium
@@ Property / cites work: Bounded computational capacity equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
+Normal rank
@@ Property / cites work @@
+Finite automata play the repeated prisoner's dilemma
+Normal rank
@@ Property / Wikidata QID @@
+Q129653284
@@ Property / Wikidata QID: Q129653284 / rank @@
+Normal rank