Artikel
Measuring voting power in convex policy spaces
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.
- Language
-
Englisch
- Bibliographic citation
-
Journal: Economies ; ISSN: 2227-7099 ; Volume: 2 ; Year: 2014 ; Issue: 1 ; Pages: 45-77 ; Basel: MDPI
- Classification
-
Wirtschaft
- Subject
-
power
single peaked preferences
convex policy space
group decision making
Shapley-Shubik index
Banzhaf index
nucleolus
simple games
multiple levels of approval
- Event
-
Geistige Schöpfung
- (who)
-
Kurz, Sascha
- Event
-
Veröffentlichung
- (who)
-
MDPI
- (where)
-
Basel
- (when)
-
2014
- DOI
-
doi:10.3390/economies2010045
- Handle
- Last update
-
10.03.2025, 11:42 AM CET
Data provider
This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
Object type
- Artikel
Associated
- Kurz, Sascha
- MDPI
Time of origin
- 2014
Other Objects (12)
Influence in systems with convex decisions
On minimum sum representations for weighted voting games
Correction to "On minimum sum representations for weighted voting games"
Binary subspace codes in small ambient spaces
Heuristic and exact solutions to the inverse power index problem for small voting bodies
Bounds for the diameter of the weight polytope
Divisible minimal codes
Non-projective two-weight codes
Capacity of generalized diamond networks
Lifted codes and the multilevel construction for constant dimension codes
A note on the linkage construction for constant dimension codes
The [46,9,20]₂ code is unique
Influence in systems with convex decisions
On minimum sum representations for weighted voting games
Correction to "On minimum sum representations for weighted voting games"
Binary subspace codes in small ambient spaces
Heuristic and exact solutions to the inverse power index problem for small voting bodies
Bounds for the diameter of the weight polytope
Divisible minimal codes
Non-projective two-weight codes
Capacity of generalized diamond networks
Lifted codes and the multilevel construction for constant dimension codes
A note on the linkage construction for constant dimension codes
The [46,9,20]₂ code is unique
Influence in systems with convex decisions
On minimum sum representations for weighted voting games
Correction to "On minimum sum representations for weighted voting games"
Binary subspace codes in small ambient spaces
Heuristic and exact solutions to the inverse power index problem for small voting bodies
Bounds for the diameter of the weight polytope
Divisible minimal codes
Non-projective two-weight codes
Capacity of generalized diamond networks
Lifted codes and the multilevel construction for constant dimension codes
A note on the linkage construction for constant dimension codes