We analyze a repeated first-price auction in which the types of the players are determined before the first round. It is proved that if every player is using either a belief-based learning scheme with bounded recall or a generalized fictitious play learning scheme, then for sufficiently large...

Why do some incomplete information markets feature intermediaries while others do not? I study the allocation of two goods in an incomplete information setting with a single principal, multiple agents with unit demand, and interdependent valuations. I construct a novel dynamic mechanism...

Abstract This paper proposes an intuitive rationale for late bidding in online venues. The expected surplus from bidding on subsequent auctions for equivalent items creates an option value to losing the current auction. This option is dynamic due to the stochastic arrival of new auctions and...

This paper discusses the use of game-theoretic methods in the study of technical change. It focuses on the role of two key incentives: the profit incentive and the competitive threat. These forces, which are outlined in Section 1, feature prominently in the discussion of Sections 2 and 3 on...

We study the alternating-offers bargaining problem of assigning an indivisible and commonly valued object to one of two players in return for some payment among players. The players are asymmetrically informed about the object’s value and have veto power over any settlement. There is no...

This paper presents a unified framework for characterizing symmetric equilibrium in simultaneous move, two-player, rank-order contests with complete information, in which each player's strategy generates direct or indirect affine "spillover" effects that depend on the rank-order of her decision...

We analyze a repeated first-price auction in which the types of the players are determined before the first round. It is proved that if every player is using either a belief-based learning scheme with bounded recall or generalized fictitious play learning scheme, then for sufficiently large...

In a dynamic contest where it is costly to compete, a player who is behind must decide whether to surrender or to keep fighting in the face of bleak odds. We experimentally examine the game theoretic prediction of last stand behavior in a multi-battle contest with a winning prize and losing...

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

We apply stochastic stability to study the evolution of bidding behavior in private-values second-price, first-price and k-double auctions. The learning process has a strong component of inertia but with a small probability, the bids are modified in the direction of ex-post regrets. We identify...