  We show that memory-$n$ zero-determinant strategies in repeated games can be
used to control conditional averages of payoffs. Equivalently, they can be used
to control average payoffs in biased ensembles. We provide several examples of
memory-$n$ zero-determinant strategies in repeated prisoner's dilemma game. We
also explain that a deformed version of zero-determinant strategies is easily
extended to the memory-$n$ case.
