The lexicographic complexity of asymmetric binary relations

DOI10.1016/J.MATHSOCSCI.2022.02.002MaRDI QIDQ2673684zbMATH OpenOpenAlexFDO

Authors Vicki Knoblauch

Publication date 13 June 2022

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mathsocsci.2022.02.002

zbMATH Keywords

asymmetric binary relationlexicographic complexitylexicographic flavor

Mathematics Subject Classification ID

Utility theory (91B16)

Recommendations

• The lexicographic method in preference theory
• Complexity of representation-of-choice functions as compositions. Asymptotic estimates of complexity characteristics
• scientific article; zbMATH DE number 4051290
• Lexicographic orders and preference representation
• Continuous lexicographic preferences

Cites work

• A dictionary for voting paradoxes
• A simple voting scheme generates all binary relations on finite sets
• Choice by lexicographic semiorders
• Elections generate all binary relations on infinite sets
• Fuzzy preferences and social choice
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• scientific article; zbMATH DE number 3277166 (Why is no real title available?)
• scientific article; zbMATH DE number 3092990 (Why is no real title available?)
• Lexicographic compositions of multiple criteria for decision making
• Rational agents are the quickest

Cited in

(3)

• On the average depth of asymmetric LC-tries
• The lexicographic composition of abstract games
• Lexicographic preference representation: intrinsic length of linear orders on infinite sets

This page was built for publication: The lexicographic complexity of asymmetric binary relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673684)