Weighted Committee Games

Autor: Stefan Napel, Alexander Mayer, Sascha Kurz
Rok vydání: 2017
Předmět:
FOS: Computer and information sciences
Majority rule
Information Systems and Management
General Computer Science
Computer science
media_common.quotation_subject
voting power
0211 other engineering and technologies
Weighted voting
Collective choice
Borda rule
02 engineering and technology
91B12
Management Science and Operations Research
Industrial and Manufacturing Engineering
C71
D71
geometry of voting
Shareholder
Copeland rule
Computer Science - Computer Science and Game Theory
Simple (abstract algebra)
Voting
0502 economics and business
ddc:330
FOS: Mathematics
Mathematics - Combinatorics
Preference (economics)
voting games
media_common
050210 logistics & transportation
021103 operations research
Notice
weighted voting
05 social sciences
antiplurality
plurality
C63
Modeling and Simulation
Combinatorics (math.CO)
Social choice theory
Mathematical economics
Computer Science and Game Theory (cs.GT)
Zdroj: SSRN Electronic Journal.
ISSN: 1556-5068
DOI: 10.2139/ssrn.3084703
Popis: Many binary collective choice situations can be described as weighted simple voting games. We introduce weighted committee games to model decisions on an arbitrary number of alternatives in analogous fashion. We compare the effect of different voting weights (share-holdings, party seats, etc.) under plurality, Borda, Copeland, and antiplurality rule. The number and geometry of weight equivalence classes differ widely across the rules. Decisions can be much more sensitive to weights in Borda committees than (anti-)plurality or Copeland ones.
26 pages, 9 tables, 4 figures
Databáze: OpenAIRE