English
Related papers

Related papers: Range results for some social choice correspondenc…

200 papers

We study the manipulability of social choice correspondences in situations where individuals have incomplete information about others' preferences. We propose a general concept of manipulability that depends on the extension rule used to…

Theoretical Economics · Economics 2025-12-16 Raffaele Berzi , Daniela Bubboloni , Michele Gori

A social choice correspondence satisfies balancedness if, for every pair of alternatives, x and y, and every pair of individuals, i and j, whenever a profile has x adjacent to but just above y for individual i while individual j has y…

Combinatorics · Mathematics 2018-04-12 Jerry S. Kelly , Shaofang Qi

Necessary and sufficient conditions are derived for a social choice correspondence to be the one that selects the Pareto optimal alternatives.

Combinatorics · Mathematics 2019-10-30 Jerry S. Kelly

We introduce three different qualifications of the reversal bias in the framework of social choice correspondences. For each of them, we prove that the Minimax social choice correspondence is immune to it if and only if the number of voters…

Combinatorics · Mathematics 2015-12-22 Daniela Bubboloni , Michele Gori

Several rules for social choice are examined from a unifying point of view that looks at them as procedures for revising a system of degrees of belief in accordance with certain specified logical constraints. Belief is here a social…

Artificial Intelligence · Computer Science 2015-05-06 Rosa Camps , Xavier Mora , Laia Saumell

We prove that, for any given set of networks satisfying suitable conditions, the net-oudegree network solution, the net-indegree network solution, and the total network solution are the unique network solutions on that set satisfying…

Computer Science and Game Theory · Computer Science 2024-05-31 Daniela Bubboloni , Michele Gori

We consider the notions of agreement, diversity, and polarization in ordinal elections (that is, in elections where voters rank the candidates). While (computational) social choice offers good measures of agreement between the voters, such…

Computer Science and Game Theory · Computer Science 2023-05-18 Piotr Faliszewski , Andrzej Kaczmarczyk , Krzysztof Sornat , Stanisław Szufa , Tomasz Wąs

In the theory of voting, the Plurality rule for preferences that come in the form of linear orders selects the alternatives most frequently appearing in the first position of those orders, while the Anti-Plurality rule selects the…

Computer Science and Game Theory · Computer Science 2026-05-21 Ulle Endriss , Federico Fioravanti

The social ranking is a recently proposed framework for evaluating the power of individuals according to the performance ranking of their coalitions. Although its origin can be traced to the classical power indices in simple games, social…

Theoretical Economics · Economics 2026-05-19 Takahiro Suzuki , Stefano Moretti , Rachel Ruellé

Many binary collective choice situations can be described as weighted simple voting games. We introduce weighted committee games to model decisions on an arbitrary number of alternatives in analogous fashion. We compare the effect of…

Combinatorics · Mathematics 2019-11-01 Sascha Kurz , Alexander Mayer , Stefan Napel

In approval voting, individuals vote for all platforms that they find acceptable. In this situation it is natural to ask: When is agreement possible? What conditions guarantee that some fraction of the voters agree on even a single…

Combinatorics · Mathematics 2021-08-30 Kristen Mazur , Mutiara Sondjaja , Matthew Wright , Carolyn Yarnall

We view voting rules as classifiers that assign a winner (a class) to a profile of voters' preferences (an instance). We propose to apply techniques from formal explainability, most notably abductive and contrastive explanations, to…

Artificial Intelligence · Computer Science 2024-08-27 Clément Contet , Umberto Grandi , Jérôme Mengin

We present theoretical and empirical results demonstrating the usefulness of voting rules for participatory democracies. We first give algorithms which efficiently elicit \epsilon-approximations to two prominent voting rules: the Borda rule…

Multiagent Systems · Computer Science 2014-07-17 David Lee , Ashish Goel , Tanja Aitamurto , Helene Landemore

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

A method is given for determining a mixed social choice out of a paired-comparison matrix. The method combines a projection procedure introduced in previous papers of the same authors and a classical method due to Zermelo. The resulting…

Combinatorics · Mathematics 2015-05-06 Rosa Camps , Xavier Mora , Laia Saumell

In distortion-based analysis of social choice rules over metric spaces, one assumes that all voters and candidates are jointly embedded in a common metric space. Voters rank candidates by non-decreasing distance. The mechanism, receiving…

Computer Science and Game Theory · Computer Science 2019-11-21 David Kempe

One way of evaluating social choice (voting) rules is through a utilitarian distortion framework. In this model, we assume that agents submit full rankings over the alternatives, and these rankings are generated from underlying, but…

Computer Science and Game Theory · Computer Science 2018-10-03 Ashish Goel , Reyna Hulett , Anilesh K. Krishnaswamy

The one-dimensional long-range voter model, where an agent takes the opinion of another at distance $r$ with probability $\propto r^{-\alpha}$, is studied analytically. The model displays rich and diverse features as $\alpha$ is changed.…

Statistical Mechanics · Physics 2024-06-06 Federico Corberi , Claudio Castellano

The comparison of alternative rankings of a set of items is a general and prominent task in applied statistics. Predictor variables are ranked according to magnitude of association with an outcome, prediction models rank subjects according…

We analyse strategic, complete information, sequential voting with ordinal preferences over the alternatives. We consider several voting mechanisms: plurality voting and approval voting with deterministic or uniform tie-breaking rules. We…

Computer Science and Game Theory · Computer Science 2019-04-19 Oren Dean , Yakov Babichenko , Moshe Tennenholtz
‹ Prev 1 2 3 10 Next ›