The problem of choice decomposition
From MaRDI portal
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)- Choice resolutions
- Choice of functions in decomposition of design problems
- Decomposable threshold models
- Decomposition of recurrent choices into stochastically independent counts
- Branch-and-bound method for inherited choice functions
- Hyper-relations, choice functions, and orderings of opportunity sets
- The problem of variable choice
- scientific article; zbMATH DE number 4008061 (Why is no real title available?)
- Decomposition of relations in choice problems: Completely decomposable relations and path independence
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)