Item Details

abstract

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$.

subject

contributor

Stasikelis, Kara Aileen (author)

Mason, Sarah (committee chair)

Howards, Hugh (committee member)

Moore, Frank (committee member)

date

2013-06-06T21:19:38Z (accessioned)

2013 (issued)

degree

Mathematics (discipline)

10000-01-01 (liftdate)

embargo

forever (terms)

identifier

http://hdl.handle.net/10339/38573 (uri)

language

en (iso)

publisher

Wake Forest University

title

A Combinatorial View of Weighted Voting

type

Thesis