Ordering infinite utility streams: maximal anonymity

Luc Lauwers ()

Open Access publications from Katholieke Universiteit Leuven from Katholieke Universiteit 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
References: View references in EconPapers View complete reference list from CitEc
Citations View citations in EconPapers (2) Track citations by RSS feed

Downloads: (external link)
https://lirias.kuleuven.be/bitstream/123456789/233102/1/DPS0908.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 400 Bad Request

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: http://EconPapers.repec.org/RePEc:ner:leuven:urn:hdl:123456789/233102

Access Statistics for this paper

More papers in Open Access publications from Katholieke Universiteit Leuven from Katholieke Universiteit Leuven
Series data maintained by Carl Demeyere ().