The lexicographic complexity of asymmetric binary relations

DOI10.1016/J.MATHSOCSCI.2022.02.002zbMATH Open1492.91134OpenAlexW4214575336MaRDI QIDQ2673684FDOQ2673684

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A dictionary for voting paradoxes
• A simple voting scheme generates all binary relations on finite sets
• Choice by lexicographic semiorders
• Lexicographic compositions of multiple criteria for decision making
• Elections generate all binary relations on infinite sets
• Fuzzy preferences and social choice
• Rational agents are the quickest

Cited In (2)

• On the average depth of asymmetric LC-tries
• 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)