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

DOI10.1134/S1064230723010100zbMATH Open1528.91028OpenAlexW4387214887MaRDI QIDQ6178115FDOQ6178115

Authors: S. O. Smerchinskaya, Nataliya P. Yashina 

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

Recommendations

• Non-contradictory aggregation of quasi-order relations
• scientific article; zbMATH DE number 4211746
• Reduction in problem size for ranking alternatives in group decision- making
• Decomposition and composition of the properties of alternatives in multicriteria decision-making problems
• Multiperson decision-making based on multiplicative preference relations

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-contradictory aggregation of quasi-order relations
• Non-contradictory aggregation of strict order relations

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

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