English
Related papers

Related papers: Knapsack Voting for Participatory Budgeting

200 papers

Budgetary constraints force organizations to pursue only a subset of possible innovation projects. Identifying which subset is most promising is an error-prone exercise, and involving multiple decision makers may be prudent. This raises the…

Theoretical Economics · Economics 2025-10-21 Lucas Böttcher , Ronald Klingebiel

We consider a setting with agents that have preferences over alternatives and are partitioned into disjoint districts. The goal is to choose one alternative as the winner using a mechanism which first decides a representative alternative…

Computer Science and Game Theory · Computer Science 2023-01-10 Aris Filos-Ratsikas , Alexandros A. Voudouris

Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the…

Computer Science and Game Theory · Computer Science 2012-07-09 Vincent Conitzer , Tuomas Sandholm

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

As connected and autonomous driving technologies advance, vehicles increasingly rely on data from external sensors. Although this information can enhance state estimation, processing all available streams imposes significant communication…

Systems and Control · Electrical Eng. & Systems 2026-05-19 Jehyeop Han , Minhee Kang , Alessandro Colombo , Marcello Farina , Heejin Ahn

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

The need of totally secure online auction has led to the invention of many auction protocols. But as new attacks are developed, auction protocols also require corresponding strengthening. We analyze the auction protocol based on the…

Cryptography and Security · Computer Science 2014-05-02 Navya Chodisetti

We introduce an end-to-end model of participatory budgeting grounded in social choice theory. This model accounts for both the first stage, in which participants propose projects to be shortlisted, and the second stage, in which they vote…

Computer Science and Game Theory · Computer Science 2023-09-07 Simon Rey , Ulle Endriss , Ronald de Haan

We design mechanisms for maintaining public goods which require periodic in-kind contributions, motivated by incentives problems facing crowd-sourced recommender systems. Utilitarian welfare is maximized by redistributive policies which are…

Theoretical Economics · Economics 2025-02-04 Erik Madsen , Eran Shmaya

E-voting systems (EVS)are having potential advantages over many existing voting schemes.Security, transparency, accuracy and reliability are the major concern in these systems.EVS continues to grow as the technology advances.It is…

Cryptography and Security · Computer Science 2015-02-27 Divya G. Nair , V. P. Binu , G. Santhosh Kumar

Recommendation systems are pervasive in the digital economy. An important assumption in many deployed systems is that user consumption reflects user preferences in a static sense: users consume the content they like with no other…

Computers and Society · Computer Science 2023-02-14 Andreas Haupt , Dylan Hadfield-Menell , Chara Podimata

We revisit the Stochastic Knapsack problem, where a policy-maker chooses an execution order for jobs with fixed values and stochastic running-times, aiming to maximize the value completed by a deadline. Dean et al. (FOCS'04) show that…

Computer Science and Game Theory · Computer Science 2026-02-18 Zohar Barak , Asnat Berlin , Ilan Reuven Cohen , Alon Eden , Omri Porat , Inbal Talgam-Cohen

In this paper we address the problem of electing a committee among a set of $m$ candidates and on the basis of the preferences of a set of $n$ voters. We consider the approval voting method in which each voter can approve as many candidates…

Optimization and Control · Mathematics 2017-07-31 Diego Ponce , Justo Puerto , Federica Ricca , Andrea Scozzari

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

We study multiwinner elections with approval-based preferences. An instance of a multiwinner election consists of a set of alternatives, a population of voters---each voter approves a subset of alternatives, and the desired committee size…

Computer Science and Game Theory · Computer Science 2019-10-15 Piotr Skowron

In the past, the Voter Model has been explicitly used to model the impact of propaganda on a dynamic, interconnected population, and certain factors have been identified that influence the behavior of voters when under outside influence.…

Physics and Society · Physics 2025-10-14 Renee Jerome

The wisdom of the crowd has long become the de facto approach for eliciting information from individuals or experts in order to predict the ground truth. However, classical democratic approaches for aggregating individual \emph{votes} only…

Computer Science and Game Theory · Computer Science 2021-05-21 Hadi Hosseini , Debmalya Mandal , Nisarg Shah , Kevin Shi

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

In the knapsack problem under explorable uncertainty, we are given a knapsack instance with uncertain item profits. Instead of having access to the precise profits, we are only given uncertainty intervals that are guaranteed to contain the…

Data Structures and Algorithms · Computer Science 2025-07-04 Jens Schlöter

Crowdsourcing provides a popular paradigm for data collection at scale. We study the problem of selecting subsets of workers from a given worker pool to maximize the accuracy under a budget constraint. One natural question is whether we…

Machine Learning · Statistics 2015-02-04 Hongwei Li , Qiang Liu
‹ Prev 1 8 9 10 Next ›