2013
DOI: 10.2139/ssrn.2370399
|View full text |Cite
|
Sign up to set email alerts
|

Measuring Voting Power in Convex Policy Spaces

Abstract: Classical power index analysis considers the individual's ability to influence the aggregated group decision by changing its own vote, where all decisions and votes are assumed to be binary. In many practical applications we have more options than either "yes" or "no". Here we generalize three important power indices to continuous convex policy spaces. This allows the analysis of a collection of economic problems like, e.g., tax rates or spending that otherwise would not be covered in binary models.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
16
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
7

Relationship

5
2

Authors

Journals

citations
Cited by 8 publications
(16 citation statements)
references
References 39 publications
0
16
0
Order By: Relevance
“…This line of reasoning can be used to motivate a definition of a Shapley-Shubik index for (j, k) simple games as defined in [5], c.f. [12]. Suppose that voters successively and independently each choose a level of approval in J with equal probability.…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations
“…This line of reasoning can be used to motivate a definition of a Shapley-Shubik index for (j, k) simple games as defined in [5], c.f. [12]. Suppose that voters successively and independently each choose a level of approval in J with equal probability.…”
Section: Preliminariesmentioning
confidence: 99%
“…The later games were called simple aggregation functions in [13], linking to the literature on aggregation functions [9], and interval simple games in [14]. A Shapley-Shubik like index for those games was motivated and introduced in [12], an axiomatization is given in [14].…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…So, we want to study [0, 1] n → [0, 1]-functions v with v(0) = 0, v(1) = 1, and v(x) ≤ v(y) for all x, y ∈ [0, 1] n with x ≤ y. In [20] the author called those objects continuous simple games since, for simplicity, v was assumed to be continuous. To go in line with the above naming we call them interval simple games here 5 .…”
Section: Committee Decisionsmentioning
confidence: 99%
“…Mimicking the properties of a simple game we speak of interval simple games for real-valued decisions in [0,1]. A generalization of the Shapley-Shubik index to that context was proposed in [20]. Here we give an axiomatic justification for that power index.…”
Section: Introductionmentioning
confidence: 99%