Well-graded families of relations
From MaRDI portal
Publication:1367025
DOI10.1016/S0012-365X(96)00095-7zbMATH Open0877.06002MaRDI QIDQ1367025FDOQ1367025
Authors: Jean-Paul Doignon, Jean-Claude Falmagne
Publication date: 8 December 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Preference structures I: Distances between transitive preference relations†
- Semiorders and a Theory of Utility Discrimination
- The theory of convex geometries
- Intransitive indifference with unequal indifference intervals
- Foundational aspects of theories of measurement
- Axiomatic thermodynamics and extensive measurement
- Title not available (Why is that?)
- On realizable biorders and the biorder dimension of a relation
- A Markovian procedure for assessing the state of a system
- Difference graphs
- Title not available (Why is that?)
- Betweenness, orders and interval graphs
- A Polynomial Time Algorithm for Unidimensional Unfolding Representations
- Biorder families, valued relations, and preference modelling
- Synthetic description of a semiorder
- Convex geometry and group choice
- Stochastic evolution of rationality
- Title not available (Why is that?)
Cited In (40)
- Exploring well-gradedness in polytomous knowledge structures
- Media theory
- Coarsening a knowledge structure
- Ear decomposition for pair comparison data
- On the dimension of vertex labeling of k-uniform dcsl of an even cycle
- Several unresolved conceptual problems of mathematical psychology
- Partial cubes: Structures, characterizations, and constructions
- Hyperplane arrangements in preference modeling
- The tune in-and-out model: a random walk and its application to a presidential election survey
- A lexicographic semiorder polytope and probabilistic representations of choice
- On the consistency and the decisiveness of the double-minded decision-maker
- The median procedure in the semilattice of orders
- Chain representations of nested families of biorders
- Universal semiorders
- Necessary and possible indifferences
- FUNDAMENTALS OF MEDIA THEORY
- The interplay between transitivity and completeness: generalized \textsf{NaP}-preferences
- Constructions of 1-uniform dcsl graphs using well-graded families of sets
- Learning, forgetting, and the correlation of knowledge in knowledge space theory
- Title not available (Why is that?)
- Fuzzy politics. I: The genesis of parties
- On verifying and engineering the wellgradedness of a union-closed family
- The representation polyhedron of a semiorder.
- Learning graphs and 1-uniform dcsl graphs
- On the properties of well-graded partially union-closed families
- Projection of a medium
- Media theory: Representations and examples
- Stochastic applications of media theory: Random walks on weak orders or partial orders
- On families of semiorders and interval orders imbedded in a valued structure of preference: A survey
- Well-graded polytomous knowledge structures
- A Note on Candeal and Induráin’s Semiorder Separability Condition
- Biorder families, valued relations, and preference modelling
- A stochastic theory for the emergence and the evolution of preference relations
- Well-graded families and the union-closed sets conjecture
- Well-graded families of NaP-preferences
- Title not available (Why is that?)
- Cubical token systems
- Algorithms for media
- Approximately counting and sampling knowledge states
- On partial cubes, well-graded families and their duals with some applications in graphs
This page was built for publication: Well-graded families of relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367025)