Decomposition of a decision-making problem into levels of preference of the majority graph

DOI10.1134/s1064230723010100zbMath1528.91028OpenAlexW4387214887MaRDI QIDQ6178115

Nataliya P. Yashina, S. O. Smerchinskaya

Publication date: 18 January 2024

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230723010100

Mathematics Subject Classification ID

Decision theory (91B06) Applications of graph theory (05C90) Individual preferences (91B08)

Cites Work

• A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method
• Non-contradictory aggregation of strict order relations
• NON-CONTRADICTORY AGGREGATION OF QUASI-ORDER RELATIONS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition of a decision-making problem into levels of preference of the majority graph