On complexity of minimization and compression problems for models of sequential choice
From MaRDI portal
Recommendations
- The sequential choice model: a rationality analysis
- Complexity of the composition representation of choice functions. II. Tradeoff between realization parameters
- The computational complexity of rationalizing boundedly rational choice behavior
- Complexity of representation-of-choice functions as compositions. Asymptotic estimates of complexity characteristics
- scientific article; zbMATH DE number 3855106
Cites work
- Characteristic conditions for a class of choice functions
- Conditions for universal reducibility of a two-stage extremization problem to a one-stage problem
- scientific article; zbMATH DE number 41738 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 194358 (Why is no real title available?)
- scientific article; zbMATH DE number 3446442 (Why is no real title available?)
- scientific article; zbMATH DE number 3236054 (Why is no real title available?)
- scientific article; zbMATH DE number 3317482 (Why is no real title available?)
- Neighborhoods in problems of discrete mathematics
- Some aspects of the general theory of best option choice
Cited in
(2)
This page was built for publication: On complexity of minimization and compression problems for models of sequential choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268324)