Recent literature has questioned the existence of a learning foundation for the partially cursed equilibrium. This paper closes the gap by showing that a partially cursed equilibrium corresponds to a particular analogy-based expectation equilibrium. -- Analogy expectations ; bounded rationality...

One approach to the modeling of bounded rationality in strategic environments is based on the dynamics of evolution and learning in games. An entirely different approach has been developed recently by Osborne and Rubinstein (1998). This latter approach is static and equilibrium based, but relies...

We use an experiment to explore how subjects learn to play against computers which are programmed to follow one of a number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious play, imitation, reinforcement learning, and a trial...

As computer science and complex network theory develop, non-cooperative games and their formation and application on complex networks have been important research topics. In the inter-firm innovation network, it is a typical game behavior for firms to invest in their alliance partners....

A learning rule is uncoupled if a player does not condition his strategy on the opponent's payoffs. It is radically uncoupled if a player does not condition his strategy on the opponent's actions or payoffs. We demonstrate a family of simple, radically uncoupled learning rules whose...

Models of choice where agents see others as less sophisticated than themselves have significantly different, sometimes more accurate, predictions in games than does Nash equilibrium. When it comes to mechanism design, however, they turn out to have surprisingly similar implications. This paper...

We consider mechanism design in contexts in which agents exhibit bounded depth of reasoning (level k ) instead of rational expectations. We use simple direct mechanisms, in which agents report only first-order beliefs. While level 0 agents are assumed to be truth tellers, level k agents...

We present a model of boundedly rational play in single-shot 2 × 2 games. Players choose strategies based on the perceived salience of their own payoffs and, if own-payoff salience is uninformative, on the perceived salience of their opponent's payoffs. When own payoffs are salient, the model's...

We introduce a new solution concept for games in extensive form with perfect information, valuation equilibrium, which is based on a partition of each player's moves into similarity classes. A valuation of a player is a real-valued function on the set of her similarity classes. In this...

Predictions under common knowledge of payoffs may differ from those under arbitrarily, but finitely, many orders of mutual knowledge; Rubinstein's (1989)Email game is a seminal example. Weinstein and Yildiz (2007) showed that the discontinuity in the example generalizes: for all types with...