English
Related papers

Related papers: Metric Distortion in Peer Selection

200 papers

Computational social choice and algorithmic decision theory offer rich aggregation theory but no comprehensive process for egalitarian self-governance: aggregation, deliberation, amendment, and consensus are each considered in isolation,…

Multiagent Systems · Computer Science 2026-05-15 Ehud Shapiro , Nimrod Talmon

We introduce a single-winner perspective on voting on matchings, in which voters have preferences over possible matchings in a graph, and the goal is to select a single collectively desirable matching. Unlike in classical matching problems,…

Computer Science and Game Theory · Computer Science 2026-01-28 Niclas Boehmer , Jessica Dierking

We introduce the notion of statistical distortion as an essential metric for measuring the effectiveness of data cleaning strategies. We use this metric to propose a widely applicable yet scalable experimental framework for evaluating data…

Databases · Computer Science 2012-08-10 Tamraparni Dasu , Ji Meng Loh

In the Shift Bribery problem, we are given an election (based on preference orders), a preferred candidate $p$, and a budget. The goal is to ensure that $p$ wins by shifting $p$ higher in some voters' preference orders. However, each such…

Multiagent Systems · Computer Science 2016-11-29 Robert Bredereck , Jiehua Chen , Piotr Faliszewski , André Nichterlein , Rolf Niedermeier

In the online metric matching problem, $n$ servers and $n$ requests lie in a metric space. Servers are available upfront, and requests arrive sequentially. An arriving request must be matched immediately and irrevocably to an available…

Data Structures and Algorithms · Computer Science 2026-04-22 Yingxi Li , Ellen Vitercik , Mingwei Yang

Modeling and shaping how information spreads through a network is a major research topic in network analysis. While initially the focus has been mostly on efficiency, recently fairness criteria have been taken into account in this setting.…

Social and Information Networks · Computer Science 2023-02-28 Ruben Becker , Gianlorenzo D'Angelo , Sajjad Ghobadi

Consider a committee election consisting of (i) a set of candidates who are divided into arbitrary groups each of size ${at~most}$ two and a diversity constraint that stipulates the selection of ${at~least}$ one candidate from each group…

Computational Complexity · Computer Science 2025-10-22 Kunal Relia

Despite extensive theoretical research on proportionality in approval-based multiwinner voting, its impact on which committees and candidates can be selected in practice remains poorly understood. We address this gap by (i) analyzing the…

Computer Science and Game Theory · Computer Science 2025-11-13 Niclas Boehmer , Lara Glessen , Jannik Peters

In large scale collective decision making, social choice is a normative study of how one ought to design a protocol for reaching consensus. However, in instances where the underlying decision space is too large or complex for ordinal…

Computer Science and Game Theory · Computer Science 2017-10-03 Brandon Fain , Ashish Goel , Kamesh Munagala , Sukolsak Sakshuwong

We consider a social choice problem where only a small number of people out of a large population are sufficiently available or motivated to vote. A common solution to increase participation is to allow voters use a proxy, that is, transfer…

Computer Science and Game Theory · Computer Science 2016-11-28 Gal Cohensius , Shie Manor , Reshef Meir , Eli Meirom , Ariel Orda

In parliamentary elections, parties compete for a limited, typically fixed number of seats. Most parliaments are assembled using apportionment methods that distribute the seats based on the parties' vote counts. Common apportionment methods…

In many real-world applications of committee elections, the candidates are associated with certain attributes and the chosen committee is required to satisfy some constraints posed on the candidate attributes. For instance, when dress…

Computational Complexity · Computer Science 2024-05-09 Aizhong Zhou , Fengbo Wang , Jiong Guo

Winner selection by majority, in an election between two candidates, is the only rule compatible with democratic principles. Instead, when the candidates are three or more and the voters rank candidates in order of preference, there are no…

Physics and Society · Physics 2016-04-19 Pierluigi Contucci , Emanuele Panizzi , Federico Ricci-Tersenghi , Alina Sîrbu

Several measures of partisan bias are reviewed for single member districts with two dominant parties. These include variants of the simple bias that considers only deviation of seats from 50% at statewide 50% vote. Also included are…

Physics and Society · Physics 2020-06-26 John F. Nagle

We study the problem of selecting a representative committee of $k$ agents from a collection of $n$ agents in a common metric space. This problem is related to choosing $k$ facilities in facility location and $k$-median problems. However,…

Computer Science and Game Theory · Computer Science 2025-10-27 Christopher Jerrett , Elliot Anshelevich

In this work, we study the socially fair $k$-median/$k$-means problem. We are given a set of points $P$ in a metric space $\mathcal{X}$ with a distance function $d(.,.)$. There are $\ell$ groups: $P_1,\dotsc,P_{\ell} \subseteq P$. We are…

Data Structures and Algorithms · Computer Science 2021-09-14 Dishant Goyal , Ragesh Jaiswal

We analyse two-tier voting systems with voters described by a multi-group mean-field model that allows for correlated voters both within groups as well as across group boundaries. In this model voters are influenced by voters within their…

Probability · Mathematics 2025-09-16 Werner Kirsch , Gabor Toth

In recent years, in an effort to promote fairness in the election process, a wide variety of techniques and metrics have been proposed to determine whether a map is a partisan gerrymander. The most accessible measures, requiring easily…

Physics and Society · Physics 2025-08-11 Thomas Ratliff , Stephanie Somersille , Ellen Veomett

Many societal decision problems lie in high-dimensional continuous spaces not amenable to the voting techniques common for their discrete or single-dimensional counterparts. These problems are typically discretized before running an…

Multiagent Systems · Computer Science 2018-10-30 Nikhil Garg , Vijay Kamble , Ashish Goel , David Marn , Kamesh Munagala

We consider the participatory budgeting problem where each of $n$ voters specifies additive utilities over $m$ candidate projects with given sizes, and the goal is to choose a subset of projects (i.e., a committee) with total size at most…

Computer Science and Game Theory · Computer Science 2026-01-07 Kamesh Munagala , Yiheng Shen , Kangning Wang
‹ Prev 1 4 5 6 7 8 10 Next ›