We introduce a game-theoretic model with switching costs and endogenous references. An agent endogenizes his reference strategy and then, taking switching costs into account, he selects a strategy from which there is no profitable deviation. We axiomatically characterize this selection procedure...

We develop a framework in which individuals' preferences coevolve with their abilities to deceive others about their preferences and intentions. Specifically, individuals are characterised by (i) a level of cognitive sophistication and (ii) a subjective utility function. Increased cognition is...

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 study a class of two-player normal-form games with cyclical payoff structures. A game is called circulant if both players' payoff matrices fulfill a rotational symmetry condition. The class of circulant games contains well-known examples such as Matching Pennies, Rock-Paper-Scissors, as well...

In this paper, we propose a game in which each player decides with whom to establish a costly connection and how much local public good is provided when benefits are shared among neighbors. We show that, when agents are homogeneous, Nash equilibrium networks are nested split graphs....

This paper brings a general network analysis to a wide class of economic games. A network, or interaction matrix, tells who directly interacts with whom. A major challenge is determining how network structure shapes overall outcomes. We have a striking result. Equilibrium conditions depend on a...

We use quantifiers and selection functions to represent simultaneous move games. Quantifiers and selection functions are examples of higher-order functions. A higher order function is a function whose domain is itself a set of functions. Thus, quantifiers and selection func- tions allow players...

A simple expression is derived for the optimal strategy in the minimum effort game. This maps from player beliefs to an optimal effort level. From this expression the set of Nash equilibria in the game is fully characterized. All Nash equilibria are symmetric and involve at most two actions...

We analyze subjects' eye movements while they make decisions in a series of one-shot games. The majority of them perform a partial and selective analysis of the payoff matrix, often ignoring the payoffs of the opponent and/or paying attention only to specific cells. Our results suggest that...

We propose a new solution concept, NLK, that connects Nash Equilibrium (NE) and Level-K. It allows a player in a game to believe that her opponent may be either less or as sophisticated as, she is a view with support in psychology. We apply it to data from four published papers on static,...