English
Related papers

Related papers: On beta-Plurality Points in Spatial Voting Games

200 papers

For a given real number $\alpha$, let us place the fractional parts of the points $0, \alpha, 2 \alpha,$ $ \cdots, (N-1) \alpha$ on the unit circle. These points partition the unit circle into intervals having at most three lengths, one…

Number Theory · Mathematics 2018-06-08 Valérie Berthé , Dong Han Kim

Preference elicitation is a central problem in AI, and has received significant attention in single-agent settings. It is also a key problem in multiagent systems, but has received little attention here so far. In this setting, the agents…

Computer Science and Game Theory · Computer Science 2007-05-23 Vincent Conitzer , Tuomas Sandholm

Our main contribution is the introduction of the map of elections framework. A map of elections consists of three main elements: (1) a dataset of elections (i.e., collections of ordinal votes over given sets of candidates), (2) a way of…

Multiagent Systems · Computer Science 2024-07-17 Stanisław Szufa

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

A simple game $(N,v)$ is given by a set $N$ of $n$ players and a partition of~$2^N$ into a set~$\mathcal{L}$ of losing coalitions~$L$ with value $v(L)=0$ that is closed under taking subsets and a set $\mathcal{W}$ of winning coalitions $W$…

Computer Science and Game Theory · Computer Science 2020-04-08 Frits Hof , Walter Kern , Sascha Kurz , Kanstantsin Pashkovich , Daniël Paulusma

Given a training set $P \subset \mathbb{R}^d$, the nearest-neighbor classifier assigns any query point $q \in \mathbb{R}^d$ to the class of its closest point in $P$. To answer these classification queries, some training points are more…

Computational Geometry · Computer Science 2022-03-08 Alejandro Flores-Velazco

In approval-based multiwinner voting, voters express approval preferences over a set of candidates, and the goal is to return a winning committee. This model captures a broad range of subset selection problems under preferences. Prior work…

Computer Science and Game Theory · Computer Science 2026-04-28 Niclas Boehmer , Luca Kreisel , Jannik Peters

In the framework of the three-party constrained voter model, where voters of two radical parties (A and B) interact with "centrists" (C and Cz), we study the competition between a persuasive majority and a committed minority. In this model,…

Statistical Mechanics · Physics 2013-04-02 Mauro Mobilia

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…

Computer Science and Game Theory · Computer Science 2024-01-23 Soroush Ebadian , Anson Kahng , Dominik Peters , Nisarg Shah

An important question in elections is the determine whether a candidate can be a winner when some votes are absent. We study this determining winner with the absent votes (WAV) problem when the votes are top-truncated. We show that the WAV…

Computer Science and Game Theory · Computer Science 2023-10-12 Qishen Han , Amélie Marian , Lirong Xia

The 1-center clustering with outliers problem asks about identifying a prototypical robust statistic that approximates the location of a cluster of points. Given some constant $0 < \alpha < 1$ and $n$ points such that $\alpha n$ of them are…

Data Structures and Algorithms · Computer Science 2018-09-28 Shyam Narayanan

Voting is a simple mechanism to aggregate the preferences of agents. Many voting rules have been shown to be NP-hard to manipulate. However, a number of recent theoretical results suggest that this complexity may only be in the worst-case…

Artificial Intelligence · Computer Science 2009-05-25 Toby Walsh

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

Let $B$ be a set of $n$ axis-parallel boxes in $\mathbb{R}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of $\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of…

Computational Geometry · Computer Science 2018-03-05 Karl Bringmann , Sergio Cabello , Michael T. M. Emmerich

Each voter $i \in I$ has $\alpha_i$ cards that (s)he distributes among the candidates $a \in A$ as a measure of approval. One (or several) candidate(s) who received the maximum number of cards is (are) elected. We provide polynomial…

Combinatorics · Mathematics 2020-10-30 Endre Boros , Ondrej Cepek , Vladimir Gurvich , Kazuhisa Makino

The traditional election control problem focuses on the use of control to promote a single candidate. In parliamentary elections, however, the focus shifts: voters care no less about the overall governing coalition than the individual…

Computer Science and Game Theory · Computer Science 2025-03-07 Hodaya Barr , Eden Hartman , Yonatan Aumann , Sarit Kraus

We consider the approximability of center-based clustering problems where the points to be clustered lie in a metric space, and no candidate centers are specified. We call such problems "continuous", to distinguish from "discrete"…

Data Structures and Algorithms · Computer Science 2022-09-05 Deeparnab Chakrabarty , Maryam Negahbani , Ankita Sarkar

We study the $O_\beta$-hull of a planar point set, a generalization of the Orthogonal Convex Hull where the coordinate axes form an angle $\beta$. Given a set $P$ of $n$ points in the plane, we show how to maintain the $O_\beta$-hull of $P$…

Computational Geometry · Computer Science 2018-11-19 Carlos Alegría-Galicia , David Orden , Carlos Seara , Jorge Urrutia

The q-voter model is a spin-flip system in which the rate of flipping to type i is given by the qth power of the proportion of nearest neighbours in type i for $i=0,1$. If $q=1$ it reduces to the classical voter model. We show that in the…

Probability · Mathematics 2023-11-27 Ted Cox , Ed Perkins

We show that a necessary condition for eligibility of a candidate by the set of de Borda's voting rules in [H. Moulin (1988), Axioms of cooperative decision making] is not sufficient and we obtain a version of the criterion. Let $r(a_i)$ be…

Optimization and Control · Mathematics 2007-05-23 V. Yu. Kiselev
‹ Prev 1 8 9 10 Next ›