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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aizerman, M., Aleskerov, F.: Theory of Choice. Elsevier, North-Holland (1995)
Aleskerov, F.T., Khabina, E.L., Shvarts, D.A.: Binary relations, graphs and collective decisions. HSE Publishing House, Moscow (2006)
Aleskerov, F.T., Kurbanov, E.: On the degree of manipulability of group choice rules. Automation and Remote Control 10, 134–146 (1998)
Volsky, V.I.: Voting rules in small groups from ancient times to the XX century. Working paper WP7/2014/02. HSE Publishing House, Moscow (2014)
Moulin, H.: Axioms of cooperative decision-making. Cambridge University Press, Cambridge (1987)
Aleskerov, F.T., Yuzbashev, D.V., Yakuba, V.I.: Threshold aggregation for three-graded rankings. Automation and Remote Control 1, 147–152 (2007)
Aleskerov, F., Chistyakov, V., Kalyagin, V.: Social threshold aggregations. Social Choice and Welfare 35(4), 627–646 (2010)
Aleskerov, F.: Arrovian Aggregation Models. Kluwer Academic Publishers, Dordrecht (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Shvydun, S. (2015). Properties and Complexity of Some Superposition Choice Procedures. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol 360. Springer, Cham. https://doi.org/10.1007/978-3-319-18167-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-18167-7_41
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18166-0
Online ISBN: 978-3-319-18167-7
eBook Packages: EngineeringEngineering (R0)