English
Related papers

Related papers: Online Temporal Voting: Strategyproofness, Proport…

200 papers

We study proportional representation in the temporal voting model, where collective decisions are made repeatedly over time over a fixed horizon. Prior work has extensively investigated how proportional representation axioms from…

Computer Science and Game Theory · Computer Science 2026-05-13 Nicholas Teh

We study the problem of fair sequential decision making given voter preferences. In each round, a decision rule must choose a decision from a set of alternatives where each voter reports which of these alternatives they approve. Instead of…

Computer Science and Game Theory · Computer Science 2025-03-18 Nikhil Chandak , Shashwat Goel , Dominik Peters

We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of…

Computer Science and Game Theory · Computer Science 2025-02-11 Edith Elkind , Svetlana Obraztsova , Jannik Peters , Nicholas Teh

Traditionally, the problem of apportioning the seats of a legislative body has been viewed as a one-shot process with no dynamic considerations. While this approach is reasonable for some settings, dynamic aspects play an important role in…

Computer Science and Game Theory · Computer Science 2025-10-17 Javier Cembrano , Jose Correa , Svenja M. Griesbach , Victor Verdugo

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

This paper offers a framework for the study of strategic behavior in proxy voting, where non-active voters delegate their votes to active voters. We further study how proxy voting affects the strategic behavior of non-active voters and…

Computer Science and Game Theory · Computer Science 2023-05-19 Gili Bielous , Reshef Meir

We investigate a model of sequential decision-making where a single alternative is chosen at each round. We focus on two objectives -- utilitarian welfare (Util) and egalitarian welfare (Egal) -- and consider the computational complexity of…

Computer Science and Game Theory · Computer Science 2024-12-23 Edith Elkind , Tzeh Yuan Neoh , Nicholas Teh

We study proportional representation in the framework of temporal voting with approval ballots. Prior work adapted basic proportional representation concepts -- justified representation (JR), proportional JR (PJR), and extended JR (EJR) --…

Computer Science and Game Theory · Computer Science 2025-05-29 Bradley Phillips , Edith Elkind , Nicholas Teh , Tomasz Wąs

Signal Temporal Logic (STL) is a formalism used to rigorously specify requirements of cyberphysical systems (CPS), i.e., systems mixing digital or discrete components in interaction with a continuous environment or analog com- ponents. STL…

Systems and Control · Computer Science 2015-06-30 Jyotirmoy V. Deshmukh , Alexandre Donzé , Shromona Ghosh , Xiaoqing Jin , Garvit Juniwal , Sanjit A. Seshia

Proportional representation (PR) is a fundamental principle of many democracies world-wide which employ PR-based voting rules to elect their representatives. The normative properties of these voting rules however, are often only understood…

Computer Science and Game Theory · Computer Science 2018-01-30 Barton E. Lee

Proportional representation plays a crucial role in electoral systems. In ordinal elections, where voters rank candidates based on their preferences, the Single Transferable Vote (STV) is the most widely used proportional voting method. STV…

Computer Science and Game Theory · Computer Science 2025-05-02 Tuva Bardal , Markus Brill , David McCune , Jannik Peters

Participatory budgeting (PB) is a democratic paradigm whereby voters decide on a set of projects to fund with a limited budget. We consider PB in a setting where voters report ordinal preferences over projects and have (possibly) asymmetric…

Computer Science and Game Theory · Computer Science 2020-12-11 Haris Aziz , Barton E. Lee

It is well known that no reasonable voting rule is strategyproof. Moreover, the common Plurality rule is particularly prone to strategic behavior of the voters and empirical studies show that people often vote strategically in practice.…

Computer Science and Game Theory · Computer Science 2014-04-22 Reshef Meir , Omer Lev , Jeffrey S. Rosenschein

The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability that was proposed by…

Computer Science and Game Theory · Computer Science 2022-06-15 Haris Aziz , Alexander Lam

We study fully dynamic online selection problems in an adversarial/stochastic setting that includes Bayesian online selection, prophet inequalities, posted price mechanisms, and stochastic probing problems subject to combinatorial…

Artificial Intelligence · Computer Science 2023-01-10 Vashist Avadhanula , Andrea Celli , Riccardo Colini-Baldeschi , Stefano Leonardi , Matteo Russo

We study voting rules for participatory budgeting, where a group of voters collectively decides which projects should be funded using a common budget. We allow the projects to have arbitrary costs, and the voters to have arbitrary additive…

Computer Science and Game Theory · Computer Science 2022-10-18 Dominik Peters , Grzegorz Pierczyński , Piotr Skowron

Obviously strategyproof (OSP) mechanisms maintain the incentive compatibility of agents that are not fully rational. They have been object of a number of studies since their recent definition. A research agenda, initiated in…

Computer Science and Game Theory · Computer Science 2018-04-30 Diodato Ferraioli , Carmine Ventre

Voting rules may implement the will of the society when all eligible voters vote, and only them. However, they may fail to do so when sybil (fake or duplicate) votes are present and when only some honest (non sybil) voters actively…

Multiagent Systems · Computer Science 2025-10-22 Reshef Meir , Gal Shahaf , Ehud Shapiro , Nimrod Talmon

The property of proportional representation in approval-based committee elections has appeared in the social choice literature for over a century, and is typically understood as avoiding the underrepresentation of minorities. However, we…

Data Structures and Algorithms · Computer Science 2021-09-14 Alfonso Cevallos , Alistair Stewart

The Independence of Clones (IoC) criterion measures a voting rule's robustness to strategic nomination. Prior literature has established empirically that individuals may still submit costly, distortionary misreports even in strategy-proof…

Computer Science and Game Theory · Computer Science 2025-02-25 Ratip Emin Berker , Sílvia Casacuberta , Christopher Ong , Isaac Robinson
‹ Prev 1 2 3 10 Next ›