zbMATH — the first resource for mathematics

Hyper-stable collective rankings. (English) Zbl 1331.91072
Summary: We introduce a new consistency property for social welfare functions (SWF), called hyper-stability. An SWF is hyper-stable if at any profile over finitely many alternatives where a weak order \(R\) is chosen, there exists a profile of linear orders over linear orders, called hyper-profile, at which only linearizations of \(R\) are ranked first by the SWF. Profiles induce hyper-profiles according to some minimal compatibility conditions. We provide sufficient conditions for hyper-stability, and we investigate hyper-stability for several Condorcet SWFs. An important conclusion is that there are non-dictatorial hyper-stable SWFs.

91B14 Social choice
Full Text: DOI
[1] Binmore, K. G., An example of group preference, J. Econom. Theory, 10, 377-385, (1975) · Zbl 0316.90004
[2] Bouyssou, D., Monotonicity of ‘ranking by choosing’: A progress report, Soc. Choice Welf., 23, 2, 249-273, (2004) · Zbl 1083.91051
[3] Brandt, F.; Brill, M.; Harrenstein, P., Extending tournament solutions, (Proceedings of the 28th AAAI Conference on Artificial Intelligence, (2014), AAAI Press), 580-586
[4] Laffond, G.; Lainé, J., Majority voting on orders, Theory and Decision, 49, 251-289, (2000) · Zbl 0994.91011
[5] Laffond, G.; Lainé, J.; Laslier, J. F., Composition-consistent tournament solutions and social choice functions, Soc. Choice Welf., 13, 75-93, (1996) · Zbl 0843.90007
[6] Lainé, J., Özkes, A.I., Sanver, M.R., Hyper-stable social welfare functions, Cahier de recherche 2013-22, Ecole Polytechnique, Paris, France, 2013.
[7] Laslier, J. F., Tournament solutions and majority voting, (1997), Springer-Verlag · Zbl 0948.91504
[8] McGarvey, D. C., A theorem on the construction of voting paradoxes, Econometrica, 21, 608-610, (1953)
[9] Peris, J. E.; Subiza, B., Condorcet choice correspondences for weak tournaments, Soc. Choice Welf., 16, 217-231, (1999) · Zbl 1066.91541
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.