Approximating SP-orders through total preorders: incomparability and transitivity through permutations

DOI10.2989/16073606.2017.1296901zbMath1436.06005MaRDI QIDQ5236078

Oscar Valero, Asier Estevan, Michel Schellekens

Publication date: 15 October 2019

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2017.1296901

zbMATH Keywords

symmetric group; transitivity; indistinguishability; incomparability; \(MOQA\); SP-orders

Mathematics Subject Classification ID

06A06: Partial orders, general

06A11: Algebraic aspects of posets

06B30: Topological lattices

20B35: Subgroups of symmetric groups

Related Items

Entropy conservation for comparison-based algorithms, Interval orders, semiorders and ordered groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representations of preference orderings
• Some results on biordered structures, in particular distributed systems
• Intransitive indifference with unequal indifference intervals
• Semiorders and a Theory of Utility Discrimination
• Foundational aspects of theories of measurement
• FURTHER RESULTS ON THE CONTINUOUS REPRESENTABILITY OF SEMIORDERS
• Continuous Representability of Interval Orders: The Topological Compatibility Setting
• Intransitive Indifference in Preference Theory: A Survey
• Utility Maximization, Choice and Preference
• The classification of the finite simple groups