2017/07/17 by Juan A. Crespo, Crespo, J. A., J. J. Sánchez-Gabites +1
Computer Science · Economics, Econometrics and Finance · #Constraint Satisfaction and Optimization #FOS: Mathematics #Game Theory and Voting Systems #Logic, Reasoning, and Knowledge #Optimization and Control (math.OC)
paper · pdf · doi:10.48550/arxiv.1707.06095
openalex publication_date 2017/07/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In a context where a decision has to be taken collectively by several agents, the social choice problem consists in deciding whether there exists a socially acceptable rule that aggregates the individual preferences of the agents into a social one. We analyze this problem for sets of alternatives defined by equality constraints and obtain a solution that, in sharp contrast to the classical ones, is expressed in an elementary language and ultimately reduces the social choice problem to a standard constrained optimization problem. By considering a toy example we shall be able to interpret this general result in terms of the rationality (in the sense of Economics) of the design of the set of alternatives rather than, surprisingly, that of the agents involved in the actual social choice problem.