We analyze the optimal design of dynamic mechanisms in the absence of transfers. The designer uses future allocation decisions to elicit private information. Values evolve according to a two-state Markov chain. We solve for the optimal allocation rule. Unlike with transfers, efficiency decreases over time. In the long-run, polarization obtains, but not necessarily immiseration. A simple implementation is provided. The agent is endowed with a given "budget," corresponding to a number of units he is entitled to claim in a row. Considering the limiting continuous-time environment, we show that persistence hurts.