We investigate criteria for evaluating infinite utility streams that satisfy Fixed-step anonymity and includes some notion of overtaking or catching-up. We do so in a generalized setting which do not require us to specify the underlying finite-dimensional criterion (e.g., utilitarianism or...

We present a new version of the overtaking criterion, which we call generalized time-invariant overtaking. The generalized time-invariant overtaking criterion (on the space of infinite utility streams) is defined by extending proliferating sequences of complete and transitive binary relations...

We present a new version of the overtaking criterion, which we call generalized time-invariant overtaking. The generalized time-invariant overtaking criterion (on the space of infinite utility streams) is defined by extending proliferating sequences of complete and transitive binary relations...

We present a new version of the overtaking criterion, which we call generalized time invariant overtaking. The generalized time-invariant overtaking criterion (on the space of infinite utility streams) is defined by extending proliferating sequences of complete and transitive binary relations...

We study order theoretic and topological implications for impatience of weakly Paretian, representable orders on infinite utility streams. As a departure from the traditional literature, we do not make any continuity assumptions in proving the existence of impatient points. Impatience is robust...

We study order theoretic and topological implications for impatience of weakly Paretian, representable orders on infinite utility streams. As a departure from the traditional literature, we do not make any continuity assumptions in proving the existence of impatient points. Impatience is robust...

A set of sufficient conditions for representability of preference orders on real sequence spaces is analyzed. In particular, monotonicity and continuity of the order is not assumed. Two applications are worked out to demonstrate how such a result might be useful. Copyright Springer-Verlag Berlin...