Rationalizability of choice functions by game trees

Collective choices are often cyclic and cannot be rationalized by maximization of a single linear ordering. In this paper, we identify conditions under which collective choices, potentially cyclic, can be rationalized by extensive games with perfect information.