In a product choice game played between a long lived seller and an infinite sequence of buyers, we assume that buyers cannot observe past signals. To facilitate the analysis of applications such as online auctions (e.g. eBay), online shopping search engines (e.g. BizRate.com) and consumer...

We study elections with three candidates under plurality voting. A candidate is a Condorcet loser if the majority of the voters place that candidate at the bottom of their preference rankings. We first show that a Condorcet loser might win the election in a three-way race. Next we introduce to...

As school districts integrate charter schools for centralized admissions in Denver, New Orleans, Newark and Washington D.C., some charter schools have stayed out of the system. This is counterintuitive as centralized clearinghouses are deemed beneficial to schools as well as students. We provide...

The modern Condorcet jury theorem states that under weak conditions, when voters have common interests, then elections will aggregate information when the population is large, in any responsive and symmetric equilibrium. Here, we study the performance of large elections with population...

We study the impact of unobservable replacements on the sustainability of reputation effects in frequently repeated games played by a long run player facing a sequence of short run players. At the beginning of every period the long-run player is replaced with a new long run player with...

In a two-sided search market agents are paired to bargain over a unit surplus. The matching market serves as an endogenous outside option for a bargaining agent. Behavioral agents are commitment types that demand a constant portion of the surplus. The frequency of behavioral types is determined...

Cripps et al. (2005) conjectured that in an infinitely repeated game with two equally patient players, if there is positive probability that the players could be Stackelberg types, then equilibrium behavior would resemble a war of attrition, i.e., a two-sided reputation result would hold. In...

We model a long-run relationship as an infinitely repeated game played by two equally patient agents. In each period, the agents play an extensive-form game of perfect information. There is incomplete information about the type of player 1 while player 2’s type is commonly known. We show that...