Weighted Committee Games
Combinatorics
2019-11-01 v2 Computer Science and Game Theory
Abstract
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.
Cite
@article{arxiv.1712.03114,
title = {Weighted Committee Games},
author = {Sascha Kurz and Alexander Mayer and Stefan Napel},
journal= {arXiv preprint arXiv:1712.03114},
year = {2019}
}
Comments
26 pages, 9 tables, 4 figures