Ordering infinite utility streams: maximal anonymity

Luc Lauwers

Working Papers of Department of Economics, Leuven from KU Leuven, Faculty of Economics and Business (FEB), Department of Economics, Leuven

Abstract: In ordering in_nite utility streams, anonymity and Pareto are considered two basic principles. Anonymity is usually expressed by means of a group of cyclic or Pareto-compatible permutations. Maximal (for inclusion) groups of cyclic permutations involve free ultra_lters on the lattice of partitions of positive integers and are therefore nonconstructible objects. This result is in line with the conjecture of Fleurbaey and Michel (2003) and with the results of Lauwers (2006) and Zame (2007).

Date: 2009-05
New Economics Papers: this item is included in nep-upt
References: Add references at CitEc
Citations:

Downloads: (external link)
https://lirias.kuleuven.be/bitstream/123456789/233102/1/DPS0908.pdf

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ete:ceswps:ces09.08

Access Statistics for this paper

More papers in Working Papers of Department of Economics, Leuven from KU Leuven, Faculty of Economics and Business (FEB), Department of Economics, Leuven
Bibliographic data for series maintained by library EBIB (ebib@kuleuven.be).