Achievable hierarchies in voting games with abstention

It is well known that he influence relation orders the voters the same way as the classical Banzhaf and Shapley-Shubik indices do when they are extended to the voting games with abstention (VGA) in the class of complete games. Moreover, all hierarchies for the influence relation are achievable in the class of complete VGA. The aim of this paper is twofold. Firstly, we show that all hierarchies are achievable in a subclass of weighted VGA, the class of weighted games for which a single weight is assigned to voters. Secondly, we conduct a partial study of achievable hierarchies within the subclass of H-complete games, that is, complete games under stronger versions of influence relation. (C) 2013 Elsevier B.V. All rights reserved.Peer ReviewedPostprint (author’s final draft

The Core of the Participatory Budgeting Problem

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

Multiwinner Analogues of Plurality Rule: Axiomatic and Algorithmic Perspectives

We characterize the class of committee scoring rules that satisfy the fixed-majority criterion. In some sense, the committee scoring rules in this class are multiwinner analogues of the single-winner Plurality rule, which is uniquely characterized as the only single-winner scoring rule that satisfies the simple majority criterion. We define top-$k$-counting committee scoring rules and show that the fixed majority consistent rules are a subclass of the top-$k$-counting rules. We give necessary and sufficient conditions for a top-$k$-counting rule to satisfy the fixed-majority criterion. We find that, for most of the rules in our new class, the complexity of winner determination is high (that is, the problem of computing the winners is NP-hard), but we also show examples of rules with polynomial-time winner determination procedures. For some of the computationally hard rules, we provide either exact FPT algorithms or approximate polynomial-time algorithms

Political Influence in Multi-Choice Institutions: Cyclicity, Anonymity and Transitivity

We study political influence in institutions where members choose from among several options their levels of support to a collective goal, these individual choices determining the degree to which the goal is reached. Influence is assessed by newly defined binary relations, each of which compares any two individuals on the basis of their relative performance at a corresponding level of participation. For institutions with three levels of support (e.g., voting games in which each voter may vote "yes", "abstain", or vote "no"), we obtain three influence relations, and show that the strict component of each of them may be cyclical. The cyclicity of these relations contrasts with the transitivity of the unique influence relation of binary voting games. Weak conditions of anonymity are sufficient for each of them to be transitive. We also obtain a necessary and sufficient condition for each of them to be complete. Further, we characterize institutions for which the rankings induced by these relations, and the Banzhaf-Coleman and Shapley-Shubik power indices coincide. We argue that the extension of these relations to firms would be useful in efficiently allocating workers to different units of production. Applications to various forms of political and economic organizations are provided.Level-based influence relations, Multi-choice institutions, cyclicity, anonymity, transitivity

Weighted Approval Voting

To allow society to treat unequal alternatives distinctly we propose a natural extension of Approval Voting [7] by relaxing the assumption of neutrality. According to this extension, every alternative receives ex-ante a non-negative and finite weight. These weights may differ across alternatives. Given the voting decisions of every individual (individuals are allowed to vote for, or approve of, as many alternatives as they wish to), society elects all alternatives for which the product of total number of votes times exogenous weight is maximal. Our main result is an axiomatic characterization of this voting procedure.microeconomics ;