Semiorders. Properties, representations, applications

From MaRDI portal
Publication:1379284

zbMath0897.06002MaRDI QIDQ1379284

Philippe Vincke, Marc Pirlot

Publication date: 25 February 1998

Published in: Theory and Decision Library. Series B: Mathematical and Statistical Methods (Search for Journal in Brave)




Related Items (75)

Utility representation via additive or multiplicative error functions.The median procedure in the semilattice of ordersA characterization of PQI interval orders.An Interactive Algorithm to Deal with Inconsistencies in the Representation of Cardinal InformationCharacterization of Complete Fuzzy Preorders Defined by Archimedean t-NormsA note on Wakker's cardinal coordinate independencePreferences for multi-attributed alternatives: traces, dominance, and numerical representationsThe Parametric Closure Problem\((m, n)\)-rationalizable choicesUniversal semiordersPreferences in artificial intelligenceStrict \((m, 1)\)-Ferrers propertiesEfficient pairwise preference elicitation allowing for indifferenceViolation of the transitivity axiom may explain why, in empirical studies, a significant number of subjects violate GARPBiased extensive measurement: the general caseTangent circle graphs and `orders'Well-graded families of NaP-preferencesCoherence conditions for preference modeling with ordered pointsThe pseudo-transitivity of preference relations: strict and weak \((m,n)\)-Ferrers propertiesCongruence relations on a choice spaceRectangles, Fringes, and InversesA bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck pathsSemiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problemTwo impossibility results for social choice under individual indifference intransitivityBi-semiorders with frontiers on finite setsNormalized and strict NaP-preferencesIndividual differences in the algebraic structure of preferencesNecessary and possible indifferencesOn complete fuzzy preorders and their characterizationsA bi-preference interplay between transitivity and completeness: reformulating and extending Schmeidler's theoremSemiorders and continuous Scott-Suppes representations. Debreu's open gap lemma with a thresholdModal preference structuresThe representation polyhedron of a semiorder.Biorders with frontierFuzzy semi-orders: the case of t-norms without zero divisorsA characterization of the 2-additive Choquet integral through cardinal informationNecessary and possible preference structuresWeakened Transitive Rationality: Invariance of Numerical Representations of PreferencesA lexicographic semiorder polytope and probabilistic representations of choiceRepresenting preferences using intervalsA Note on Candeal and Induráin’s Semiorder Separability ConditionContinuous representability of semiordersBiased extensive measurement: the homogeneous case.Relational measures and integration in preference modelingConsistent models of transitivity for reciprocal preferences on a finite ordinal scaleExpected Scott-Suppes utility representationExtended formulations for order polytopes through network flowsA certifying and dynamic algorithm for the recognition of proper circular-arc graphsStochastic applications of media theory: Random walks on weak orders or partial ordersUnit representation of semiorders. I: Countable setsUnit representation of semiorders. II: The general caseJónsson posetsA valued Ferrers relation for interval comparison`Additive difference' models without additivity and subtractivityComparison of \(\alpha\)-Condorcet points with median and center locationsNumerical representation of \(PQI\) interval ordersA preference-based approach to spanning trees and shortest paths problemsFollowing the traces: an introduction to conjoint measurement without transitivity and additivityComputer science and decision theoryA genesis of interval orders and semiorders: transitive NaP-preferencesFamilies of relations modelling preferences under incomplete informationScott-suppes representability of semiorders: Internal conditionsA survey on the mathematical foundations of axiomatic entropy: representability and orderingsRepresenting interval orders by weighted bases: some complexity resultsInterval orders, semiorders and ordered groupsA representation for intransitive indifference relationsNumerical representation of binary relations with a multiplicative error functionAn alternative definition for fuzzy interval ordersA note on the internal consistency of various preference representationsRepresentability of binary relations through fuzzy numbersNumerical representability of semiordersBinary representation of choice rationalizable by a utility function with an additive non-negative error functionNontransitive decomposable conjoint measurement.Relaxation of the Condorcet and Simpson conditions in voting locationFuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge




This page was built for publication: Semiorders. Properties, representations, applications