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

In experimental studies pairs that repeatedly play the simple coordination game mutual fate control may regularly fail to coordinate when they are given little in-formation, i.e. when subjects are uninformed about the payoff matrix and feed-back is limited to their own payoff. Our experimental...

We show that, in repeated common interest games without discounting, strong `perturbation implies efficiency' results require that the perturbations must include strategies which are `draconian' in the sense that they are prepared to punish to the maximum extent possible. Moreover, there is a...

The paper analyzes the Nash equilibria of two-person discounted repeated games with one-sided incomplete information and known own payoffs. If the informed player is arbitrarily patient relative to the uninformed player, then the characterization for the informed player's payoffs is essentially...

We analyze different ways of pairing agents in a bipartite matching problem, with regard to its scaling properties and to the distribution of individual ``satisfactions''. Then we explore the role of partial information and bounded rationality in a generalized {\it Marriage Problem}, comparing...

While many learning models have been proposed in the game theoretic literature to track individuals’ behavior, surprisingly little research has focused on how well these models describe human adaptation in changing dynamic environments. Analysis of human behavior demonstrates that people are...

This paper shows that altruism may be beneficial in bargaining when there is competition for bargaining partners. In a game with random proposers, the most altruistic player has the highest material payoff if players are sufficiently patient. However, this advantage is eroded as the discount...

We study a simple bargaining mechanism in which each player puts a prize to his resources before leaving the game. The only expected final equilibrium payoff can be defined by means of selective marginal contributions vectors, and it coincides with the Shapley value for convex games. Moreover,...

We examine a new class of games, which we call social games, where players not only choose strategies but also choose with whom they play. A group of players who are dissatisfied with the play of their current partners can join together and play a new equilibrium. This imposes new refinements on...