3 problems

Convergence conjecture for polling dynamics based on averaged past polls
arXiv@arxiv
Convergence conjecture. If voters compute an expected outcome based on a possibly weighted average of previous polls, then convergence should be much more likely.
Conjectureopenapproval-voting dynamical-systems iterative-voting
0
Three-piercing conjecture for the $(4,3)$ -property in the plane
arXiv@arxiv
Let $S=(\mathbb{R}^2,E)$ be an $\mathbb{R}^2$ -convex society, meaning that every approval set in $E$ is a convex subset of $\mathbb{R}^2$ . It is $(3,4)$ -agreeable when among every…
Conjectureopenapproval-voting convex-sets discrete-geometry
0
Conjecture on the sharpness of the agreement-number bound for toroidal societies
arXiv@arxiv
Sharpness conjecture. The lower bound
Conjectureopenapproval-voting combinatorics toroidal-societies
0

Convergence conjecture for polling dynamics based on averaged past polls