Unit representation of semiorders. I: Countable sets
From MaRDI portal
Recommendations
Cites work
- A Note on Candeal and Induráin’s Semiorder Separability Condition
- A short proof that `proper = unit'
- Additive utility without restricted solvability on every component.
- An algorithmic proof that semiorders are representable
- Continuous representability of semiorders
- Foundational aspects of theories of measurement
- scientific article; zbMATH DE number 6006014 (Why is no real title available?)
- scientific article; zbMATH DE number 3648772 (Why is no real title available?)
- scientific article; zbMATH DE number 5556718 (Why is no real title available?)
- scientific article; zbMATH DE number 3981120 (Why is no real title available?)
- scientific article; zbMATH DE number 44307 (Why is no real title available?)
- scientific article; zbMATH DE number 1862431 (Why is no real title available?)
- scientific article; zbMATH DE number 3218370 (Why is no real title available?)
- scientific article; zbMATH DE number 2197911 (Why is no real title available?)
- scientific article; zbMATH DE number 3366923 (Why is no real title available?)
- Interval graphs and interval orders
- Lexicographic aggregation of semiorders
- Measurement structures and linear inequalities
- Measurement Theory
- Minimal representation of a semiorder
- Multicriteria methodology for decision aiding. Transl. from the French by Mark R. McCord
- Norbert Wiener on the theory of measurement (1914, 1915, 1921)
- Numerical representability of semiorders
- Numerical representation of semiorders
- Numerical representations of imperfectly ordered preferences (A unified geometric exposition)
- On JND representations of semiorders
- On numerical representations of semiorders
- On realizable biorders and the biorder dimension of a relation
- On relationships between numerical representations of interval orders and semiorders
- On the compatibility between a graph and a simple order
- Preference modelling
- Representations of preference orderings
- Scott-suppes representability of semiorders: Internal conditions
- Semiorders and a Theory of Utility Discrimination
- Semiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problem
- Semiorders. Properties, representations, applications
- Simple inductive proofs of the Fishburn and Mirkin theorem and the Scott-Suppes theorem
- Synthetic description of a semiorder
- The measurement theory of dense threshold structures
- The Scott-Suppes theorem on semiorders
- Universal semiorders
- Utility Maximization, Choice and Preference
Cited in
(10)- Minimal representation of a semiorder
- Bi-utility representable orderings on a countable set
- Unit representation of semiorders. II: The general case
- Universal semiorders
- Representing Sets of Ordinals as Countable Unions of Sets in the Core Model
- An algorithmic proof that semiorders are representable
- scientific article; zbMATH DE number 646754 (Why is no real title available?)
- A numerical representation of semiorders on a countable set
- Semiorders and continuous Scott-Suppes representations. Debreu's open gap lemma with a threshold
- An Ambrose-Kakutani representation theorem for countable-to-1 semiflows
This page was built for publication: Unit representation of semiorders. I: Countable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2244623)
