Decomposition of relations in choice problems: Completely decomposable relations and path independence
type: Item
instance of: scholarly article
title: Decomposition of relations in choice problems: Completely decomposable relations and path independence
zbMATH Open document ID: 1093.91512
DOI: 10.1023/A:1012702626371
author: L. A. Sholomov
published in: Automation and Remote Control
publication date: 2005-06-17T00:00:00Z
Mathematics Subject Classification ID: 91B14
Mathematics Subject Classification ID: 91B16
Mathematics Subject Classification ID: 06A06
zbMATH DE Number: 2176708
MaRDI profile type: Publication
Recommended article: Q4788071
Recommended article: Q3359961
Recommended article: Q3685239
Recommended article: Q3679371
Recommended article: Decomposability conditions for compatible relations
Recommended article: The problem of choice decomposition
Recommended article: Q4288120
Recommended article: Q3347939
Recommended article: Compositions and decompositions of binary relations
Recommended article: Q3323953
description: scientific article; zbMATH DE number 2176708