Numerical representations of interval orders
From MaRDI portal
An interval order \(\prec \) on a non-empty set \(X\) is said to be representable if there are real-valued functions \(u,v: X\rightarrow R\) such that \(x\prec y\) iff \(v(x)<u(y)\), for any \(x,y\in X\). The authors of the paper under review study the structures of interval orders and their representability. They give new characterizations of the representability and show that the three main techniques used in the literature to achieve numerical representations of interval orders are equivalent.
Recommendations
- Numerical representation of PQI interval orders
- Numerical representation of interval orders on a topological space
- Representability of interval orders
- scientific article; zbMATH DE number 3857173
- scientific article; zbMATH DE number 36671
- Numerical representation of semiorders
- On relationships between numerical representations of interval orders and semiorders
- Bounded discrete representations of interval orders
- Numerical representability of semiorders
- Interval orders based on arbitrary ordered sets
Cited in
(42)- Representing interval orders by weighted bases: some complexity results
- Numerical representation of interval orders on a topological space
- Counting interval orders
- On relationships between numerical representations of interval orders and semiorders
- Strict \((m, 1)\)-Ferrers properties
- Numerical representation of PQI interval orders
- Continuous representations of interval orders by means of two continuous functions
- Unit representation of semiorders. II: The general case
- A survey on the mathematical foundations of axiomatic entropy: representability and orderings
- Numerical representation of semiorders
- Well-graded families of NaP-preferences
- Upper semicontinuous representations of interval orders
- A genesis of interval orders and semiorders: transitive NaP-preferences
- Entropy of chemical processes versus numerical representability of orderings
- Functional equations related to fuzzy sets and representable orderings
- Universal semiorders
- FURTHER RESULTS ON THE CONTINUOUS REPRESENTABILITY OF SEMIORDERS
- Continuous representability of interval orders: the topological compatibility setting.
- UNIVERSAL CODOMAINS TO REPRESENT INTERVAL ORDERS
- The pseudo-transitivity of preference relations: strict and weak \((m,n)\)-Ferrers properties
- scientific article; zbMATH DE number 1554937 (Why is no real title available?)
- Pointwise convergence topology and function spaces in fuzzy analysis
- Representing Ordinal Numbers with Arithmetically Interesting Sets of Real Numbers
- Open questions in utility theory
- Representations of interval orders on connected separable topological spaces
- Searching for a Debreu's open gap lemma for semiorders
- A Note on Candeal and Induráin’s Semiorder Separability Condition
- Chain representations of nested families of biorders
- Weightable quasi-metrics related to fuzzy sets
- INTERVAL-VALUED REPRESENTABILITY OF QUALITATIVE DATA: THE CONTINUOUS CASE
- The representation cone of an interval order.
- A selection of maximal elements under non-transitive indifferences
- Semiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problem
- Biorders with frontier
- Ad hoc continuity of continuously representable interval orders
- Secure and perfect maximality
- Representation of ordered structures on the real line: a panoramic view
- Real interval representations
- Numerical representability of ordered topological spaces with compatible algebraic structure
- Representability of binary relations through fuzzy numbers
- Unified representability of total preorders and interval orders through a single function: the lattice approach
- Continuous representability of semiorders
This page was built for publication: Numerical representations of interval orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951890)
