1983•Canadian Journal of MathematicsOpen access

Representations of Well-Founded Preference Orders

Douglas Cenzer, R. Daniel Mauldin

Open full text 3 citations

Abstract

A preference order, or linear preorder, on a set X is a binary relation which is transitive, reflexive and total. This preorder partitions the set X into equivalence classes of the form . The natural relation induced by on the set of equivalence classes is a linear order. A well-founded preference order, or prewellordering, will similarly induce a well-ordering. A representation or Paretian utility function of a preference order is an order-preserving map f from X into the R of real numbers (provided with the standard ordering). Mathematicians and economists have studied the problem of obtaining continuous or measurable representations of suitably defined preference orders [4, 7]. Parametrized versions of this problem have also been studied [1, 7, 8]. Given a continuum of preference orders which vary in some reasonable sense with a parameter t, one would like to obtain a continuum of representations which similarly vary with t.

Open-access reader

About this research paper

What this paper is about

A preference order, or linear preorder, on a set X is a binary relation which is transitive, reflexive and total. This preorder partitions the set X into equivalence classes of the form . The natural relation induced by on the set of equivalence classes is a linear order. A well-founded preference order, or prewellordering, will similarly induce a well-ordering. A representation or Paretian utility function of a preference order is an order-preserving map f from X into the R of real numbers (provided with the standard ordering). Mathematicians and economists have studied the problem of obtaining continuous or measurable representations of suitably defined preference orders [4, 7]. Parametrized versions of this problem have also been studied [1, 7, 8]. Given a continuum of preference orders which vary in some reasonable sense with a parameter t, one would like to obtain a continuum of representations which similarly vary with t.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A preference order, or linear preorder, on a set X is a binary relation which is transitive, reflexive and total. This preorder partitions the set X into equivalence classes of the form . The natural relation induced by on the set of equivalence classes is a linear order. A well-founded preference order, or prewellordering, will similarly induce a well-ordering. A representation or Paretian utility function of a preference order is an order-preserving map f from X into the R of real numbers (provided with the standard ordering). Mathematicians and economists have studied the problem of obtaining continuous or measurable representations of suitably defined preference orders [4, 7]. Parametrized versions of this problem have also been studied [1, 7, 8]. Given a continuum of preference orders which vary in some reasonable sense with a parameter t, one would like to obtain a continuum of representations which similarly vary with t.

Key concepts: Preorder, Mathematics, Transitive relation, Binary relation, Equivalence relation, Preference relation, Preference, Equivalence (formal languages)

Related papers

Back to paper searchBrowse research topicsOriginal source
Representations of Well-Founded Preference Orders — Research Paper | ScholarLens