  We study dynamic mechanisms for optimizing revenue in repeated auctions, that
are robust to heterogeneous forward-looking and learning behavior of the
buyers. Typically it is assumed that the buyers are either all myopic or are
all infinite lookahead, and that buyers understand and trust the mechanism.
These assumptions raise the following question: is it possible to design
approximately revenue optimal mechanisms when the buyer pool is heterogeneous?
Facing a heterogeneous population of buyers with an unknown mixture of
$k$-lookahead buyers, myopic buyers, no-regret-learners and no-policy-regret
learners, we design a simple state-based mechanism that achieves a constant
fraction of the optimal achievable revenue.
