English
Related papers

Related papers: Approximately Fair and Population Consistent Budge…

200 papers

In recent years, research in Participatory Budgeting (PB) has put a greater emphasis on rules satisfying notions of fairness and proportionality, with the Method of Equal Shares (MES) being a prominent example. However, proportionality can…

Computer Science and Game Theory · Computer Science 2025-11-27 Anton Baychkov , Markus Brill , Jannik Peters

In Hotelling's model of spatial competition, a unit mass of voters is distributed in the interval $[0,1]$ (with their location corresponding to their political persuasion), and each of $m$ candidates selects as a strategy his distinct…

Computer Science and Game Theory · Computer Science 2024-05-09 Umang Bhaskar , Soumyajit Pyne

We study several fairness notions in allocating indivisible chores (i.e., items with non-positive values) to agents who have additive and submodular cost functions. The fairness criteria we are concern with are envy-free up to any item…

Computer Science and Game Theory · Computer Science 2021-09-29 Ankang Sun , Bo Chen , Xuan Vinh Doan

Participatory budgeting (PB) is a democratic process for allocating funds to projects based on the votes of community members. PB outcomes are commonly evaluated for how they reflect voters preferences (e.g., social welfare) and the extent…

Computer Science and Game Theory · Computer Science 2024-12-03 Roy Fairstein , Reshef Meir , Kobi Gal

The paper is devoted to the approximate consensus problem for networks of nonlinear agents with switching topology, noisy and delayed measurements. In contrast to the existing stochastic approximation-based control algorithms (protocols), a…

Systems and Control · Computer Science 2013-06-17 Natalia Amelina , Alexander Fradkov , Yuming Jiang , Dimitrios J. Vergados

Fairness in multiwinner elections, a growing line of research in computational social choice, primarily concerns the use of constraints to ensure fairness. Recent work proposed a model to find a diverse \emph{and} representative committee…

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

We initiate the work on maximin share (MMS) fair allocation of m indivisible chores to n agents using only their ordinal preferences, from both algorithmic and mechanism design perspectives. The previous best-known approximation is 2-1/n by…

Computer Science and Game Theory · Computer Science 2020-12-29 Haris Aziz , Bo Li , Xiaowei Wu

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

Budget feasible mechanism considers algorithmic mechanism design questions where there is a budget constraint on the total payment of the mechanism. An important question in the field is that under which valuation domains there exist budget…

Computer Science and Game Theory · Computer Science 2012-03-23 Xiaohui Bei , Ning Chen , Nick Gravin , Pinyan Lu

Participatory budgeting (PB) has attracted much attention in recent times due to its wide applicability in social choice settings. In this paper, we consider indivisible PB which involves allocating an available, limited budget to a set of…

Computer Science and Game Theory · Computer Science 2022-07-19 Gogulapati Sreedurga , Yadati Narahari

We study the problem of fairly allocating a set of m indivisible chores (items with non-positive value) to n agents. We consider the desirable fairness notion of 1-out-of-d maximin share (MMS) -- the minimum value that an agent can…

Computer Science and Game Theory · Computer Science 2022-01-20 Hadi Hosseini , Andrew Searns , Erel Segal-Halevi

We consider the problem of allocating indivisible goods fairly among n agents who have additive and submodular valuations for the goods. Our fairness guarantees are in terms of the maximin share, that is defined to be the maximum value that…

Computer Science and Game Theory · Computer Science 2020-04-07 Siddharth Barman , Sanath Kumar Krishnamurthy

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

We study fair distribution of a collection of m indivisible goods among a group of n agents, using the widely recognized fairness principles of Maximin Share (MMS) and Any Price Share (APS). These principles have undergone thorough…

Computer Science and Game Theory · Computer Science 2023-12-15 Chandra Chekuri , Pooja Kulkarni , Rucha Kulkarni , Ruta Mehta

The maximin share ($\textsf{MMS}$) is the most prominent share-based fairness notion in the fair allocation of indivisible goods. Recent years have seen significant efforts to improve the approximation guarantees for $\textsf{MMS}$ for…

Computer Science and Game Theory · Computer Science 2025-10-14 Ehsan Heidari , Alireza Kaviani , Masoud Seddighin , AmirMohammad Shahrezaei

Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. However, if candidates have sensitive attributes such as gender or ethnicity (when selecting…

Computers and Society · Computer Science 2018-06-20 L. Elisa Celis , Lingxiao Huang , Nisheeth K. Vishnoi

We consider allocations of a set of $m$ indivisible goods to $n$ agents of equal entitlements that have valuations from the class XOS. A previous sequence of works showed allocations that obtain an $\alpha$-approximation for the maximin…

Computer Science and Game Theory · Computer Science 2026-05-12 Uriel Feige , Vadim Grinberg

Participatory Budgeting (PB) is commonly studied from an axiomatic perspective, where the aim is to design procedurally fair and economically efficient rules for voters with full information regarding their preferences. In contrast, we take…

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

Using data from 35 Participatory Budgeting instances in Amsterdam, we empirically compare two different Participatory Budgeting rules: the greedy cost welfare rule and the Method of Equal Shares. We quantify how proportional, equal and fair…

Computer Science and Game Theory · Computer Science 2023-10-30 Pelle Nelissen

Perpetual voting was recently introduced as a framework for long-term collective decision making. In this framework, we consider a sequence of subsequent approval-based elections and try to achieve a fair overall outcome. To achieve…

Computer Science and Game Theory · Computer Science 2021-05-03 Martin Lackner , Jan Maly