Various extensions of the leximin order to the infinite dimensional setting have been suggested. They relax completeness and strong anonymity. Instead, by removing sensitivity to generations at infinite rank this paper defines a complete and strongly anonymous leximin relation on infinite...

The Consistent Preferences Approach to Deductive Reasoning in Games presents, applies, and synthesizes what my co-authors and I have called the 'consistent preferences' approach to deductive reasoning in games. Briefly described, this means that the object of the analysis is the ranking by each...