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,...

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...

We can often predict the behavior of those closest to us more accurately than that of complete strangers, yet we routinely engage in strategic situations with both: our social network impacts our strategic knowledge. Peer-confirming equilibrium describes the behavioral consequences of this...

In the analysis of normal form games that model strategic interactions between individuals, the Nash equilibrium is a significant contribution. However, this concept has some limits: often, it proposes a collective result undesirable by all and in some cases, this equilibrium is not realizable....

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...