This paper presents a class of finite n x n bimatrix (2-player) games we coin Circulant Games. In Circulant Games, each player's payoff matrix is a circulant matrix, i.e.\ each row vector is rotated one element relative to the preceding row vector. We show that when the payoffs in the first row...

We show that for many classes of symmetric two-player games, the simple decision rule 'imitate-if-better' can hardly be beaten by any strategy. We provide necessary and sufficient conditions for imitation to be unbeatable in the sense that there is no strategy that can exploit imitation as a...

The aim of the paper is to compare the sensitivity of a government's fiscal policy and a central bank's monetary policy, which are in Nash equilibrium in the case of a non-cooperative game between the government and the central bank in Czechia, Hungary, and Romania. The analysis for each country...

In a coordination game such as the Battle of the Sexes, agents can condition their plays on external signals that can, in theory, lead to a Correlated Equilibrium that can improve the overall payoffs of the agents. Here we explore whether boundedly rational, adaptive agents can learn to...

Applying unawareness belief structures introduced in Heifetz, Meier, and Schipper (2013a), we develop Bayesian games with unawareness, define equilibrium, and prove existence. We show how equilibria are extended naturally from lower to higher awareness levels and restricted from higher to lower...

In classic game theory, agents use mixed strategies in the form of objective and probabilistically precise devices to conceal their actions. We introduce the larger set of probabilistically imprecise devices as strategies and study the consequences for the basic results of normal form games....

J. Harsanyi introduced structural polymorphism in game theory, that is, there are many possible agent types such as “low productivity” or high productivity” with corresponding probability but all operating under one behavioral type, strict rationality. In this paper, we introduce...

It has long been established in the literature that the set of pure strategy Nash equilibria of any binary game of strategic complements among a set N of players can be seen as a lattice on the set of all subsets of N under the partial order defined by the set inclusion relation (⊆). If the...