Enregistré dans:
Détails bibliographiques
Auteur principal: Poliakov, Nikolay L.
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:https://arxiv.org/abs/2604.01260
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866908931825074176
author Poliakov, Nikolay L.
author_facet Poliakov, Nikolay L.
contents In this paper, we study aggregation rules with nontrivial symmetric classes of invariant sets (restricted domains), assuming that they, unlike others, have a logical nature. In the simplest case, we provide a complete classification of such rules. Our primary tools are methods of universal algebra and the theory of closed classes of discrete functions.
format Preprint
id arxiv_https___arxiv_org_abs_2604_01260
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle What aggregation rules can be classified as logical concepts?
Poliakov, Nikolay L.
Theoretical Economics
Logic
In this paper, we study aggregation rules with nontrivial symmetric classes of invariant sets (restricted domains), assuming that they, unlike others, have a logical nature. In the simplest case, we provide a complete classification of such rules. Our primary tools are methods of universal algebra and the theory of closed classes of discrete functions.
title What aggregation rules can be classified as logical concepts?
topic Theoretical Economics
Logic
url https://arxiv.org/abs/2604.01260