Numerical representation of intransitive preferences on a countable set
From MaRDI portal
Let \(\succ\) be a preference relation on a countable set \(X\). The author proves that if \(\succ\) is acyclic (that is, has irreflexive transitive-closure), then there exists a map \(u\colon X\to\mathbb R\) such that \(x\succ y\) entails \(u(x)\succ u(y)\). He also extends, and gives a simple proof of, a theorem of Fishburn which provides representations of an interval order.
Recommendations
Cites work
- A numerical representation of preferences with intransitive indifference
- Continuity Properties of Paretian Utility
- scientific article; zbMATH DE number 3307201 (Why is no real title available?)
- Interval representations for interval orders and semiorders
- Intransitive indifference with unequal indifference intervals
- Utility Functions for Partially Ordered Topological Spaces
Cited in
(26)- Numerical representation of interval orders on a topological space
- Representing interval orders by a single real-valued function
- Continuous representation of a preference relation on a connected topological space
- A numerical representation of preferences with intransitive indifference
- Numerical representation for lower quasi-continuous preferences
- Variable intervals model
- Numerical representation of acyclic preferences
- Representability of interval orders
- A representation of acyclic preferences
- Lexicographic orders and preference representation
- Semimetric thresholds for finite posets
- Representing preferences with nontransitive indifference by a single real-valued function
- Set-valued utilities for strict partial orders
- Characterization of the existence of semicontinuous weak utilities
- Inferring latent class lexicographic rules from choice data
- Violation of the transitivity axiom may explain why, in empirical studies, a significant number of subjects violate GARP
- A characterization of the generalized optimal choice set through the optimization of generalized weak utilities
- Continuous representability of interval orders: the topological compatibility setting.
- UNIVERSAL CODOMAINS TO REPRESENT INTERVAL ORDERS
- Competitive equilibrium with intuitionistic agents
- Weakened transitive rationality: invariance of numerical representations of preferences
- scientific article; zbMATH DE number 1405560 (Why is no real title available?)
- Randomized algorithms for lexicographic inference
- Characterization of the existence of semicontinuous weak utilities for binary relations
- Biorders with frontier
- Representability of binary relations through fuzzy numbers
This page was built for publication: Numerical representation of intransitive preferences on a countable set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1054247)
