1983
DOI: 10.4153/cjm-1983-027-4
|View full text |Cite
|
Sign up to set email alerts
|

Representations of Well-Founded Preference Orders

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 th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1994
1994
2013
2013

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…The existence of utility representations with di®erent properties for preference orders was treated in a number of papers. [2][3][4][5][6] In the simplest case when X is nite one may explicitly set 'ðxÞ ¼ jfy 2 X : ðx; yÞ 2 Pgj, where jAj denotes the number of elements in the set A & X.…”
Section: Introductionmentioning
confidence: 99%
“…The existence of utility representations with di®erent properties for preference orders was treated in a number of papers. [2][3][4][5][6] In the simplest case when X is nite one may explicitly set 'ðxÞ ¼ jfy 2 X : ðx; yÞ 2 Pgj, where jAj denotes the number of elements in the set A & X.…”
Section: Introductionmentioning
confidence: 99%