Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userKnapsack Voting for Participatory Budgeting
187
0
0.0
(
0
)
Added by
Anilesh Kollagunta Krishnaswamy
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We address the question of aggregating the preferences of voters in the context of participatory budgeting. We scrutinize the voting method currently used in practice, underline its drawbacks, and introduce a novel scheme tailored to this setting, which we call Knapsack Voting. We study its strategic properties - we show that it is strategy-proof under a natural model of utility (a dis-utility given by the $ell_1$ distance between the outcome and the true preference of the voter), and partially strategy-proof under general additive utilities. We extend Knapsack Voting to more general settings with revenues, deficits or surpluses, and prove a similar strategy-proofness result. To further demonstrate the applicability of our scheme, we discuss its implementation on the digital voting platform that we have deployed in partnership with the local government bodies in many cities across the nation. From voting data thus collected, we present empirical evidence that Knapsack Voting works well in practice.
rate research
Read More
In participatory budgeting, communities collectively decide on the allocation of public tax dollars for local public projects. In this work, we consider the question of fairly aggregating the preferences of community members to determine an allocation of funds to projects. This problem is different from standard fair resource allocation because of public goods: The allocated goods benefit all users simultaneously. Fairness is crucial in participatory decision making, since generating equitable outcomes is an important goal of these processes. We argue that the classic game theoretic notion of core captures fairness in the setting. To compute the core, we first develop a novel characterization of a public goods market equilibrium called the Lindahl equilibrium, which is always a core solution. We then provide the first (to our knowledge) polynomial time algorithm for computing such an equilibrium for a broad set of utility functions; our algorithm also generalizes (in a non-trivial way) the well-known concept of proportional fairness. We use our theoretical insights to perform experiments on real participatory budgeting voting data. We empirically show that the core can be efficiently computed for utility functions that naturally model our practical setting, and examine the relation of the core with the familiar welfare objective. Finally, we address concerns of incentives and mechanism design by developing a randomized approximately dominant-strategy truthful mechanism building on the exponential mechanism from differential privacy.
Participatory budgeting is a democratic process for allocating funds to projects based on the votes of members of the community. However, most input methods of voters preferences prevent the voters from expressing complex relationships among projects, leading to outcomes that do not reflect their preferences well enough. In this paper, we propose an input method that begins to address this challenge, by allowing participants to express substitutes over projects. Then, we extend a known aggregation mechanism from the literature (Rule X) to handle substitute projects. We prove that our extended rule preserves proportionality under natural conditions, and show empirically that it obtains substantially more welfare than the original mechanism on instances with substitutes.
Participatory budgeting (PB) is a democratic process where citizens jointly decide on how to allocate public funds to indivisible projects. This paper focuses on PB processes where citizens may give additional money to projects they want to see funded. We introduce a formal framework for this kind of PB with donations. Our framework also allows for diversity constraints, meaning that each project belongs to one or more types, and there are lower and upper bounds on the number of projects of the same type that can be funded. We propose three general classes of methods for aggregating the citizens preferences in the presence of donations and analyze their axiomatic properties. Furthermore, we investigate the computational complexity of determining the outcome of a PB process with donations and of finding a citizens optimal donation strategy.
We analyse strategic, complete information, sequential voting with ordinal preferences over the alternatives. We consider several voting mechanisms: plurality voting and approval voting with deterministic or uniform tie-breaking rules. We show that strategic voting in these voting procedures may lead to a very undesirable outcome: Condorcet winning alternative might be rejected, Condorcet losing alternative might be elected, and Pareto dominated alternative might be elected. These undesirable phenomena occur already with four alternatives and a small number of voters. For the case of three alternatives we present positive and negative results.
Agents (specially humans) with smart devices are stemming with astounding rapidity and that may play a big role in information and communication technology apart from being used only as a mere calling devices. Inculcating the power of smart devices carried by the agents in several different applications is commonly termed as participatory sensing (PS). In this paper, for the first time a truthful quality adaptive participatory sensing is presented in an online double auction environment. The proposed algorithm is simulated with a benchmark mechanism that adapts the existing McAfees Double Auction (MDA) directly in the online environment.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
