English
Related papers

Related papers: Diverse Representation via Computational Participa…

200 papers

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

The proposed election system lies in ensuring that it is transparent and impartial.Thus while the electoral system may vary from country to country, It has to take into account the peculiarities of every society while at the same time…

Computers and Society · Computer Science 2007-05-23 Muhammad Nadeem , Javaid R. Laghari

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

In economic theory, an agent chooses from available alternatives -- modeled as a set. In decisions in the field or in the lab, however, agents do not have access to the set of alternatives at once. Instead, alternatives are represented by…

Computer Science and Game Theory · Computer Science 2021-11-09 Paulo Oliva , Philipp Zahn

Concerns about representation in computing within the U.S. have driven numerous activities to broaden participation. Assessment of the impact of these efforts and, indeed, a clear assessment of the actual "problem" being addressed are…

Computers and Society · Computer Science 2024-03-25 Valerie Barr , Carla E. Brodley , Manuel A. Pérez-Quiñones

Candidate control of elections is the study of how adding or removing candidates can affect the outcome. However, the traditional study of the complexity of candidate control is in the model in which all candidates and votes are known up…

Computer Science and Game Theory · Computer Science 2016-06-20 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

Population protocols are a model of distributed computing where $n$ agents, each a simple finite-state machine, interact in pairs to solve a common task against a (adversarial) interaction scheduler. This model was intensively studied in…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-19 Tom-Lukas Breitkopf , Julien Dallot , Antoine El-Hayek , Stefan Schmid

We introduce a single-winner perspective on voting on matchings, in which voters have preferences over possible matchings in a graph, and the goal is to select a single collectively desirable matching. Unlike in classical matching problems,…

Computer Science and Game Theory · Computer Science 2026-01-28 Niclas Boehmer , Jessica Dierking

Fairness in multiwinner elections is studied in varying contexts. For instance, diversity of candidates and representation of voters are both separately termed as being fair. A common denominator to ensure fairness across all such contexts…

Computer Science and Game Theory · Computer Science 2022-11-24 Kunal Relia

The goal of group formation is to build a team to accomplish a specific task. Algorithms are employed to improve the effectiveness of the team so formed and the efficiency of the group selection process. However, there is concern that team…

Information Retrieval · Computer Science 2020-12-04 Mohammed Alqahtani , Susan Gauch , Omar Salman , Mohammed Ibrahim , Reem Al-Saffar

Shortlisting is the process of selecting a subset of alternatives from a larger pool for further consideration or final decision-making. It is widely applied in social choice and multi-agent system scenarios. The growing demand for…

Computer Science and Game Theory · Computer Science 2026-01-30 Edith Elkind , Qishen Han , Lirong Xia

In the computational social choice literature, there has been great interest in understanding how computational complexity can act as a barrier against manipulation of elections. Much of this literature, however, makes the assumption that…

Computer Science and Game Theory · Computer Science 2015-07-27 Vijay Menon , Kate Larson

Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating together preferences of multiple agents. We study here the…

Artificial Intelligence · Computer Science 2012-04-18 Toby Walsh

Classical results in voting theory show that strategic manipulation by voters is inevitable if a voting rule simultaneously satisfy certain desirable properties. Motivated by this, we study the relevant question of how often a voting rule…

Computer Science and Game Theory · Computer Science 2015-02-17 Palash Dey , Y. Narahari

We consider a voting model, where a number of candidates need to be selected subject to certain feasibility constraints. The model generalises committee elections (where there is a single constraint on the number of candidates that need to…

Computer Science and Game Theory · Computer Science 2025-09-24 Tomáš Masařík , Grzegorz Pierczyński , Piotr Skowron

Election data represent a precious source of information to study human behavior at a large scale. In proportional elections with open lists, the number of votes received by a candidate, rescaled by the average performance of all…

Physics and Society · Physics 2013-01-25 Arnab Chatterjee , Marija Mitrović , Santo Fortunato

The idea of representation has been used in various fields of study from data analysis to political science. In this paper, we define representativeness and describe a method to isolate data points that can represent the entire data set.…

Information Retrieval · Computer Science 2016-10-20 Ashwinkumar Ganesan , Tim Oates , Matt Schmill

There has been much recent work on multiwinner voting systems. However, sometimes a committee is highly structured, and if we want to vote for such a committee, our voting method should be more structured as well. We consider committees…

Computer Science and Game Theory · Computer Science 2022-11-14 Karl-Dieter Crisman

Liquid democracy is the principle of making collective decisions by letting agents transitively delegate their votes. Despite its significant appeal, it has become apparent that a weakness of liquid democracy is that a small subset of…

Computer Science and Game Theory · Computer Science 2019-11-20 Paul Gölz , Anson Kahng , Simon Mackenzie , Ariel D. Procaccia

Despite extensive theoretical research on proportionality in approval-based multiwinner voting, its impact on which committees and candidates can be selected in practice remains poorly understood. We address this gap by (i) analyzing the…

Computer Science and Game Theory · Computer Science 2025-11-13 Niclas Boehmer , Lara Glessen , Jannik Peters