Impatience for Weakly Paretian Orders: Existence and Genericity

Abstract

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 in the sense that there are uncountably many impatient points. A general statement about genericity of impatience cannot be made for representable, weakly Paretian orders. This is shown by means of an example. If we assume a stronger sensitivity condition, then genericity obtains.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 0 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.