Abstract
We introduce the operation of composition of domains and show that it reduces the classification of symmetric maximal Condorcet domains to the indecomposable ones. The only non-trivial indecomposable symmetric maximal domains known are the domains consisting of four linear orders examples of which were given by Raynaud (1981) and Danilov and Koshevoy (Order 30(1), 181–194 2013). We call them Raynaud domains and we classify them in terms of simple permutations, a well-researched combinatorial object. We hypothesise that no other indecomposable symmetric maximal domains exist.
Similar content being viewed by others
References
Albert, M.H., Atkinson, M.D.: Simple permutations and pattern restricted permutations. Discret. Math. 300(1-3), 1–15 (2005)
Albert, M.H., Atkinson, M.D., Klazar, M.: The enumeration of simple permutations. Journal of Integer Sequences 6(4):Article 03.4.4 (2003)
Atkinson, M.D., Stitt, T.: Restricted permutations and the wreath product. Discret. Math. 259(1-3), 19–36 (2002)
Brignall, R.: A survey of simple permutations. In: Linton, S., Ruvskuc, N., Vatter, V. (eds) Permutation patterns, London Mathematical Society Lecture Notes Series (376), pages 41–65, Cambridge, Cambridge University Press (2010)
Brignall, R., Vatter, V.: A simple proof of a theorem of Schmerl and Trotter for permutations. J. Comb. 6(1-2), 47–54 (2015)
Chein, M., Habib, M., Maurer, M.C.: Partitive hypergraphs. Discret. Math. 37, 35–50 (1981)
Danilov, V.I., Koshevoy, G.A.: Maximal Condorcet domains. Order 30(1), 181–194 (2013)
Danilov, V.I., Karzanov, A.V., Koshevoy, G.A.: Condorcet domains of tiling type. Discret. Appl. Math. 160(7-8), 933–940 (2012)
Demange, G.: Majority relation and median representative ordering. SERIEs 3(1-2), 95–109 (2012)
Dittrich, T.: Eine Vollstandige Klassifikation Von Condorcet Domains Fur Kleine Alternativenmengen. PhD thesis, Karlsruhe Institute of Technology (2018)
Ehrenfeucht, A., Gabow, H.N., McConnell, R.M., Sullivan, S.J.: An O(n2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs. J. Algorithms 16(2), 283–294 (1994)
Fishburn, P.C.: Acyclic sets of linear orders. Soc. Choice Welf. 14 (1), 113–124 (1996)
Galambos, A., Reiner, V.: Acyclic sets of linear orders via the Bruhat orders. Soc. Choice Welf. 30(2), 245–264 (2008)
Grandmont, J.-M.: Intermediate preferences and the majority rule. Econometrica 46(2), 317–330 (1978)
Guttmann, W., Maucher, M.: Variations on an ordering theme with constraints. In: Navarro, G., Bertossi, L., Kohayakwa, Y. (eds) Proc. 4th IFIP International Conference on Theoretical Computer Science, pages 77–90, Springer (2006)
Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Computer Science Review 4(1), 41–59 (2010)
Inada, K.: A note on the simple majority decision rule. Econometrica 32, 525–531 (1964)
Inada, K.: The simple majority decision rule. Econometrica 37, 490–506 (1969)
Karpov, A.: On the number of group-separable preference profiles. Group Decis. Negot. 28(3), 501–517 (2019)
Karpov, A., Slinko, A.: Constructing large peak-pit Condorcet domains. Theory and Decision. To appear https://doi.org/10.1007/s11238-022-09878-9 (2022)
Kemeny, J., Snell, L.: Mathematical models in the social sciences. Ginn (1960)
Kim, K.H., Roush, F.W., Intriligator, M.D.: Overview of mathematical social sciences. Am. Math. Mon. 99(9), 838–844 (1992)
Labbé, J.-P., Lange, C.E.M.: Cambrian acyclic domains: Counting c-singletons. Order 37, 571–603 (2020)
Laffond, G., Lainé, J., Laslier, J.-F.: Composition-consistent tournament solutions and social choice functions. Soc. Choice Welf. 13(1), 75–93 (1996)
Möhring, R.H.: Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions. Ann. Oper. Res. 4(1), 195–225 (1985)
Möhring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Ann. Discrete Math. 19, 257–356 (1984)
Monjardet, B.: Acyclic domains of linear orders: A survey. In: Brams, S., Gehrlein, W., Roberts, F. (eds.) The Mathematics of Preference, Choice and Order, Studies in Choice and Welfare, pages 139–160. Springer Berlin Heidelberg (2009)
Mulder, H.M.: The structure of median graphs. Discrete Math. 24, 197–204 (1978)
Puppe, C.: The single-peaked domain revisited: a simple global characterization. J. Econ. Theory 176, 55–80 (2018)
Puppe, C., Slinko, A.: Condorcet domains, median graphs and the single-crossing property. Econ. Theor. 67(1), 285–318 (2019)
Raynaud, H.: Paradoxical results from Inada’s conditions for majority rule. Technical report, Stanford University Institute for Mathematical Studies in the Social Sciences (1981)
Schmerl, J.H., Trotter, W.T.: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. Discret. Math. 113(1-3), 191–205 (1993)
Sen, A.K.: A possibility theorem on majority decisions. Econometrica 34(2), 491–499 (1966)
Sen, A.K.: Collective Choice and Social Welfare. Holden-Day, San Francisco (1970)
Slinko, A.: Condorcet domains satisfying Arrow’s single-peakedness. J. Math. Econ. 84, 166–175 (2019)
Sloane, N.J.A, et al.: The on-line encyclopedia of integer sequences (2003)
Tenner, B.E.: Interval posets of permutations. Order. To appear https://doi.org/10.1007/s11083-021-09576-1https://doi.org/10.1007/s11083-021-09576-1 (2022)
Tideman, T.N.: Independence of clones as a criterion for voting rules. Soc. Choice Welf. 4(3), 185–206 (1987)
Ward, B.: Majority voting and alternative forms of public enterprises. In: Margolis, J. (ed.) The Public Economy of Urban Communities, pages 112–126, Baltimore, MD. Johns Hopkins Press (1965)
Zedam, L., Pérez-Fernández, R., Bouremel, H., De Baets, B.: Clonal sets of a binary relation. Int. J. Gen. Syst. 47(4), 329–349 (2018)
Acknowledgements
We are grateful to the Associate Editor and the referees for a very thorough reading of the paper. Alexander Karpov gratefully acknowledges the support by the Basic Research Program of the National Research University Higher School of Economics. Arkadii Slinko was supported by the Faculty Development Research Fund 3719899 of the University of Auckland.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Karpov, A., Slinko, A. Symmetric Maximal Condorcet Domains. Order 40, 289–309 (2023). https://doi.org/10.1007/s11083-022-09612-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-022-09612-8