English
Related papers

Related papers: Optimized Distortion and Proportional Fairness in …

200 papers

We introduce a novel definition for a small set R of k points being "representative" of a larger set in a metric space. Given a set V (e.g., documents or voters) to represent, and a set C of possible representatives, our criterion requires…

Computer Science and Game Theory · Computer Science 2024-01-25 Yusuf Hakan Kalayci , David Kempe , Vikram Kher

Recent works have studied the design of algorithms for selecting representative sortition panels. However, the most central question remains unaddressed: Do these panels reflect the entire population's opinion? We present a positive answer…

Computer Science and Game Theory · Computer Science 2024-06-05 Ioannis Caragiannis , Evi Micha , Jannik Peters

There is a lack of consensus within the literature as to how `fairness' of algorithmic systems can be measured, and different metrics can often be at odds. In this paper, we approach this task by drawing on the ethical frameworks of…

Computers and Society · Computer Science 2023-02-08 Daniel E. Rigobon

We study fair multi-objective reinforcement learning in which an agent must learn a policy that simultaneously achieves high reward on multiple dimensions of a vector-valued reward. Motivated by the fair resource allocation literature, we…

Computer Science and Game Theory · Computer Science 2024-02-09 Zimeng Fan , Nianli Peng , Muhang Tian , Brandon Fain

Iterative voting is a natural model of repeated strategic decision-making in social choice theory when agents have the opportunity to update their votes prior to finalizing the group decision. Prior work has analyzed the efficacy of…

Computer Science and Game Theory · Computer Science 2025-06-12 Joshua Kavner , Lirong Xia

Current methodologies in machine learning analyze the effects of various statistical parity notions of fairness primarily in light of their impacts on predictive accuracy and vendor utility loss. In this paper, we propose a new framework…

Machine Learning · Computer Science 2018-07-04 Lily Hu , Yiling Chen

We study the problem of coalitional manipulation---where $k$ manipulators try to manipulate an election on $m$ candidates---under general scoring rules, with a focus on the Borda protocol. We do so both in the weighted and unweighted…

Data Structures and Algorithms · Computer Science 2017-08-17 Orgad Keller , Avinatan Hassidim , Noam Hazon

The proportional veto principle, which captures the idea that a candidate vetoed by a large group of voters should not be chosen, has been studied for ranked ballots in single-winner voting. We introduce a version of this principle for…

Computer Science and Game Theory · Computer Science 2025-05-05 Daniel Halpern , Ariel D. Procaccia , Warut Suksompong

We consider committee election of $k \geq 2$ (out of $m \geq k+1$) candidates, where the voters and the candidates are associated with locations on the real line. Each voter's cardinal preferences over candidates correspond to her distance…

Computer Science and Game Theory · Computer Science 2024-09-10 Dimitris Fotakis , Laurent Gourvès , Panagiotis Patsilinakos

Participatory budgeting (PB) is a voting paradigm for distributing a divisible resource, usually called a budget, among a set of projects by aggregating the preferences of individuals over these projects. It is implemented quite extensively…

Computer Science and Game Theory · Computer Science 2024-10-29 Gogulapati Sreedurga

When selecting committees based on preferences of voters, a variety of different criteria can be considered. Two natural objectives are maximizing the utilitarian welfare (the sum of voters' utilities) and coverage (the number of…

Computer Science and Game Theory · Computer Science 2023-12-14 Markus Brill , Jannik Peters

Motivated by the difficulty of specifying complete ordinal preferences over a large set of $m$ candidates, we study voting rules that are computable by querying voters about $t < m$ candidates. Generalizing prior works that focused on…

Computer Science and Game Theory · Computer Science 2024-09-30 Daniel Halpern , Safwan Hossain , Jamie Tucker-Foltz

Coalitional manipulation in voting is considered to be any scenario in which a group of voters decide to misrepresent their vote in order to secure an outcome they all prefer to the first outcome of the election when they vote honestly. The…

Theoretical Economics · Economics 2020-09-28 Mostapha Diss , Boris Tsvelikhovskiy

We characterise multi-candidate pure-strategy equilibria in the Hotelling-Downs spatial election model for the class of best-worst voting rules, in which each voter is endowed with both a positive and a negative vote, i.e., each voter can…

Computer Science and Game Theory · Computer Science 2016-10-11 Dodge Cahan , Arkadii Slinko

Much of statistics relies upon four key elements: a law of large numbers, a calculus to operationalize stochastic convergence, a central limit theorem, and a framework for constructing local approximations. These elements are…

Optimization and Control · Mathematics 2018-01-09 Anil Aswani

This article aims to present a unified framework for grading-based voting processes. The idea is to represent the grades of each voter on d candidates as a point in R^d and to define the winner of the vote using the deepest point of the…

Other Statistics · Statistics 2021-12-21 Jean-Baptiste Aubin , Irène Gannaz , Samuela Leoni-Aubin , Antoine Rolland

Many fairness criteria constrain the policy or choice of predictors, which can have unwanted consequences, in particular, when optimizing the policy under such constraints. Here, we advocate to instead focus on the utility function the…

Machine Learning · Statistics 2025-03-19 Frederik Hytting Jørgensen , Sebastian Weichwald , Jonas Peters

We study a model of proxy voting where the candidates, voters, and proxies are all located on the real line, and instead of voting directly, each voter delegates its vote to the closest proxy. The goal is to find a set of proxies that is…

Computer Science and Game Theory · Computer Science 2020-12-15 Elliot Anshelevich , Zack Fitzsimmons , Rohit Vaish , Lirong Xia

Sortition is based on the idea of choosing randomly selected representatives for decision making. The main properties that make sortition particularly appealing are fairness -- all the citizens can be selected with the same probability --…

Computer Science and Game Theory · Computer Science 2024-06-04 Soroush Ebadian , Evi Micha

We introduce a general approach based on \emph{selective verification} and obtain approximate mechanisms without money for maximizing the social welfare in the general domain of utilitarian voting. Having a good allocation in mind, a…

Computer Science and Game Theory · Computer Science 2015-07-10 Dimitris Fotakis , Christos Tzamos , Emmanouil Zampetakis
‹ Prev 1 4 5 6 7 8 10 Next ›