A Combinatorial View of Weighted Voting

Given a chain of the partially ordered set of weighted games, it is currently unknown if weights can be assigned to each of the $n$ voters so that the chain is weighted. We conjecture that every consistent chain $C$ through weighted games admits weights, $\vec{w}$, such that for all weighted games $v$ in $C$, there exists a quota $q$ such that $v = (q, \vec{w})$. We prove that this is the case for $n\leq 5$. It is still currently unknown whether our conjecture is true for $n >5$.

Grantor dc:publisher

Wake Forest University

Year dc:date.issued

2013

Author dc:creator

• Stasikelis, Kara Aileen

Language dc:language.iso

en

Handle dc:identifier.uri

http://hdl.handle.net/10339/38573

OAI identifier oai:identifier

oai:wakespace.lib.wfu.edu:10339/38573