English
Related papers

Related papers: Differentiating Infinite Voting Populations using …

200 papers

Two characterizations of the whole class of strategy-proof aggregation rules on rich domains of locally unimodal preorders in finite median join-semilattices are provided. In particular, it is shown that such a class consists precisely of…

Theoretical Economics · Economics 2022-08-29 Ernesto Savaglio , Stefano Vannucci

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á

In frequently repeated matching scenarios, individuals may require diversification in their choices. Therefore, when faced with a set of potential outcomes, each individual may have an ideal lottery over outcomes that represents their…

Computer Science and Game Theory · Computer Science 2024-04-29 Rasoul Ramezanian

A reduced-bias nonparametric estimator of the cumulative distribution function (CDF) and the survival function is proposed using infinite-order kernels. Fourier transform theory on generalized functions is utilized to obtain the improved…

Methodology · Statistics 2009-03-18 Arthur Berg , Dimitris N. Politis

A Condorcet cycle election is an election (often called a Social Welfare Function, or SWF) between three candidates, where each voter ranks the three candidates according to a fixed cyclic order. Maskin showed that if such a SWF obeys the…

Combinatorics · Mathematics 2025-11-05 Gabriel Gendler

An embedding theorem for algebraic systems is presented, basing on a certain old ultrafilter construction. As an application, we outline alternative proofs of some results from the theory of PI algebras, and establish some properties of…

Rings and Algebras · Mathematics 2016-08-23 Pasha Zusmanovich

We study social welfare in one-sided matching markets where the goal is to efficiently allocate n items to n agents that each have a complete, private preference list and a unit demand over the items. Our focus is on allocation mechanisms…

Computer Science and Game Theory · Computer Science 2011-04-18 Anand Bhalgat , Deeparnab Chakrabarty , Sanjeev Khanna

Decision making under uncertainty is a key component of many AI settings, and in particular of voting scenarios where strategic agents are trying to reach a joint decision. The common approach to handle uncertainty is by maximizing expected…

Computer Science and Game Theory · Computer Science 2018-11-15 Omer Lev , Reshef Meir , Svetlana Obraztsova , Maria Polukarov

We propose a filtering feature selection framework that considers subsets of features as paths in a graph, where a node is a feature and an edge indicates pairwise (customizable) relations among features, dealing with relevance and…

Computer Vision and Pattern Recognition · Computer Science 2020-06-16 Giorgio Roffo , Simone Melzi , Umberto Castellani , Alessandro Vinciarelli , Marco Cristani

Turing presented a general representation scheme by which to achieve artificial intelligence - unorganised machines. Significantly, these were a form of discrete dynamical system and yet such representations remain relatively unexplored.…

Emerging Technologies · Computer Science 2012-12-07 Larry Bull , Julian Holley , Ben De Lacy Costello , Andrew Adamatzky

When evaluating policies that affect future generations, the most commonly used criterion is the discounted utilitarian rule. However, in terms of intergenerational fairness, it is difficult to justify prioritizing the current generation…

Theoretical Economics · Economics 2025-02-10 Kensei Nakamura

We introduce axiomatically the ring $\bf{Z}_\kappa$ of the Euclidean integers, that can be viewed as the ``integral part" of the field $\mathbb{E}$ of Euclidean numbers of [4], where the transfinite sum of ordinal indexed $\kappa$-sequences…

Logic · Mathematics 2022-12-06 Mauro Di Nasso , Marco Forti

We exhibit the hidden beauty of weighted voting and voting power by applying a generalization of the Penrose-Banzhaf index to social choice rules. Three players who have multiple votes in a committee decide between three options by…

Computer Science and Game Theory · Computer Science 2022-08-01 Sascha Kurz , Alexander Mayer , Stefan Napel

Despite the prevalence of voting systems in the real world there is no consensus among researchers of how people vote strategically, even in simple voting settings. This paper addresses this gap by comparing different approaches that have…

Computer Science and Game Theory · Computer Science 2019-09-24 Roy Fairstein , Adam Lauz , Kobi Gal , Reshef Meir

Social choice theory offers a wealth of approaches for selecting a candidate on behalf of voters based on their reported preference rankings over options. When voters have underlying utilities for these options, however, using preference…

Computer Science and Game Theory · Computer Science 2025-10-24 Luise Ge , Gregory Kehne , Yevgeniy Vorobeychik

Identification of fractional order systems is considered from an algebraic point of view. It allows for a simultaneous estimation of model parameters and fractional (or integer) orders from input and output data. It is exact in that no…

Optimization and Control · Mathematics 2013-02-19 Nicole Gehring , Joachim Rudolph

This paper studies the allocation of voting weights in a committee representing groups of different sizes. We introduce a partial ordering of weight allocations based on stochastic comparison of social welfare. We show that when the number…

Theoretical Economics · Economics 2024-03-07 Kazuya Kikuchi

The Random Utility Model (RUM) is the leading model to represent the aggregate choices of a heterogeneous population of preference maximizers. We show that if (and only if) preferences are sufficiently uncorrelated, RUM choices can also be…

Theoretical Economics · Economics 2025-05-29 Daniele Caliari , Henrik Petri

We present a general setting where wavelet filters and multiresolution decompositions can be defined, beyond the classical $\mathbf L^2(\mathbb R,dx)$ setting. This is done in a framework of {\em iterated function system} (IFS) measures;…

Functional Analysis · Mathematics 2022-08-31 Daniel Alpay , Palle Jorgensen , Izchak Lewkowicz

We show that there is a set of $2^{2^{\kappa}}$ ultrafilters incomparable in Rudin-Frol\'ik order of $\beta \kappa \setminus \kappa$, where $\kappa$ is regular, for which no subset with more than one element has an infimum.

Logic · Mathematics 2023-04-12 Joanna Jureczko