8 problems

For each $n\ge6$, define … A simple game is a monotone voting game on $n$ voters, and $\operatorname{Bz}(v)$ denotes its normalized Banzhaf power vector. Exact two-level Banzhaf co…

Let an Alon–Edelman type result mean a bound showing that a simple game's power vector is close to the power vector of a game with only the concentrated $k$ voters and the remainin…

Classification conjecture. Each type composition $\widehat{n}$ is either weighted or there exists a type composition $\widehat{m}$ in this list with $\widehat{n}\ge\widehat{m}$. Th…

Inverse power index lower-bound conjecture. Every such simple game satisfies

Let $c_\mathcal{C}(n)$ denote the maximum critical threshold value of a complete simple game on $n$ voters. Complete-game growth conjecture. … This is the asymptotic form of the pa…

Let $c_\mathcal{S}(n)$ denote the maximum critical threshold value among simple games on $n$ voters. Simple-game threshold conjecture. For every $n\ge 4$, … The paper proves the di…

Let $[n]=\{1,\ldots,n\}$ and let $\Delta\subseteq2^{[n]}$ be a strongly acyclic simplicial complex. Define the Winder desirability relation $\leq_W$ on $2^{[n]}$ by $A\leq_W B$ if…

Let $[n]=\{1,\ldots,n\}$ and let $\Delta\subseteq 2^{[n]}$ be a simplicial complex. Define the Winder desirability relation $\leq_W$ on $2^{[n]}$ by $A\leq_W B$ if and only if, for…