We conduct an experiment in which we auction the scarce rights to play the Proposer and Responder positions in subsequent ultimatum games. As a control treatment, we randomly allocate these rights and then charge exogenous participation fees according to the auction price sequences observed in...

We study communication in a two-player coordination game with Pareto-ranked equilibria. Prior research demonstrates that efficient coordination is difficult without communication but obtains regularly with (mandatory) costless pre-play messages. In a laboratory experiment, we modify...

We formulate and study a general finite-horizon bargaining game with simultaneous moves and a disagreement outcome that need not be the worst possible result for the agents. Conditions are identified under which the game is dominance solvable in the sense that iterative deletion of weakly...

The analysis of rational play in dynamic games is usually done within a static framework that specifies a player's initial beliefs as well as his disposition to revise those beliefs conditional on hypothetical states of information. We suggest a simpler approach, where the rationality of a...

In [G. Bonanno, Rational choice and AGM belief revision, Artificial Intelligence, 2009] a semantics for one-stage AGM belief revision was proposed based on choice frames, borrowed from the rational choice literature. In this paper we extend the semantics of choice frames to deal with iterated...

We investigate the extension of backward-induction to von Neumann extensive games (where information sets have a synchronous structure) and provide an epistemic characterization of it. Extensions of the idea of backward-induction were proposed by Penta (2009) and later by Perea (2013), who also...

This paper analyzes the problem of selecting a set of items whose prices are to be updated in the next iteration in so called simple ascending auctions with unit-demand bidders. A family of sets called "sets in excess demand" is introduced, and the main results demonstrate that a simple...

We study two-sided ("marriage") and general pairing ("roommate") problems. We introduce "sequences," lists of matchings that are repeated in order. Stable sequences are natural extensions of stable matchings; case in point, we show that a sequence of stable matchings is stable. In addition,...