English
Related papers

Related papers: Representative Proxy Voting

200 papers

The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a winner. In this work, we consider the computational…

Computer Science and Game Theory · Computer Science 2018-02-27 Batya Kenig

Metric distortion in social choice is a framework for evaluating how well voting rules minimize social cost when both voters and candidates exist in a shared metric space, with a voter's cost defined by their distance to a candidate. Voters…

Computer Science and Game Theory · Computer Science 2025-02-14 Mohak Goyal , Sahasrajit Sarmasarkar

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

Eliciting the preferences of a set of agents over a set of alternatives is a problem of fundamental importance in social choice theory. Prior work on this problem has studied the query complexity of preference elicitation for the…

Computer Science and Game Theory · Computer Science 2016-04-19 Palash Dey , Neeldhara Misra

The paper introduces an extension of the proposal according to which conceptual representations in cognitive agents should be intended as heterogeneous proxytypes. The main contribution of this paper is in that it details how to reconcile,…

Artificial Intelligence · Computer Science 2019-09-05 Antonio Lieto

We consider a model where a subset of candidates must be selected based on voter preferences, subject to general constraints that specify which subsets are feasible. This model generalizes committee elections with diversity constraints,…

Computer Science and Game Theory · Computer Science 2026-02-10 Piotr Skowron

We consider a two-round election model involving $m$ voters and $n$ candidates. Each voter is endowed with a strict preference list ranking the candidates. In the first round, the candidates are partitioned into two subsets, $A$ and $B$,…

Computer Science and Game Theory · Computer Science 2026-03-17 Emilio De Santis , Antonio Di Crescenzo , Verdiana Mustaro

The goal of this paper is twofold. First and foremost, we aim to experimentally and quantitatively show that the choice of a multiwinner voting rule can play a crucial role on the way minorities are represented. We also test the possibility…

Computer Science and Game Theory · Computer Science 2016-04-11 Piotr Faliszewski , Jean-Francois Laslier , Robert Schaefer , Piotr Skowron , Arkadii Slinko , Nimrod Talmon

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

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

In elections, the vote shares or turnout rates show a strong spatial correlation. The logarithmic decay with distance suggests that a 2D noisy diffusive equation describes the system. Based on the study of U.S. presidential elections data,…

Physics and Society · Physics 2019-05-29 Shintaro Mori , Masato Hisakado , Kazuaki Nakayama

In the celebrated stable-matching problem, there are two sets of agents M and W, and the members of M only have preferences over the members of W and vice versa. It is usually assumed that each member of M and W is a single entity. However,…

Computer Science and Game Theory · Computer Science 2024-08-21 Leora Schmerler , Noam Hazon , Sarit Kraus

A proxy, in general, is an object mediating access to an arbitrary target object. The proxy is then intended to be used in place of the target object. Ideally, a proxy is not distinguishable from other objects. Running a program with a…

Programming Languages · Computer Science 2013-12-20 Matthias Keil , Peter Thiemann

Perpetual voting was recently introduced as a framework for long-term collective decision making. In this framework, we consider a sequence of subsequent approval-based elections and try to achieve a fair overall outcome. To achieve…

Computer Science and Game Theory · Computer Science 2021-05-03 Martin Lackner , Jan Maly

When each voter rates or ranks several candidates for a single office, a strong Condorcet winner (SCW) is one who beats all others in two-way races. Among 21 electoral systems examined, 18 will sometimes make candidate X the winner even if…

Methodology · Statistics 2016-09-22 Richard B. Darlington

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

There is a class of models for pol/mil/econ bargaining and conflict that is loosely based on the Median Voter Theorem which has been used with great success for about 30 years. However, there are fundamental mathematical limitations to…

Computer Science and Game Theory · Computer Science 2015-05-12 Ben Wise , Steven Bankes

Multi-winner voting is the process of selecting a fixed-size set of representative candidates based on voters' preferences. It occurs in applications ranging from politics (parliamentary elections) to the design of modern computer…

Computer Science and Game Theory · Computer Science 2022-11-22 Martin Lackner , Piotr Skowron

Liquid democracy is a form of transitive delegative democracy that has received a flurry of scholarly attention from the computer science community in recent years. In its simplest form, every agent starts with one vote and may have other…

Multiagent Systems · Computer Science 2022-06-14 Brian Brubach , Audrey Ballarin , Heeba Nazeer

In many randomized experiments, the treatment effect of the long-term metric (i.e. the primary outcome of interest) is often difficult or infeasible to measure. Such long-term metrics are often slow to react to changes and sufficiently…

‹ Prev 1 3 4 5 6 7 10 Next ›