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

We study the structure of pairwise stable networks from a very general point. Rather than assuming a particular functional form of utility, we simply assume that the society is homogeneous, i.e. that agents' utilities differ only with respect to their network position while their names do not...

This paper studies within a multi-country model with international trade the stability of international environmental agreements (IEAs) when countries regulate carbon emissions either by taxes or caps. Regardless of whether coalitions play Nash or are Stackelberg leaders the principal message is...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

In this paper we test the effect of descriptive "features" on initial strategic behavior in normal form games, where "descriptive" are all those features that can be modified without altering the (Nash) equilibrium structure of a game. We observe that our experimental subjects behave according...

We study extrapolation between games in a laboratory experiment. Participants in our experiment first play either the dominance solvable guessing game or a Coordination version of the guessing game for five rounds. Afterwards they play a 3x3 normal form game for ten rounds with random matching...

Substantial evidence has accumulated in recent empirical works on the limited ability of the Nash equilibrium to rationalize observed behavior in many classes of games played by experimental subjects. This realization has led to several attempts aimed at finding tractable equilibrium concepts...

Many social networks have the following properties: (i) a short average distance between any two individuals; (ii) a high clustering coefficient; (iii) segregation patterns; the presence of (iv) brokers and (v) hubs. (i) and (ii) define a small world network. This paper develops a strategic...

We study both theoretically and experimentally the complete set of Nash equilibria of a classical one-dimensional, majority rule election game with two candidates, who might be interested in power as well as in ideology, but not necessarily in the same way. Apart from obtaining the well known...

This paper considers rent-seeking games in which a small percentage change in a player's bid has a large percentage impact on her odds of winning, i.e., on the ratio of her respective probabilities of winning and losing. An example is the Tullock contest with a high R. The analysis provides a...