wnoise

I'm looking for any results (ideally published papers) that:
(a) describe or limit the space of the "pairwise preference vote count matrix"[1] that can be generated from complete[2] ranked ballots that allow ties,
(b) Actually have an algorithm for creating a set of ballots that result in said matrix,
and also:
(c) If this matrix has a small set of consistent names, and if so what they are.

[1]: I mean the matrix where the element at (i,j) is the number of voters who ranked candidate i above candidate j.
[2]: All candidates listed; though treating unlisted candidates as ties below any listed is effectively the same.

Anti-plurality is truly terrible. IRV still suffers from center-splitting (and -splitting in general).

Just how badly would an IRV-variant that on each round instead of throwing out the smallest top-rank, instead throws out the largest bottom-ranked? Is this a proposed system, and if so what is it called? What are the obvious terrible failure modes? And to what degree are they ameliorated by BTR-IRV equivalents of taking full-rankings between the two most-hated in determining which to eliminate?

I got a spam e-mail about how to UNCLOG my pipes. I immediately thought "United Nations Convention on ..."