English
Related papers

Related papers: Utilitarian Distortion with Predictions

200 papers

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…

Computer Science and Game Theory · Computer Science 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…

Computer Science and Game Theory · Computer Science 2025-10-24 Luise Ge , Gregory Kehne , Yevgeniy Vorobeychik

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

We consider the one-sided matching problem, where n agents have preferences over n items, and these preferences are induced by underlying cardinal valuation functions. The goal is to match every agent to a single item so as to maximize the…

Computer Science and Game Theory · Computer Science 2020-09-15 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros A. Voudouris

The notion of distortion in social choice problems has been defined to measure the loss in efficiency -- typically measured by the utilitarian social welfare, the sum of utilities of the participating agents -- due to having access only to…

Computer Science and Game Theory · Computer Science 2021-03-02 Elliot Anshelevich , Aris Filos-Ratsikas , Nisarg Shah , Alexandros A. Voudouris

We study the problem of designing voting rules that take as input the ordinal preferences of $n$ agents over a set of $m$ alternatives and output a single alternative, aiming to optimize the overall happiness of the agents. The input to the…

Computer Science and Game Theory · Computer Science 2023-06-01 Vasilis Gkatzelis , Mohamad Latifian , Nisarg Shah

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…

Computer Science and Game Theory · Computer Science 2023-12-11 Yannai A. Gonczarowski , Gregory Kehne , Ariel D. Procaccia , Ben Schiffer , Shirley Zhang

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…

Computer Science and Game Theory · Computer Science 2021-04-16 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros A. Voudouris

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…

Computer Science and Game Theory · Computer Science 2021-07-13 Elliot Anshelevich , Aris Filos-Ratsikas , Alexandros A. Voudouris

We develop new voting mechanisms for the case when voters and candidates are located in an arbitrary unknown metric space, and the goal is to choose a candidate minimizing social cost: the total distance from the voters to this candidate.…

Artificial Intelligence · Computer Science 2019-06-26 Ben Abramowitz , Elliot Anshelevich , Wennan Zhu

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

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…

Artificial Intelligence · Computer Science 2016-09-27 Elliot Anshelevich , John Postl

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…

Computer Science and Game Theory · Computer Science 2021-01-15 Ashish Goel , Anilesh Kollagunta Krishnaswamy , Kamesh Munagala

We consider a voting problem in which a set of agents have metric preferences over a set of alternatives, and are also partitioned into disjoint groups. Given information about the preferences of the agents and their groups, our goal is to…

Computer Science and Game Theory · Computer Science 2024-04-23 Georgios Amanatidis , Elliot Anshelevich , Christopher Jerrett , Alexandros A. Voudouris

Social choice has become a foundational component of modern machine learning systems. From auctions and resource allocation to the alignment of large generative models, machine learning pipelines increasingly aggregate heterogeneous…

Artificial Intelligence · Computer Science 2026-02-24 Zhiyu An , Wan Du

We study the distortion of one-sided and two-sided matching problems on the line. In the one-sided case, $n$ agents need to be matched to $n$ items, and each agent's cost in a matching is their distance from the item they were matched to.…

Computer Science and Game Theory · Computer Science 2025-02-04 Aris Filos-Ratsikas , Vasilis Gkatzelis , Mohamad Latifian , Emma Rewinski , 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…

Computer Science and Game Theory · Computer Science 2020-04-29 Brandon Fain , William Fan , Kamesh Munagala

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…

Computer Science and Game Theory · Computer Science 2021-11-18 Haripriya Pulyassary , Chaitanya Swamy

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

Selecting representatives based on voters' preferences is a fundamental problem in social choice theory. While cardinal utility functions offer a detailed representation of preferences, ordinal rankings are often the only available…

Computer Science and Game Theory · Computer Science 2024-12-17 Kiarash Banihashem , Diptarka Chakraborty , Shayan Chashm Jahan , Iman Gholami , MohammadTaghi Hajiaghayi , Mohammad Mahdavi , Max Springer
‹ Prev 1 2 3 10 Next ›