It has been suggested that players often produce simplified and/or misspecified mental representations of interactive decision problems (Kreps, 1990). We submit that the relational structure of players' preferences in a game induces cognitive complexity, and may be an important driver of such...

A longstanding criticism of the core is that it is too sensitive to small changes in player numbers, as in a well known example where one extra seller (resp. buyer) causes the entire surplus to go to the buyer's (seller's) side. We test this example in the lab, using several different trading...

Inspired by the social psychology literature, we study the implications of categorical thinking on decision making in the context of a large normal form game. Every agent has a categorization (partition) of her opponents and can only observe the average behavior in each category. A strategy...

We study both theoretically and experimentally the set of Nash equilibria of a classical one-dimensional election game with two candidates. These candidates are interested in power and ideology, but their weights on these two motives are not necessarily identical. Apart from obtaining the well...

We report an experiment on the Probabilistic Serial (PS) mechanism for allocating indivisible goods. The PS mechanism, a recently discovered alternative to the widely used Random Serial Dictatorship mechanism, has attractive fairness and efficiency properties if people report their preferences...

We experimentally investigate reference group formation and the impact of social comparisons in a three-player ultimatum game. The players compete in a real-effort task for the role of the proposer. The role of the responder is randomly allocated to one of the other two participants. The third...

We propose an equilibrium model of duopolistic dynamic pricing in which a buyer alternates between two sellers for price offers over a finite time horizon. The game ends when the buyer accepts a price offer or the selling season is over, whichever comes first. Previous research (Granot et al.,...

We study a sealed-bid auction between two bidders with asymmetric independent private values. The two bidders own asymmetric shares in a partnership. The higher bidder buys the lower bidderʼs shares at a per-unit price that is a convex combination of the two bids. The weight of the lower bid is...

This paper considers a resource allocation mechanism that utilizes a profit-maximizing auctioneer/matchmaker in the Kelso–Crawford (1982) (many-to-one) assignment problem. We consider general and simple (individualized price) message spaces for firmsʼ reports following Milgrom (2010). We show...

We study a negotiation model with a disagreement game between offers and counteroffers. When players have different time preferences, delay can be Pareto efficient, thereby violates the presumption of the Hicks Paradox. We show that all equilibria are characterized by the extreme equilibria....