Christos A. Ioannou

Learn More
We propose a methodology that is generalizable to a broad class of repeated games in order to facilitate operability of belief learning models with repeated-game strategies. The methodology consists of (1) a generalized repeated-game strategy space, (2) a mapping between histories and repeated-game beliefs, and (3) asynchronous updating of repeated-game(More)
We examine the asymptotic behavior of a finite, but error-prone population, whose agents can choose one of ALLD (always defect), ALLC (always cooperate), or Pavlov (repeats the previous action if the opponent cooperated and changes action otherwise) to play the repeated Prisoner's Dilemma. A novelty of the study is that it allows for three types of errors(More)
We use a genetic algorithm to simulate the evolution of error-prone finite automata in the repeated Prisoner's Dilemma game. In particular, the automata are subjected to implementation and perception errors. The computational experiments examine whether and how the distribution of outcomes and genotypes of the coevolved automata change with different levels(More)
We propose a new approach for running lab experiments on indefinitely repeated games with high continuation probability. This approach has two main advantages. First, it allows us to run multiple long repeated games per session. Second, it allows us to incorporate the strategy method with minimal restrictions on the set of strategies that can be(More)
We study experimentally the effect on individual behavior of comparative, but payoff-irrelevant, information in a near-minimal group setting. Specifically, in each round, group members see the groups' cumulative payoffs, which consist of an aggrega-tion of the earnings of each member of the group in the round. Our novel experimental design incorporates two(More)
— A genetic algorithm is used to simulate the evolution of Moore machines in the iterated Prisoner's Dilemma stage-game. The machines are prone to two types of errors: (a) implementation errors and (b) perception errors. We conduct computational experiments that incorporate different levels of errors in an effort to assess whether and how the distribution(More)
Poisson games have been proposed to address equilibrium indeterminacy in Coordination games. They model the number of actual players as a Poisson random variable to capture population uncertainty in large games. Two natural questions are (a) whether uncertainty about the number of actual players does have an impact on subjects' behavior, and if so (b)(More)
Global games and Poisson games have been proposed to address equilibrium inde-terminacy in Coordination games. The former assume that agents face idiosyncratic uncertainty about economic fundamentals to capture disperse information, whereas the latter model the number of actual players as a Poisson random variable to capture population uncertainty in large(More)