STRONG SEQUENCES AND THEIR CONSEQUENCES IN SOCIAL CHOICE
Journal Title: Silesian Journal of Pure and Applied Mathematics - Year 2016, Vol 6, Issue 1
Abstract
One of the most famous theorems in social choice theory – Arrow impossibility theorem – was published in 1951. Since Arrowian paper most researchers tried to find different versions of this theorem not only for finite but also for infinite sets of alternative and individuals, where one can treat this situation as anticipation for future social behaviour. The aim of this paper is to find some results concerning social voting for infinite sets using one of the combinatorial methods of set theory – strong sequences method. This method was introduced by Efimov in 1965 for proving wellknown theorems in dyadic spaces, (i.e. continuous images of the Cantor cube).
Authors and Affiliations
Joanna Jureczko
Keywords
Related Articles
- EP ID EP179595
- DOI -
- Views 84
- Downloads 0
ESTIMATING RAPID FLOW TRANSIENTS USING EXTENDED KALMAN FILTER
Theoretical and numerical modeling of flow transients in pipelines is a challenging field of research. The governing flow equations constitute a system of nonlinear hyperbolic partial differential equations enforcing the...
BASIC SUMS AS PARAMETERS CHARACTERIZING
We discuss the method of distributions’ characterization of geometric objects on the plane. The method is based on the basic sums. These basic sums perform the same role in description of image as the n-point correlation...
STRONG SEQUENCES AND THEIR CONSEQUENCES IN SOCIAL CHOICE
One of the most famous theorems in social choice theory – Arrow impossibility theorem – was published in 1951. Since Arrowian paper most researchers tried to find different versions of this theorem not only for finite bu...
THE MODES OF A MIXTURE OF TWO NORMAL DISTRIBUTIONS
Mixture distributions arise naturally where a statistical population contains two or more subpopulations. Finite mixture distributions refer to composite distributions constructed by mixing a number K of component distri...
CHARACTERISTICS AND DECOMPOSITION OF EXPRESSIONS IN THE PF-NOTATION
The paper presents a selected aspects of classical parenthesis-free notation. With the introduction of the concepts of the pattern of expression and the characteristics were obtained convenient tools for classification a...