Properties and Complexity of Some Superposition Choice Procedures

DOI10.1007/978-3-319-18167-7_41zbMath1371.91055OpenAlexW757795384MaRDI QIDQ5357787

Sergey Shvydun

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18167-7_41

zbMATH Keywords

computational complexitysuperpositionchoice procedureschoice problem

Mathematics Subject Classification ID

Social choice (91B14)

Cites Work

• Social threshold aggregations
• Threshold aggregation of the three-graded rankings
• Arrovian aggregation models
• On the degree of manipulability of social choice rules
• Unnamed Item

This page was built for publication: Properties and Complexity of Some Superposition Choice Procedures