English
Related papers

Related papers: Structured Voting for Structured Committees

200 papers

Determining the power distribution of the members of a shareholder meeting or a legislative committee is a well-known problem for many applications. In some cases it turns out that power is nearly proportional to relative voting weights,…

Computer Science and Game Theory · Computer Science 2018-08-09 Sascha Kurz

In many situations, the decision maker observes items in sequence and needs to determine whether or not to retain a particular item immediately after it is observed. Any decision rule creates a set of items that are selected. We consider…

Probability · Mathematics 2007-05-23 Abba M. Krieger , Moshe Pollak , Ester Samuel-Cahn

Justified representation (JR) is a standard notion of representation in multiwinner approval voting. Not only does a JR committee always exist, but previous work has also shown through experiments that the JR condition can typically be…

Computer Science and Game Theory · Computer Science 2023-06-29 Edith Elkind , Piotr Faliszewski , Ayumi Igarashi , Pasin Manurangsi , Ulrike Schmidt-Kraepelin , Warut Suksompong

Voting methods are instrumental design elements of democracies. Citizens use them to express and aggregate their preferences to reach a collective decision. However, voting outcomes can be as sensitive to voting rules as they are to…

Many neural nets appear to represent data as linear combinations of "feature vectors." Algorithms for discovering these vectors have seen impressive recent success. However, we argue that this success is incomplete without an understanding…

Artificial Intelligence · Computer Science 2024-07-23 Martin Wattenberg , Fernanda B. Viégas

Many machine learning algorithms represent input data with vector embeddings or discrete codes. When inputs exhibit compositional structure (e.g. objects built from parts or procedures from subroutines), it is natural to ask whether this…

Machine Learning · Computer Science 2019-04-09 Jacob Andreas

We identify a whole family of approval-based multi-winner voting rules that satisfy PJR. Moreover, we identify a subfamily of voting rules within this family that satisfy EJR. All these voting rules can be computed in polynomial time as…

Computer Science and Game Theory · Computer Science 2017-04-19 Luis Sánchez-Fernández , Edith Elkind , Martin Lackner

A method is given for quantitatively rating the social acceptance of different options which are the matter of a preferential vote. In contrast to a previous article, here the individual votes are allowed to be incomplete, that is, they…

Optimization and Control · Mathematics 2012-03-09 Rosa Camps , Xavier Mora , Laia Saumell

The paper considers the problem of finding the number of dominant voters in two-level voting procedures. At the first stage, voting is conducted among local groups of voters, and at the second stage, the results are aggregated to form a…

Discrete Mathematics · Computer Science 2025-06-11 N. I. Shushko , D. V. Lemtyuzhnikova

Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alternatives. It has been suggested to let agents submit partial…

Computer Science and Game Theory · Computer Science 2014-01-17 Lirong Xia , Vincent Conitzer

The ability to measure the satisfaction of (groups of) voters is a crucial prerequisite for formulating proportionality axioms in approval-based participatory budgeting elections. Two common - but very different - ways to measure the…

Computer Science and Game Theory · Computer Science 2023-10-19 Markus Brill , Stefan Forster , Martin Lackner , Jan Maly , Jannik Peters

Visual Place Recognition has recently seen a surge of endeavours utilizing different ensemble approaches to improve VPR performance. Ideas like multi-process fusion or switching involve combining different VPR techniques together, utilizing…

Computer Vision and Pattern Recognition · Computer Science 2023-05-11 Maria Waheed , Michael Milford , Xiaojun Zhai , Klaus McDonald-Maier , Shoaib Ehsan

In a signed graph, each link is labeled with either a positive or a negative sign. This is particularly appropriate to model polarized systems. Such a graph can be characterized through the notion of structural balance, which relies on the…

Social and Information Networks · Computer Science 2019-05-01 Nejat Arinik , Rosa Figueiredo , Vincent Labatut

We characterize the class of committee scoring rules that satisfy the fixed-majority criterion. In some sense, the committee scoring rules in this class are multiwinner analogues of the single-winner Plurality rule, which is uniquely…

Computer Science and Game Theory · Computer Science 2016-03-01 Piotr Faliszewski , Piotr Skowron , Arkadii Slinko , Nimrod Talmon

We design two mechanisms that ensure that the majority preferred option wins in all equilibria. The first one is a simultaneous game where agents choose other agents to cooperate with on top of the vote for an alternative, thus overcoming…

Theoretical Economics · Economics 2023-10-12 Kirneva Margarita , Núñez Matías

Proponents of participatory democracy praise Liquid Democracy: decisions are taken by referendum, but voters delegate their votes freely. When better informed voters are present, delegation can increase the probability of a correct…

General Economics · Economics 2024-04-24 Victoria Mooers , Joseph Campbell , Alessandra Casella , Lucas de Lara , Dilip Ravindran

In this extended abstract, we propose Structured Production Systems (SPS), which extend traditional production systems with well-formed syntactic structures. Due to the richness of structures, structured production systems significantly…

Artificial Intelligence · Computer Science 2017-04-27 Yi Zhou

Recommender systems are typically designed to fulfill end user needs. However, in some domains the users are not the only stakeholders in the system. For instance, in a news aggregator website users, authors, magazines as well as the…

Information Retrieval · Computer Science 2021-02-10 Alireza Gharahighehi , Celine Vens , Konstantinos Pliakos

We study the following multiagent variant of the knapsack problem. We are given a set of items, a set of voters, and a value of the budget; each item is endowed with a cost and each voter assigns to each item a certain value. The goal is to…

Computer Science and Game Theory · Computer Science 2018-11-14 Till Fluschnik , Piotr Skowron , Mervin Triphaus , Kai Wilker

We study the parameterized control complexity of fallback voting, a voting system that combines preference-based with approval voting. Electoral control is one of many different ways for an external agent to tamper with the outcome of an…

Computational Complexity · Computer Science 2010-04-22 Gábor Erdélyi , Michael Fellows
‹ Prev 1 8 9 10 Next ›