The problem of choice decomposition
From MaRDI portal
Publication:810341
DOI10.1016/0165-4896(90)90068-IzbMATH Open0733.90006OpenAlexW2062682393MaRDI QIDQ810341FDOQ810341
Authors: Artashes Terzyan
Publication date: 1990
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0165-4896(90)90068-i
Recommendations
- Decomposition of relations in choice problems: Completely decomposable relations and path independence
- Decomposition of the problem of selecting the best variants
- Choice of functions in decomposition of design problems
- scientific article; zbMATH DE number 4211746
- Branch-and-bound method for inherited choice functions
Cites Work
Cited In (9)
- Title not available (Why is that?)
- Branch-and-bound method for inherited choice functions
- Choice resolutions
- Decomposition of recurrent choices into stochastically independent counts
- Choice of functions in decomposition of design problems
- Hyper-relations, choice functions, and orderings of opportunity sets
- Decomposition of relations in choice problems: Completely decomposable relations and path independence
- Decomposable threshold models
- The problem of variable choice
This page was built for publication: The problem of choice decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810341)