A separation result for stationary preferences

A group of n>1 agents have distinct stationary preferences on a space of consumption streams. Is there a single choice problem from which each agent has a unique and distinct optimum? That is, can one differentiate among the agents by asking them to make a single choice? This paper shows that the answer is yes.