2000 character limit reached
Weighted Committee Games
Published 8 Dec 2017 in math.CO and cs.GT | (1712.03114v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.