English
Related papers

Related papers: Applying Fourier Analysis to Judgment Aggregation

200 papers

The well-known Condorcet Jury Theorem states that, under majority rule, the better of two alternatives is chosen with probability approaching one as the population grows. We study an asymmetric setting where voters face varying…

Computer Science and Game Theory · Computer Science 2025-10-22 Reshef Meir , Ganesh Ghalme

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

Number Theory · Mathematics 2016-01-27 Nikos Frantzikinakis , Bernard Host

We study how linear orders can be employed to realise choice functions for which the set of potential choices is restricted, i.e., the possible choice is not possible among the full powerset of all alternatives. In such restricted settings,…

Artificial Intelligence · Computer Science 2025-09-05 Kai Sauerwald , Kenneth Skiba , Eduardo Fermé , Thomas Meyer

Let A be a class of objects, equipped with an integer size such that for all n the number a(n) of objects of size n is finite. We are interested in the case where the generating fucntion sum_n a(n) t^n is rational, or more generally…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Mélou

Algorithmic decision making has proliferated and now impacts our daily lives in both mundane and consequential ways. Machine learning practitioners make use of a myriad of algorithms for predictive models in applications as diverse as movie…

Machine Learning · Statistics 2023-02-15 Elena Khusainova , Emily Dodwell , Ritwik Mitra

Combinatorial preference aggregation has many applications in AI. Given the exponential nature of these preferences, compact representations are needed and ($m$)CP-nets are among the most studied ones. Sequential and global voting are two…

Artificial Intelligence · Computer Science 2019-03-28 Thomas Lukasiewicz , Enrico Malizia

We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determination problem); (2) deciding whether a given agent can…

Multiagent Systems · Computer Science 2014-01-24 Ulle Endriss , Umberto Grandi , Daniele Porello

This paper revisits impossibility results on the tyrannies of aggregation and non-aggregation. I propose two aggregation principles (quantitative aggregation and ratio aggregation) and investigate theoretical implications. As a result, I…

Theoretical Economics · Economics 2025-01-20 Norihito Sakamoto

We present a unifying framework encompassing many social choice settings. Viewing each social choice setting as voting in a suitable metric space, we consider a general model of social choice over metric spaces, in which---similarly to the…

Multiagent Systems · Computer Science 2023-12-11 Laurent Bulteau , Gal Shahaf , Ehud Shapiro , Nimrod Talmon

Complex reasoning problems are most clearly and easily specified using logical rules, but require recursive rules with aggregation such as count and sum for practical applications. Unfortunately, the meaning of such rules has been a…

Databases · Computer Science 2023-08-29 Yanhong A. Liu , Scott D. Stoller

We review neural network architectures which were motivated by Fourier series and integrals and which are referred to as Fourier neural networks. These networks are empirically evaluated in synthetic and real-world tasks. Neither of them…

Neural and Evolutionary Computing · Computer Science 2023-10-26 Abylay Zhumekenov , Malika Uteuliyeva , Olzhas Kabdolov , Rustem Takhanov , Zhenisbek Assylbekov , Alejandro J. Castro

In this paper we consider two-opinion voter models on dynamic random graphs, in which the joint dynamics of opinions and graphs acts as one-way feedback, i.e., edges appear and disappear over time depending on the opinions of the two…

Probability · Mathematics 2026-05-06 Simone Baldassarri , Nikolai Kriukov

Recently, Ivan Mihajlin and Alexander Smal proved a composition theorem of a universal relation and some function via so called xor composition, that is there exists some function $f:\{0,1\}^n \rightarrow \{0,1\}$ such that…

Computational Complexity · Computer Science 2023-11-14 Hao Wu

This paper seeks to apply categorical logic to the design of artificial intelligent agents that reason symbolically about objects more richly structured than sets. Using Johnstone's sequent calculus of terms- and formulae-in-context, we…

Artificial Intelligence · Computer Science 2025-04-29 Ralph Wojtowicz

We show that if G is a finite group and f is a {0,1}-valued function on G with Fourier algebra norm at most M then f may be computed by a coset decision tree (that is a decision tree in which at each vertex we query membership of a given…

Classical Analysis and ODEs · Mathematics 2019-11-11 Tom Sanders

Theoretical results underpinning the Wisdom of Crowds, such as the Condorcet Jury Theorem, point to substantial accuracy gains through aggregation of decisions or opinions, but the foundations of this theorem are routinely undermined in…

Optimization and Control · Mathematics 2025-10-28 Richard P Mann

We propose a probabilistic model to aggregate the answers of respondents answering multiple-choice questions. The model does not assume that everyone has access to the same information, and so does not assume that the consensus answer is…

Machine Learning · Statistics 2017-03-16 John McCoy , Drazen Prelec

To understand and summarize approval preferences and other binary evaluation data, it is useful to order the items on an axis which explains the data. In a political election using approval voting, this could be an ideological left-right…

Computer Science and Game Theory · Computer Science 2024-05-08 Théo Delemazure , Chris Dong , Dominik Peters , Magdaléna Tydrichová

Inspired by e-participation systems, in this paper we propose a new model to represent human debates and methods to obtain collective conclusions from them. This model overcomes drawbacks of existing approaches by allowing users to…

Artificial Intelligence · Computer Science 2020-07-15 Jordi Ganzer , Natalia Criado , Maite Lopez-Sanchez , Simon Parsons , Juan A. Rodriguez-Aguilar

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

Logic in Computer Science · Computer Science 2023-10-20 Alexander V. Gheorghiu , David J. Pym