We consider an auction in which k identical objects of unknown value are auctioned off to n bidders. The k highest bidders get an object and pay the k+1st bid. Bidders receive a signal that provides information about the value of the object. We characterize the unique symmetric equilibirum of...

We consider discriminatory auctions for multiple identical units of a good. Players have private values, possibly for multiple units. None of the usual assumptions about symmetry of players' distributions over values or of their equilibrium play are made. Because of this, equilibria will...

It has been argues that the natural notion of independence for conditional probability systems is weaker than sequential equilibrium's consistency condition. Kohlberg and Reny(1992) provide an attractive extra condition on a conditioal probability system thatimplies equivalence to consistency....

In general, the result of the elimination of weakly dominated strategies depends on order. We find a condition, satisfied by the normal form of any generic extensive form, and by some important games which do not admit generic extensive forms, under which any two games resulting from the...

In general, the result of the elimination of weakly dominated strategies depends on order. We define nice weak dominance. Under nice weak dominance, order does not matter. We identify an important class of games under which nice weak dominance and weak dominance are equivalent, and so order...

This paper considers a model of reference-dependent utility in which the individual makes a conscious choice of her reference point for future consumption. The model incorporates the combination of loss aversion and anticipatory utility as competing forces in the determination of the optimal...

The standard framework for analyzing games with incomplete information models players as if they form beliefs about their opponents' beliefs about their opponents' beliefs and so on, that is, as if players have an infinite depth of reasoning. This strong assumption has nontrivial implications,...

We propose to strengthen Popper's notion of falsifiability by adding the requirement that when an observation is inconsistent with a theory, there must be a "short proof" of this inconsistency. We model the concept of a short proof using tools from computational complexity, and provide some...