English
Related papers

Related papers: Metric Distortion in Peer Selection

200 papers

Mechanism design is concerned with settings where a policymaker (or social planner) faces the problem of aggregating the announced preferences of multiple agents into a collective (or social), system-wide decision. One of the most important…

Multiagent Systems · Computer Science 2020-03-02 Mohammad Ali Javidian , Pooyan Jamshidi , Marco Valtorta , Rasoul Ramezanian

The apportionment problem constitutes a fundamental problem in democratic societies: How to distribute a fixed number of seats among a set of states in proportion to the states' populations? This--seemingly simple--task has led to a rich…

Computer Science and Game Theory · Computer Science 2024-11-01 Javier Cembrano , José Correa , Ulrike Schmidt-Kraepelin , Alexandros Tsigonias-Dimitriadis , Victor Verdugo

We study social choice mechanisms in an implicit utilitarian framework with a metric constraint, where the goal is to minimize \textit{Distortion}, the worst case social cost of an ordinal mechanism relative to underlying cardinal…

Computer Science and Game Theory · Computer Science 2020-07-03 Brandon Fain , Ashish Goel , Kamesh Munagala , Nina Prabhu

In voting with ranked ballots, each agent submits a strict ranking of the form $a \succ b \succ c \succ d$ over the alternatives, and the voting rule decides on the winner based on these rankings. Although this ballot format has desirable…

Computer Science and Game Theory · Computer Science 2026-01-06 Mehrad Abbaszadeh , Ali Ansarifar , Mohamad Latifian , Masoud Seddighin

We study the model of metric voting proposed by Feldman et al. [2020]. In this model, experts and candidates are located in a metric space, and each candidate possesses a quality that is independent of her location. An expert evaluates each…

Computer Science and Game Theory · Computer Science 2023-06-26 Yang Cai , Eric Xue

A key promise of democratic voting is that, by accounting for all constituents' preferences, it produces decisions that benefit the constituency overall. It is alarming, then, that all deterministic voting rules have unbounded distortion:…

Computer Science and Game Theory · Computer Science 2023-05-22 Bailey Flanigan , Ariel D. Procaccia , Sven Wang

In Spatial Voting Theory, distortion is a measure of how good the winner is. It is proved that no deterministic voting mechanism can guarantee a distortion better than $3$, even for simple metrics such as a line. In this study, we wish to…

Computer Science and Game Theory · Computer Science 2020-08-04 Mohammad Ghodsi , Mohamad Latifian , Masoud Seddighin

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

Classical work on metric space based committee selection problem interprets distance as ``near is better''. In this work, motivated by real-life situations, we interpret distance as ``far is better''. Formally stated, we initiate the study…

Data Structures and Algorithms · Computer Science 2024-05-27 Sushmita Gupta , Tanmay Inamdar , Pallavi Jain , Daniel Lokshtanov , Fahad Panolan , Saket Saurabh

Motivated by civic problems such as participatory budgeting and multiwinner elections, we consider the problem of public good allocation: Given a set of indivisible projects (or candidates) of different sizes, and voters with different…

Computer Science and Game Theory · Computer Science 2021-10-26 Kamesh Munagala , Yiheng Shen , Kangning Wang , Zhiyi Wang

We study low sample complexity mechanisms in participatory budgeting (PB), where each voter votes for a preferred allocation of funds to various projects, subject to project costs and total spending constraints. We analyze the distortion…

Computer Science and Game Theory · Computer Science 2023-06-27 Mohak Goyal , Sukolsak Sakshuwong , Sahasrajit Sarmasarkar , Ashish Goel

We study a version of the metric facility location problem (or, equivalently, variants of the committee selection problem) in which we must choose $k$ facilities in an arbitrary metric space to serve some set of clients $C$. We consider…

Data Structures and Algorithms · Computer Science 2025-07-24 Yue Han , Elliot Anshelevich

Polarization is a major concern for a well-functioning society. Often, mass polarization of a society is driven by polarizing political representation, even when the latter is easily preventable. The existing computational social choice…

Computer Science and Game Theory · Computer Science 2025-09-03 Chris Dong , Martin Bullinger , Tomasz Wąs , Larry Birnbaum , Edith Elkind

We study matching settings in which a set of agents have private utilities over a set of items. Each agent reports a partition of the items into approval sets of different threshold utility levels. Given this limited information on input,…

Computer Science and Game Theory · Computer Science 2024-01-19 Mohamad Latifian , Alexandros A. Voudouris

We consider a setting with agents that have preferences over alternatives and are partitioned into disjoint districts. The goal is to choose one alternative as the winner using a mechanism which first decides a representative alternative…

Computer Science and Game Theory · Computer Science 2023-01-10 Aris Filos-Ratsikas , Alexandros A. Voudouris

In multiwinner approval elections with many candidates, voters may struggle to determine their preferences over the entire slate of candidates. It is therefore of interest to explore which (if any) fairness guarantees can be provided under…

Computer Science and Game Theory · Computer Science 2025-10-14 Drew Springham , Edith Elkind , Bart de Keijzer , Maria Polukarov

We introduce average-distortion sketching for metric spaces. As in (worst-case) sketching, these algorithms compress points in a metric space while approximately recovering pairwise distances. The novelty is studying average-distortion: for…

Data Structures and Algorithms · Computer Science 2025-04-11 Yiqiao Bao , Anubhav Baweja , Nicolas Menand , Erik Waingarten , Nathan White , Tian Zhang

Peer reviews, evaluations, and selections are a fundamental aspect of modern science. Funding bodies the world over employ experts to review and select the best proposals from those submitted for funding. The problem of peer selection,…

Computer Science and Game Theory · Computer Science 2019-05-01 Haris Aziz , Omer Lev , Nicholas Mattei , Jeffrey S. Rosenschein , Toby Walsh

Most social choice rules assume access to full rankings, while current alignment practice -- despite aiming for diversity -- typically treats voters as anonymous and comparisons as independent, effectively extracting only about one bit per…

Computer Science and Game Theory · Computer Science 2026-03-23 Luise Ge , Daniel Halpern , Gregory Kehne , Yevgeniy Vorobeychik

We study multiwinner elections with approval-based preferences. An instance of a multiwinner election consists of a set of alternatives, a population of voters---each voter approves a subset of alternatives, and the desired committee size…

Computer Science and Game Theory · Computer Science 2019-10-15 Piotr Skowron