Skip to main content
SpringerLink
Log in

Reduction Theorems in the Social Choice Theory

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

In the paper, combinatorial theorems related to the theory of social choice are obtained. These theorems describe general conditions under which the problem on the preserving the preference set 𝒟 by an arbitrary aggregation rule f and the problem on the compatibility of the preference set 𝒟 with a pair (f, 𝒞) can be reduced to similar problems for two specific aggregation rules: the majority rule maj and the “counting rhyme” rule cog. Results are obtained within the framework of clone approach in the theory of social choice proposed by S. Shelah and developed by the authors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. Arrow, Social Choice and Individual Values, Yale University Press (1963).

    MATH  Google Scholar 

  2. F. T. Aleskerov, Arrovian Aggregation Models, Springer, New York (1999).

    Book  MATH  Google Scholar 

  3. V. G. Bodnarchuk, L. A. Kaluzhnin, V. N. Kotov, and B. A. Romov, “Galois theory for Post algebras, I,” Kibernetika, 3, 1–10 (1969).

    MathSciNet  Google Scholar 

  4. V. G. Bodnarchuk, L. A. Kaluzhnin, V. N. Kotov, and B. A. Romov, “Galois theory for Post algebras, II,” Kibernetika, 5, 1–9 (1969).

    MathSciNet  Google Scholar 

  5. P. M. Cohn, Universal Algebra, Harper and Row, New York–Evanston–London: (1965).

  6. M. Kaneko, “Necessary and suffient condition for transitivity in voting theory,” J. Econ. Theory, 11, 385–393 (1975).

    Article  MATH  Google Scholar 

  7. A. G. Kurosh, Lectures in General Algebra [in Russian], Lan, Saint Petergburg (2005).

  8. A. I. Malcev, “Iterative algebras and Post varieties,” Algebra Logika, 5, No. 2, 5–24 (1966).

    MathSciNet  Google Scholar 

  9. S. S. Marchenkov, Closed Classes of Boolean Functions [in Russian], Fizmatlit, Moscow (2000).

  10. S. S. Marchenkov, “Clone classification of dually discriminator algebras with finite support,” Mat. Zametki, 61, No. 3, 359–366 (1997).

    MathSciNet  MATH  Google Scholar 

  11. S. S. Marchenkov, Functional Systems with Superposition Operation [in Russian], Fizmatlit, Moscow (2004).

  12. H. Moulin, Axioms of Cooperative Decision Making, Cambridge Univ. Press (1991).

    MATH  Google Scholar 

  13. Nguyen Van Hoa, “Families of closed classes of k-valued logic that are preserved by all automorphisms,” Diskr. Mat., 5, No. 4, 87–108 (1993).

    MathSciNet  MATH  Google Scholar 

  14. N. G. Parvatov, “Galois correspondence for closed classes of discrete functions,” Prikl. Diskr. Mat., 2 (8), 10–15 (2010).

    MATH  Google Scholar 

  15. N. L. Polyakov, Functional Galois connections and a classification of symmetric conservative clones with a finite carrier, arXiv: 1810.02945 [math.LO].

  16. N. L. Polyakov and M. V. Shamolin, “Onclosed symmetric classes of functions that preserve all unary predicates,” Vestn. Samar. Univ. Estestvennonauch. Ser., No. (6) 107, 61–73 (2013).

  17. N. L. Polyakov and M. V. Shamolin, “On a generalization of Arrow’s impossibility theorem,” Dokl. Math., 89, No. 3, 290–292 (2014).

    Article  MathSciNet  MATH  Google Scholar 

  18. E. L. Post, Two-Valued Iterative Systems of Mathematical Logic, Princeton Univ. Press (1941).

  19. A. K. Sen, “A possibility theorem on majority decisions,” Econometrica, 3, No. 4, 491–499 (1966).

    Article  MATH  Google Scholar 

  20. S. Shelah, “On the Arrow property,” Adv. Appl. Math., 34, 217–251 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  21. S. Shelah, “What majority decisions are possible,” Discr. Math., 309, 2349–2364 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  22. I. G. Rosenberg, “La structure des fonctions de plusieurs variables sur un ensemble fini,” C. R. Acad. Sci. Paris. Ser. A. B., 260, 3817–3819 (1965).

    MathSciNet  MATH  Google Scholar 

  23. A. Rubinstein and P. Fishburn, “Algebraic aggregation theory,” J. Econ. Theory, 38 (1986).

  24. S. V. Yablonsky, “Functional constructions in k-valued logic,” Tr. Mat. Inst. Steklova, 51, 5–142 (1958).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Research University “Higher School of Economics”, Moscow, Russia

    N. L. Polyakov

  2. M. V. Lomonosov Moscow State University, Moscow, Russia

    M. V. Shamolin

Authors
  1. N. L. Polyakov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. V. Shamolin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. L. Polyakov.

Additional information

Translated from Itogi Nauki i Tekhniki, Seriya Sovremennaya Matematika i Ee Prilozheniya. Tematicheskie Obzory, Vol. 174, Geometry and Mechanics, 2020.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) 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.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Polyakov, N.L., Shamolin, M.V. Reduction Theorems in the Social Choice Theory. J Math Sci 272, 667–671 (2023). https://doi.org/10.1007/s10958-023-06463-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-023-06463-5

Keywords and phrases

AMS Subject Classification

Search

Navigation