Approval Gap of Weighted k-Majority Tournaments

Jeremy Coste, Breenn Flesch, Joshua D. Laison +2

A $k$-majority tournament $T$ on a finite set of vertices $V$ is defined by a set of $2k-1$ linear orders on $V$, with an edge $u\to v$ in $T$ if $u>v$ in a majority of the linear…