@inproceedings{abb5d077ef4147e89babcdae95e0bbee,
title = "Properties and complexity of some superposition choice procedures",
abstract = "In this paper, the application of two-stage superposition choice procedures to the choice problem when the number of alternatives is too large is studied. Two-stage superposition choice procedures consist in sequential application of two choice procedures where the result of the first choice procedure is the input for the second choice procedures. We focus on the study of properties of such choice procedures and evaluate its computational complexity in order to determine which of two-stage superposition choice procedures can be applied in the case of large amount of alternatives.",
keywords = "Choice Problem, Choice Procedures, Computational Complexity, Superposition",
author = "Sergey Shvydun",
year = "2015",
doi = "10.1007/978-3-319-18167-7_41",
language = "English",
isbn = "9783319181660",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer",
pages = "475--486",
editor = "{Le Thi}, {Hoai An} and Nguyen, {Ngoc Thanh} and Dinh, {Tao Pham}",
booktitle = "Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2015 - Part II",
note = "3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2015 ; Conference date: 11-05-2015 Through 13-05-2015",
}