Intransitive indifference with unequal indifference intervals

DOI10.1016/0022-2496(70)90062-3zbMath0191.31501OpenAlexW2021339822WikidataQ30053146 ScholiaQ30053146MaRDI QIDQ2537977

Publication date: 1970

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-2496(70)90062-3

zbMATH Keywords

ordered sets, lattices

Related Items (only showing first 100 items - show all)

Arrovian social choice with psychological thresholds ⋮ Collapsing binary data for algebraic multidimensional representation ⋮ Representing interval orders by a single real-valued function ⋮ Entropy of chemical processes versus numerical representability of orderings ⋮ On the separation of two relations by a biorder or a semiorder ⋮ Forcing posets with large dimension to contain large standard examples ⋮ Biorder families, valued relations, and preference modelling ⋮ Planar posets, dimension, breadth and the number of minimal elements ⋮ Inductive characterizations of finite interval orders and semiorders ⋮ Pseudo-orders: Definition, properties and numerical representation ⋮ \((m, n)\)-rationalizable choices ⋮ Universal semiorders ⋮ Continuous representation of a preference relation on a connected topological space ⋮ Chain dominated orders ⋮ Congruences for Taylor expansions of quantum modular forms ⋮ Well-graded families of relations ⋮ Interval orders and circle orders ⋮ Tangent circle graphs and `orders' ⋮ A note on the representation of preferences ⋮ Proper and unit bitolerance orders and graphs ⋮ Generalizations of semiorders: A review note ⋮ Continuous representability of interval orders and biorders ⋮ Enumeration of graded (3+1)-avoiding posets ⋮ The pseudo-transitivity of preference relations: strict and weak \((m,n)\)-Ferrers properties ⋮ Semiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problem ⋮ Characterization of the existence of semicontinuous weak utilities for binary relations ⋮ Are Condorcet procedures so bad according to the reinforcement axiom? ⋮ The proof of the removable pair conjecture for fractional dimension. ⋮ Bi-semiorders with frontiers on finite sets ⋮ Normalized and strict NaP-preferences ⋮ Some representation problems for semiorders ⋮ Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics ⋮ Congruences for the Fishburn numbers ⋮ When linear and weak discrepancy are equal ⋮ Large minimal realizers of a partial order. II ⋮ Biorders with frontier ⋮ Fuzzy semi-orders: the case of t-norms without zero divisors ⋮ Infinite saturated orders ⋮ Stacks and splits of partially ordered sets ⋮ Counting \(\mathbf {(3+1)}\)-avoiding permutations ⋮ An extremal problem on crossing vectors. ⋮ Aspects of semiorders within interval orders ⋮ First-Fit is linear on posets excluding two long incomparable chains ⋮ Decomposing labeled interval orders as pairs of permutations ⋮ Continuous representability of semiorders ⋮ A numerical representation of preferences with intransitive indifference ⋮ Counting general and self-dual interval orders ⋮ Revealed preference and intransitive indifference ⋮ Relational structures model of concurrency ⋮ Equidistributed statistics on Fishburn matrices and permutations ⋮ The \(m\)-cover posets and their applications ⋮ Catalan pairs and Fishburn triples ⋮ A weak utility function for acyclic preferences ⋮ Norbert Wiener on the theory of measurement (1914, 1915, 1921) ⋮ Unit and proper tube orders ⋮ Modeling concurrency with interval traces ⋮ Structure of concurrency ⋮ An obvious proof of Fishburn's interval order theorem ⋮ The communication complexity of interval orders ⋮ Fractional weak discrepancy and split semiorders ⋮ Numerical representations of imperfectly ordered preferences (A unified geometric exposition) ⋮ Choosing among maximals ⋮ Real interval representations ⋮ Dimension-2 poset competition numbers and dimension-2 poset double competition numbers ⋮ Alternative methods of constructing strict weak orders from interval orders ⋮ Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension ⋮ (2+2)-free posets, ascent sequences and pattern avoiding permutations ⋮ On the complexity of posets ⋮ A bound on the dimension of interval orders ⋮ Characterization problems for graphs, partially ordered sets, lattices, and families of sets ⋮ On incomplete preference structures ⋮ Computing the boxicity of a graph by covering its complement by cointerval graphs ⋮ Choice functions, rationality conditions, and variations on the weak axiom of revealed preference ⋮ Making choices with a binary relation: relative choice axioms and transitive closures ⋮ An analysis of simple counting methods for ordering incomplete ordinal data ⋮ Models of individual preference and choice ⋮ The dimension of semiorders ⋮ An upper bound on the dimension of interval orders ⋮ Multiattribute utility theory: A survey ⋮ Asymptotics for the number of row-Fishburn matrices ⋮ Scott-suppes representability of semiorders: Internal conditions ⋮ Revealed preference and the axiomatic foundations of intransitive indifference: The case of asymmetric subrelations ⋮ Failures semantics based on interval semiwords is a congruence for refinement ⋮ On-line chain partitions of orders: a survey ⋮ Modeling rationality in a linguistic framework ⋮ Aggregation of diverse types of fuzzy orders for decision making problems ⋮ New types of aggregation functions for interval-valued fuzzy setting and preservation of pos-\(B\) and nec-\(B\)-transitivity in decision making problems ⋮ Just-noticeable difference as a behavioural foundation of the critical cost-efficiency index ⋮ Split semiorders ⋮ Linear orders and semiorders close to an interval order ⋮ Numerical representation of intransitive preferences on a countable set ⋮ Variable intervals model ⋮ Interval lengths for interval orders: A minimization problem ⋮ On realizable biorders and the biorder dimension of a relation ⋮ Interval graphs and interval orders ⋮ On families of semiorders and interval orders imbedded in a valued structure of preference: A survey ⋮ Comparability graphs with constraint, partial semi-orders and interval orders ⋮ Representability of binary relations through fuzzy numbers ⋮ Interval choice: Classic and general cases ⋮ Covering a poset by interval orders

Cites Work

This page was built for publication: Intransitive indifference with unequal indifference intervals