We consider a college admissions problem with uncertainty. We realistically assume that (i) students' college application choices are nontrivial because applications are costly, (ii) college rankings of students are noisy and thus uncertain at the time of application, and (iii) matching between...

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 introduce and solve a new class of static portfolio choice problems, where only the best realized alternative matters. A decision maker must simultaneously choose among independent ranked options, and the better alternatives have a lower chance of panning out. Each choice is costly, and just...

We study infinitely repeated games with observable actions, where players have present-biased (so-called (beta)-(delta)) preferences. We give a two-step procedure to characterize Strotz-Pollak equilibrium payoffs: compute the continuation payoff set using recursive techniques, and use this set...

We introduce and solve a new class of static portfolio choice problems, where only the best realized alternative matters. A decision maker must simultaneously choose among independent ranked options, and the better alternatives have a lower chance of panning out. Each choice is costly, and just...