Showing 1 - 10 of 161
Persistent link: https://www.econbiz.de/10014552728
Abstract We study long run implications of reinforcement learning when two players repeatedly interact with one another over multiple rounds to play a finite action game. Within each round, the players play the game many successive times with a fixed set of aspirations used to evaluate payoff...
Persistent link: https://www.econbiz.de/10014588979
Persistent link: https://www.econbiz.de/10012093571
Organizations such as the Food and Drug Agency can make both type I (approving bad drugs) and type II errors (rejecting good ones). Optimal reliability entails balancing these two kinds of mistakes just so. This paper addresses the question of whether and when an imperfectly rational agency - in...
Persistent link: https://www.econbiz.de/10011135418
In the last decade, there has been a resurgence of interest in problems of cooperation, stimulated largely by Axelrod's work. Using an innovative tournament approach, Axelrod found that a simple strategy, tit-for-tat (TFT), was most successful in playing the repeated prisoner's dilemma (PD) in a...
Persistent link: https://www.econbiz.de/10010812748
It is well known that inferential errors can induce nice but provocable strategies to engage in vendettas with each other. It is therefore generally believed that imperfect monitoring reduces the payoffs of such strategies and impairs the evolution of cooperation. The current literature,...
Persistent link: https://www.econbiz.de/10010812870
We model political parties as adaptive decision-makers who compete in a sequence of elections. The key assumptions are that <italic>winners satisfice</italic> (the winning party in period <italic>t</italic> keeps its platform in <italic>t</italic> + 1) while <italic>losers search</italic>. Under fairly mild assumptions about losers' search rules, we show that...
Persistent link: https://www.econbiz.de/10010990826
One of the best known ideas in the study of bounded rationality is Simon's satisficing; yet we still lack a standard formalization of the heuristic and its implications. We propose a mathematical model of satisficing which explicitly represents agents' aspirations and which explores both...
Persistent link: https://www.econbiz.de/10005046341
We study long run implications of reinforcement learning when two players repeatedly interact with one another over multiple rounds to play a finite action game. Within each round, the players play the game many successive times with a fixed set of aspirations used to evaluate payoff experiences...
Persistent link: https://www.econbiz.de/10005579446
Persistent link: https://www.econbiz.de/10009403165