We study infinitely repeated games with perfect monitoring, where players have [beta]-[delta] preferences. We compute the continuation payoff set using recursive techniques and then characterize equilibrium payoffs. We then explore the cost of the present-time bias, producing comparative...

We introduce and solve a new class of "downward-recursive" static portfolio choice problems. An individual simultaneously chooses among ranked stochastic options, and each choice is costly. In the motivational application, just one may be exercised from those that succeed. This often emerges in...

We develop a decentralized Bayesian model of college admissions with two ranked colleges, heterogeneous students, and two realistic match frictions: students find it costly to apply to college, and college evaluations of their applications are uncertain. Students thus face a portfolio choice...

The focus of this paper is on developing verifiable sufficient conditions for the existence of a mixed strategy Nash equilibrium for both diagonally transfer continuous and better-reply secure games. First, we show that employing the concept of diagonal transfer continuity in place of...

We study equilibrium existence in normal form games in which it is possible to associate with each nonequilibrium point an open neighborhood, a set of players, and a collection of deviation strategies, such that at any nonequilibrium point of the neighborhood, a player from the set can increase...