scientific article; zbMATH DE number 4112333
From MaRDI portal
Publication:3835247
Recommendations
- scientific article; zbMATH DE number 3961285
- Complexity of representation-of-choice functions as compositions. Asymptotic estimates of complexity characteristics
- Rationalizing Choice Functions By Multiple Rationales
- scientific article; zbMATH DE number 41738
- Complexity of the composition representation of choice functions. II. Tradeoff between realization parameters
Cited in
(14)- Asymptotic equivalence of choice functions
- Choosing \(k\) from \(m\): feasible elimination procedures reconsidered
- Sources of complexity in subset choice
- Choice functions on a large set of alternatives
- scientific article; zbMATH DE number 3855106 (Why is no real title available?)
- scientific article; zbMATH DE number 4158323 (Why is no real title available?)
- Complexity of representation-of-choice functions as compositions. Asymptotic estimates of complexity characteristics
- Complexity of the composition representation of choice functions. II. Tradeoff between realization parameters
- scientific article; zbMATH DE number 3959165 (Why is no real title available?)
- scientific article; zbMATH DE number 4068558 (Why is no real title available?)
- scientific article; zbMATH DE number 41738 (Why is no real title available?)
- Properties and complexity of some superposition choice procedures
- Optimal collective dichotomous choice under partial order constraints
- Decomposition of the problem of selecting the best variants
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835247)
