Decomposition of relations in choice problems: Completely decomposable relations and path independence

DOI10.1023/A:1012702626371MaRDI QIDQ1778358zbMATH OpenFDO

Authors L. A. Sholomov

Publication date 17 June 2005

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1012702626371

Mathematics Subject Classification ID

Partial orders, general (06A06) Social choice (91B14) Utility theory (91B16)

Recommendations

• scientific article; zbMATH DE number 1855661
• scientific article; zbMATH DE number 4211746
• scientific article; zbMATH DE number 3907810
• scientific article; zbMATH DE number 3901009
• Decomposability conditions for compatible relations
• The problem of choice decomposition
• scientific article; zbMATH DE number 554067
• scientific article; zbMATH DE number 3891438
• Compositions and decompositions of binary relations
• scientific article; zbMATH DE number 3855106

Cited in

(6)

• Spoilt for Choice: Full First-Order Hierarchical Decompositions
• MORE RESULTS ON DECOMPOSITION AND DECOUPLING OF SINGLE RELATION SYSTEMS
• scientific article; zbMATH DE number 1855661 (Why is no real title available?)
• scientific article; zbMATH DE number 7300319 (Why is no real title available?)
• Relational and Kleene-Algebraic Methods in Computer Science
• The problem of choice decomposition

This page was built for publication: Decomposition of relations in choice problems: Completely decomposable relations and path independence

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