A geometric and combinatorial view of weighted voting

Details A geometric and combinatorial view of weighted voting A geometric and combinatorial view of weighted voting

2011-09-06

arxiv.org/abs/1109.1082v1

Mathematics

Combinatorics

24 pages, 3 figures

Scientific paper

A natural partial ordering exists on all weighted games and, more broadly, on all linear games. We describe several properties of the partially ordered sets formed by these games and utilize this perspective to enumerate proper linear games with one generator. We introduce a geometric approach to weighted voting by considering the convex polytope of all possible realizations of a weighted game and connect this geometric perspective to the weighted games poset in several ways. In particular, we prove that generic vertical lines in $C_n$, the union of all weighted $n$-voter polytopes, correspond to maximal saturated chains in the poset of weighted games, i.e., the poset is a blueprint for how the polytopes fit together to form $C_n$. Finally, we describe the facets of each polytope, from which we develop a method for determining the weightedness of any linear game that covers or is covered by a weighted game.

Affiliated with

Also associated with

No associations

Rating

A geometric and combinatorial view of weighted voting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A geometric and combinatorial view of weighted voting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A geometric and combinatorial view of weighted voting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-92926