中文
相关论文

相关论文: Distortion in Social Choice Problems: The First 15…

200 篇论文

In most social choice settings, the participating agents express their preferences over the different alternatives in the form of linear orderings. While this clearly simplifies preference elicitation, it inevitably leads to poor…

计算机科学与博弈论 · 计算机科学 2022-10-05 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros A. Voudouris

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…

计算机科学与博弈论 · 计算机科学 2025-10-24 Luise Ge , Gregory Kehne , Yevgeniy Vorobeychik

In computational social choice, the distortion of a voting rule quantifies the degree to which the rule overcomes limited preference information to select a socially desirable outcome. This concept has been investigated extensively, but…

计算机科学与博弈论 · 计算机科学 2023-12-11 Yannai A. Gonczarowski , Gregory Kehne , Ariel D. Procaccia , Ben Schiffer , Shirley Zhang

We consider a social choice setting with agents that are partitioned into disjoint groups, and have metric preferences over a set of alternatives. Our goal is to choose a single alternative aiming to optimize various objectives that are…

计算机科学与博弈论 · 计算机科学 2021-07-13 Elliot Anshelevich , Aris Filos-Ratsikas , Alexandros A. Voudouris

We study the utilitarian distortion of social choice mechanisms under the recently proposed learning-augmented framework where some (possibly unreliable) predicted information about the preferences of the agents is given as input. In…

计算机科学与博弈论 · 计算机科学 2025-02-11 Aris Filos-Ratsikas , Georgios Kalantzis , Alexandros A. Voudouris

In the single winner determination problem, we have n voters and m candidates and each voter j incurs a cost c(i, j) if candidate i is chosen. Our objective is to choose a candidate that minimizes the expected total cost incurred by the…

计算机科学与博弈论 · 计算机科学 2021-11-18 Haripriya Pulyassary , Chaitanya Swamy

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…

计算机科学与博弈论 · 计算机科学 2018-10-03 Ashish Goel , Reyna Hulett , Anilesh K. Krishnaswamy

A voting rule decides on a probability distribution over a set of m alternatives, based on rankings of those alternatives provided by agents. We assume that agents have cardinal utility functions over the alternatives, but voting rules have…

计算机科学与博弈论 · 计算机科学 2024-01-23 Soroush Ebadian , Anson Kahng , Dominik Peters , Nisarg Shah

We study social choice rules under the utilitarian distortion framework, with an additional metric assumption on the agents' costs over the alternatives. In this approach, these costs are given by an underlying metric on the set of all…

计算机科学与博弈论 · 计算机科学 2021-01-15 Ashish Goel , Anilesh Kollagunta Krishnaswamy , Kamesh Munagala

{\em Distortion} is a well-established notion for quantifying the loss of social welfare that may occur in voting. As voting rules take as input only ordinal information, they are essentially forced to neglect the exact values the agents…

计算机科学与博弈论 · 计算机科学 2024-10-15 Ioannis Caragiannis , Karl Fehrs

Voting can abstractly model any decision-making scenario and as such it has been extensively studied over the decades. Recently, the related literature has focused on quantifying the impact of utilizing only limited information in the…

计算机科学与博弈论 · 计算机科学 2020-01-07 Aris Filos-Ratsikas , Evi Micha , Alexandros A. Voudouris

In this note, we uncover three connections between the metric distortion problem and voting methods and axioms from the social choice literature.

计算机科学与博弈论 · 计算机科学 2023-05-16 Jannik Peters

In the metric distortion problem, a set of voters and candidates lie in a common metric space, and a committee of $k$ candidates must be elected. The objective is to minimize a social cost, defined as a function of the distances between…

计算机科学与博弈论 · 计算机科学 2025-10-16 Javier Cembrano , Golnoosh Shahkarami

We determine the quality of randomized social choice mechanisms in a setting in which the agents have metric preferences: every agent has a cost for each alternative, and these costs form a metric. We assume that these costs are unknown to…

人工智能 · 计算机科学 2016-09-27 Elliot Anshelevich , John Postl

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…

计算机科学与博弈论 · 计算机科学 2023-01-10 Aris Filos-Ratsikas , Alexandros A. Voudouris

We study higher statistical moments of Distortion for randomized social choice in a metric implicit utilitarian model. The Distortion of a social choice mechanism is the expected approximation factor with respect to the optimal utilitarian…

计算机科学与博弈论 · 计算机科学 2020-04-29 Brandon Fain , William Fan , Kamesh Munagala

Aggregating the preferences of individuals into a collective decision is the core subject of study of social choice theory. In 2006, Procaccia and Rosenschein considered a utilitarian social choice setting, where the agents have explicit…

计算机科学与博弈论 · 计算机科学 2021-04-16 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros A. Voudouris

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…

数据库 · 计算机科学 2012-08-10 Tamraparni Dasu , Ji Meng Loh

In some rate-distortion-type problems, the required fidelity of information is affected by past actions. As a result, the distortion function depends not only on the instantaneous distortion between a source symbol and its representation…

信息论 · 计算机科学 2026-01-30 Hamidreza Abin , Amin Gohari , Andrew W. Eckford

We consider models for social choice where voters rank a set of choices (or alternatives) by deliberating in small groups of size at most $k$, and these outcomes are aggregated by a social choice rule to find the winning alternative. We…

计算机科学与博弈论 · 计算机科学 2025-03-21 Ashish Goel , Mohak Goyal , Kamesh Munagala
‹ 上一页 1 2 3 10 下一页 ›