Pages that link to "Item:Q2537977"
From MaRDI portal
The following pages link to Intransitive indifference with unequal indifference intervals (Q2537977):
Displaying 50 items.
- Arrovian social choice with psychological thresholds (Q268627) (← links)
- Entropy of chemical processes versus numerical representability of orderings (Q283796) (← links)
- Forcing posets with large dimension to contain large standard examples (Q293603) (← links)
- Planar posets, dimension, breadth and the number of minimal elements (Q304190) (← links)
- \((m, n)\)-rationalizable choices (Q313072) (← links)
- Universal semiorders (Q313082) (← links)
- Congruences for Taylor expansions of quantum modular forms (Q347464) (← links)
- Enumeration of graded (3+1)-avoiding posets (Q388200) (← links)
- The pseudo-transitivity of preference relations: strict and weak \((m,n)\)-Ferrers properties (Q396205) (← links)
- Are Condorcet procedures so bad according to the reinforcement axiom? (Q404755) (← links)
- The proof of the removable pair conjecture for fractional dimension. (Q405169) (← links)
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics (Q411853) (← links)
- Fuzzy semi-orders: the case of t-norms without zero divisors (Q429414) (← links)
- An extremal problem on crossing vectors. (Q458279) (← links)
- Decomposing labeled interval orders as pairs of permutations (Q463061) (← links)
- The \(m\)-cover posets and their applications (Q492702) (← links)
- Catalan pairs and Fishburn triples (Q494124) (← links)
- Modeling concurrency with interval traces (Q515576) (← links)
- Fractional weak discrepancy and split semiorders (Q531608) (← links)
- On incomplete preference structures (Q585061) (← links)
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- Semiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problem (Q618177) (← links)
- Characterization of the existence of semicontinuous weak utilities for binary relations (Q618904) (← links)
- When linear and weak discrepancy are equal (Q626763) (← links)
- Biorders with frontier (Q633220) (← links)
- Infinite saturated orders (Q634735) (← links)
- Counting \(\mathbf {(3+1)}\)-avoiding permutations (Q649006) (← links)
- First-Fit is linear on posets excluding two long incomparable chains (Q651432) (← links)
- Counting general and self-dual interval orders (Q662031) (← links)
- Equidistributed statistics on Fishburn matrices and permutations (Q668059) (← links)
- A weak utility function for acyclic preferences (Q673403) (← links)
- Structure of concurrency (Q685384) (← links)
- An obvious proof of Fishburn's interval order theorem (Q685567) (← links)
- Choosing among maximals (Q696933) (← links)
- Real interval representations (Q696944) (← links)
- Asymptotics for the number of row-Fishburn matrices (Q740273) (← links)
- Revealed preference and the axiomatic foundations of intransitive indifference: The case of asymmetric subrelations (Q749476) (← links)
- Failures semantics based on interval semiwords is a congruence for refinement (Q757073) (← links)
- On-line chain partitions of orders: a survey (Q766153) (← links)
- Aggregation of diverse types of fuzzy orders for decision making problems (Q781167) (← links)
- New types of aggregation functions for interval-valued fuzzy setting and preservation of pos-\(B\) and nec-\(B\)-transitivity in decision making problems (Q781170) (← links)
- Just-noticeable difference as a behavioural foundation of the critical cost-efficiency index (Q785544) (← links)
- Linear orders and semiorders close to an interval order (Q790852) (← links)
- Representability of binary relations through fuzzy numbers (Q812596) (← links)
- Inductive characterizations of finite interval orders and semiorders (Q841168) (← links)
- Chain dominated orders (Q862975) (← links)
- Tangent circle graphs and `orders' (Q869563) (← links)
- Continuous representability of interval orders and biorders (Q882302) (← links)
- Bi-semiorders with frontiers on finite sets (Q894091) (← links)
- Normalized and strict NaP-preferences (Q894096) (← links)