{"id":"158cc2f6-ba2d-4bbf-8619-3acc9512c021","arxiv_id":"1908.06506","paper_version":2,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":5.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Using doubly stochastic matrices, the authors prove that the achievable societal rankings for a fixed profile are exactly the faces meeting the convex hull of cumulative column sums of the profile matrix.","lead":"This paper shows that the set of all possible ranking outcomes from a fixed voter profile under positional voting rules can be described by a simple geometric object built from the ballot data. It gives elementary proofs of known limits and a new recipe for designing voting weights that force a chosen ranking.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified.","rationale":"I read the paper as a self-contained linear-algebra treatment of positional voting. The main new result, Theorem 4.2, is a direct consequence of Proposition 4.1: W is the cone on the v_k, so the image Q_p W is the cone on the s_k, and because s_{n-k} differs from t_k only by a multiple of 1, faces achievable by nonzero weights are exactly faces meeting the convex hull of the t_k. I re-derived the key identities and found no gap. Theorem 3.3's construction via Q = R F^{-1} correctly produces a matrix with row and column sums 1, hence a rational linear combination of permutation matrices; the infinite family comes from the positive-dimensional kernel of the map from Q^{n!} to M_n. The proofs of Theorems 3.6 and 3.9 also check out; the cyclic-shift argument in Theorem 3.9 supplies one impossible ranking per cyclic orbit, giving (n-1)! distinct exclusions. The reader's weakest assumption correctly identifies the main limitation: algebraic profiles may have negative entries, and only ordinal outcomes are rescued by Proposition 3.8. This is stated honestly in the paper and does not affect Theorem 4.2 for a genuine ballot profile. I found one degenerate edge case in Theorem 4.2's wording: if W closure includes the zero vector, the all-tie outcome may not be represented by the convex hull. Since zero weights are not a meaningful positional procedure, I treat this as a clarifying qualifier rather than a defect. On balance the ACCEPT verdict stands.","tokens_in":14371,"tokens_out":29004,"duration_ms":290534,"concrete_test":"Run a computational check of Theorem 4.2 for n=3 and n=4: generate random nonnegative integer profiles, enumerate all faces of the braid arrangement obtainable by sampling nonzero weights from W (or by linear programming over the cone), and compare with the set of faces intersecting conv(t_1,...,t_{n-1}). Also test the n=3 one-voter profile Q_p = I with the all-tie face to confirm the zero-weight edge case; if the comparison matches for all nonzero weights, the theorem holds as intended.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central result Theorem 4.2 is internally sound for all nonzero weighting vectors. For a fixed profile p, Q_p W is exactly the cone generated by s_k = Q_p v_k; since s_{n-k} = t_k - (Nk/n)1, every nonzero conical combination of the s_k has the same braid face as a convex combination of the t_k, and conversely every convex combination of t_k yields a nonzero weight w = Σ b_i v_{n-i} whose result differs from that convex combination by a multiple of 1. The proof is self-contained modulo Proposition 4.1, which correctly identifies the closure W with the cone on v_1,...,v_{n-1}. The only caveat, already noted by the reader, is that Theorem 3.3 constructs algebraic profiles with possibly negative entries; Proposition 3.8 restores nonnegative integer profiles only for ordinal outcomes, so cardinal constructions are not literal ballot counts. A second, minor edge case is that the convex-hull formulation drops the zero vector: if the degenerate all-zero weighting vector is admitted through W closure, the all-tie face may not meet the convex hull (e.g., one-voter profile 1≻2≻3 for n=3). This is fixed by adding 0 to the hull or by explicitly excluding the zero weight. Neither issue undermines the paper's substantive claims.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper revisits positional voting systems through the lens of doubly stochastic matrices. The main results are: Theorem 3.3, a linear-algebra proof of the Daugherty–Eustis–Minton–Orrison theorem that any n−1 linearly independent weighting vectors and any desired result vectors can be realized by some (possibly fractional or negative) profile; Theorem 3.6, a construction of profiles achieving the maximal n!−(n−1)! strict societal rankings; Theorem 3.9, an elementary proof of Saari's upper bound on the number of achievable strict rankings; and Theorem 4.2, a geometric characterization of the possible outcomes from a given profile in terms of the convex hull of the partial column sums of Q_p, together with an algorithm for choosing weights to realize a desired outcome. The arguments are largely self-contained and rely on the Birkhoff–von Neumann theorem, basic convex geometry, and the braid arrangement.","tokens_in":14581,"tokens_out":10942,"duration_ms":113212,"significance":"If the results hold, the paper is a valuable expository and methodological contribution: it gives transparent, constructive re-proofs of known results in algebraic voting theory and offers a new geometric description of achievable outcomes. The paper is honest about its limitations: the constructed profiles in Theorem 3.3 may have negative entries, and nonnegative integer profiles are guaranteed only for ordinal outcomes, not for cardinal score outcomes. The proofs are detailed and checkable, and Theorem 4.2 provides a concrete, worked algorithm for weight selection. These strengths make the paper suitable for publication after a minor revision.","major_comments":[],"minor_comments":[{"comment":"The statement should clarify whether the zero weighting vector is admitted. If the closure of W is meant to include the all-zero weight, then the all-tie outcome 0 is possible for every profile, but 0 does not necessarily lie in the convex hull of t_1,...,t_{n-1}; for example, with n=3 and a single voter ranking 1≻2≻3, the convex hull is the segment from (1,0,0) to (1,1,0) and does not contain 0. Please either explicitly exclude the zero weighting vector or add {0} to the convex hull in the statement.","section":"Section 4, Theorem 4.2"},{"comment":"The notation W is used inconsistently: Section 2 defines W as the open cone of strictly decreasing sum-zero vectors, while Proposition 4.1 describes the closed cone of nonincreasing vectors. The closure should be denoted consistently (e.g., \\overline{W}) throughout, especially in Proposition 4.1 and Theorem 4.2.","section":"Sections 2 and 4"},{"comment":"The abstract says the paper gives a 'simple and explicit construction of paradoxical profiles' without noting that the constructed profiles may contain negative and fractional entries. The body is transparent about this (see the remark after Theorem 3.3 and Proposition 3.8), but the abstract should carry the same qualifier, since the cardinal constructions are not literal ballot counts.","section":"Abstract and Section 3, Theorem 3.3"},{"comment":"There is a typo in the paragraph before the proof: 'oberve' should be 'observe'.","section":"Section 3, Theorem 3.9"},{"comment":"The randomized sampling procedure is described as likely to produce a 'nearly exhaustive' list of possible rankings; since the theorem gives exact geometric conditions, the authors could note that a deterministic enumeration of the chambers intersecting the convex hull is also possible, though the sampling heuristic is fine for practical illustration.","section":"Section 4, Example 4.3"}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThe paper is a solid, clearly written re-derivation of known bounds in positional voting theory, with one genuinely new geometric result (Theorem 4.2) that makes the space of achievable outcomes easy to visualize and compute. The main bounds—Saari's n!-(n-1)! maximum and Daugherty et al.'s results for prescribed outcomes—are not new, but the proofs here are more elementary and self-contained than the originals, using Birkhoff–von Neumann and the braid arrangement. That is worth something: the construction in Theorem 3.3 gives an explicit Q = RF^{-1} and a path to a real profile via a doubly stochastic decomposition. The new Theorem 4.2 characterizes achievable rankings as the faces intersecting the convex hull of cumulative column sums, and it checks out.\n\nThe soft spots are modest. The most important is that the constructed profiles can have negative or fractional entries; Proposition 3.8 fixes this only for ordinal, not cardinal, outcomes. The paper says so, but it does narrow the practical reading of \"choosing weights to realize desirable outcomes from a given profile\" to ordinal rankings. The zero vector edge case in Theorem 4.2 is a minor technicality: if you admit the all-zero weighting via the closure, the all-tie face may not meet the hull; adding 0 to the hull handles it. Neither issue threatens the main claims.\n\nThe citation pattern looks fine—the attribution to Saari and Daugherty et al. is explicit, and the new result is not claimed for them. No circularity. The math is internally consistent. I checked the dimension count in Proposition 3.1 and the conical combination argument in Proposition 4.1; both are correct.\n\nWho gets value: anyone teaching or working on scoring rules who wants an accessible proof of the classic bounds and a concrete way to enumerate possible rankings for a given profile. It won't change practice in social choice, but it is a clean contribution to the pedagogy and toolkit of voting theory.\n\nRecommendation: send it to a serious referee. It's not a flashy paper, but it is correct, honest about what is new, and the geometric characterization is a legitimate extension that deserves to be in the literature.","headline":"A modest but correct paper that re-proves known voting bounds cleanly and adds a genuinely useful convex-hull characterization; deserves a serious referee.","tokens_in":15132,"tokens_out":1719,"would_cite":true,"duration_ms":16471,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["91B12","15B51","52C35"],"pacs":[],"model":"deepseek-v4-flash","headline":"For any fixed profile, the rankings achievable by changing the positional voting weights are exactly those whose corresponding faces intersect the convex hull of the cumulative column sums of the profile matrix.","keywords":["positional voting","doubly stochastic matrices","braid arrangement","social choice","paradoxical profiles","cumulative column sums","convex hull","Birkhoff-von Neumann theorem"],"falsifier":"Take a specific small profile (say n=4 with a handful of integer ballots), compute the vectors $t_1,t_2,t_3$, and exhaustively enumerate all faces of the braid arrangement that intersect their convex hull; then separately enumerate all rankings obtained by sampling or rationally searching every weighting vector in $W$. If any ranking appears in one list but not the other, Theorem 4.2 is false. Because both lists are finite and computable for small n, this is a direct computational check.","tokens_in":14149,"feed_emoji":"🗳️","tokens_out":14242,"duration_ms":128990,"temperature":0.7,"pith_summary":"The paper proves a complete geometric description of what can happen in a positional voting election—plurality, Borda count, and all weighted scoring rules—when the voter profile is fixed and only the weighting vector may vary. The central result states that the possible results vectors are exactly the points whose associated ranking faces intersect the convex hull of the cumulative column sums of the profile matrix $Q_p$. This turns a question about election outcomes into a convex-geometry question, and it yields a constructive recipe: pick a point in that hull corresponding to a desired ranking, decompose it into conical combination coefficients, and those coefficients directly specify a weighting vector that produces the ranking. Along the way the paper gives elementary linear-algebra proofs of the classical upper bound on the number of achievable strict rankings and of the existence of paradoxical profiles where different rules produce drastically different outcomes. The whole analysis is carried by viewing the tally operation as multiplication by a doubly stochastic matrix, so that the classical decomposition theorem for such matrices converts the problem into linear combinations of permutation matrices.","feed_headline":"A profile's possible outcomes form one convex hull","feed_subtitle":"Any ranking whose face meets the hull can be realized, and the paper shows how to find the weights.","key_machinery":"The load-bearing device is the identity $T_w p = Q_p w$: the result of a positional rule with weights $w$ on profile $p$ is just the product of the profile matrix $Q_p$ (whose rows and columns sum to the number of ballots) with $w$. Since $Q_p$ has constant row and column sums, shifting and rescaling makes it doubly stochastic, and the classical decomposition theorem for doubly stochastic matrices expresses it as a convex combination of permutation matrices—i.e., as a genuine (possibly fractional) ballot profile. For the geometric characterization, the cone $W$ of strict weighting vectors is generated by $n-1$ explicit vectors $v_k$, so the achievable results are exactly the conical combinations of $s_k = Q_p v_k$; discarding the constant direction leaves the convex hull of the cumulative column sums $t_1,\\dots,t_{n-1}$. Faces of the braid arrangement encode rankings (with ties as lower-dimensional faces), so 'which face intersects the hull' is the complete answer to which rankings are possible.","core_discovery":"For a fixed profile $p$, with profile matrix $Q_p = [q_1 \\cdots q_n]$ whose $(i,j)$ entry counts voters ranking candidate $i$ in position $j$, the paper's Theorem 4.2 shows that a ranking (or partial ranking with ties) is achievable by some positional voting weighting vector exactly when the corresponding face of the braid arrangement intersects the convex hull of the vectors $t_k = q_1 + \\cdots + q_k$ for $k=1,\\dots,n-1$. Because adding a constant to all candidates' totals does not change the ranking, this hull is studied in the sum-zero hyperplane, and every point in it can be written as a conical combination of the $t_k$. The coefficients of that combination translate, through the cone generators of the weighting space, into explicit weights that realize the desired outcome. The paper also proves that arbitrary prescribed results vectors can be realized by infinitely many profiles for up to $n-1$ linearly independent weighting rules (Theorem 3.3), that at most $n! - (n-1)!$ strict rankings are possible from any profile (Theorem 3.9), and that there exist profiles achieving the maximum (Theorem 3.6).","pith_inferences":["The convex-hull criterion gives an audit tool: from a published profile one can precompute every ranking an election official could induce by choosing weights, so attempted manipulation becomes detectable before the election.","Because the conical coefficients in the decomposition are generally not unique, the same outcome can usually be produced by multiple weighting vectors; this raises a robustness question the paper leaves open—which of those weights is least sensitive to small changes in the profile.","The same linear-algebra mechanism may extend beyond single-winner positional rules to other aggregation schemes whose tally is a linear map on a ballot-count matrix, such as multiwinner scoring or committee elections.","The half-space proof of the upper bound only needs the weighting space to be a convex cone inside the sum-zero hyperplane, so the counting method could, in principle, be adapted to restricted weight families (e.g., integer weights or weights with prescribed ties) to give sharper bounds."],"forward_implications":["For any actual ballot profile, no ranking can be forced by any positional weighting vector unless its face intersects the convex hull of the cumulative column sums $t_1,\\dots,t_{n-1}$.","A desired ranking can be reverse-engineered: pick a point in that hull belonging to the ranking's face, write it as a conical combination of the $t_k$, and the coefficients directly give a weighting vector that realizes it.","At most $n! - (n-1)!$ strict rankings are possible from a single profile, and profiles attaining this maximum exist; both statements now follow from a half-space argument on the braid arrangement.","Paradoxical profiles—in which different positional rules yield very different winners—can be constructed explicitly by choosing a matrix with constant row and column sums and expanding it into ballots via the doubly stochastic decomposition theorem.","When only ordinal rankings matter, any profile can be replaced by a nonnegative integer ballot profile without changing the set of achievable rankings, so the geometric characterization applies to real elections."],"supporting_citations":[{"why":"supplies the main theorem (Theorem 1 of that paper) that this paper reproves with elementary linear algebra and extends with explicit constructions.","marker":"[6]"},{"why":"the source of the classical upper bound and existence results on achievable ranking counts that this paper recovers via a half-space argument.","marker":"[11]"},{"why":"states the doubly stochastic matrix decomposition theorem used to expand the profile matrix into ballots.","marker":"[3]"},{"why":"also credited for the doubly stochastic matrix decomposition theorem in the paper's argument.","marker":"[15]"},{"why":"provides the algorithm used to compute a decomposition in the explicit paradoxical-profile construction.","marker":"[7]"},{"why":"supplies the supporting hyperplane theorem used in the upper-bound proof.","marker":"[10]"}],"fun_headline_variants":["Convex hull of profiles yields all voting outcomes","Find weights to realize any voting ranking","All possible election outcomes lie in one convex hull","Simple proof of voting paradoxes via convex hulls"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that a constructed 'profile' may have negative or fractional ballot counts; the paper's conversion to genuine nonnegative-integer ballots is proved only when the goal is an ordinal ranking, so cardinal score outcomes may not be realizable with real voters.","fun_headline_variants_meta":{"raw":{"variants":["Convex hull of profiles yields all voting outcomes","Find weights to realize any voting ranking","All possible election outcomes lie in one convex hull","Simple proof of voting paradoxes via convex hulls"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000194,"raw_usage":{"total_tokens":1297,"prompt_tokens":830,"completion_tokens":467,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":446,"completion_tokens_details":{"reasoning_tokens":409}},"tokens_in":446,"tokens_out":467,"duration_ms":5576,"temperature":1.0,"reasoning_tokens":409,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:44:54.905647+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a specific small profile (say n=4 with a handful of integer ballots), compute the vectors $t_1,t_2,t_3$, and exhaustively enumerate all faces of the braid arrangement that intersect their convex hull; then separately enumerate all rankings obtained by sampling or rationally searching every weighting vector in $W$. If any ranking appears in one list but not the other, Theorem 4.2 is false. Because both lists are finite and computable for small n, this is a direct computational check.","supporting_citations":[{"cited_title":"Eustis, Gregory Minton, and Michael E","cited_arxiv_id":null,"evidence_quote":"supplies the main theorem (Theorem 1 of that paper) that this paper reproves with elementary linear algebra and extends with explicit constructions."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"the source of the classical upper bound and existence results on achievable ranking counts that this paper recovers via a half-space argument."},{"cited_title":"Three observations on linear algebra","cited_arxiv_id":null,"evidence_quote":"states the doubly stochastic matrix decomposition theorem used to expand the profile matrix into ballots."},{"cited_title":"A certain zero-sum two-person game equivalent to the optimal assignment problem","cited_arxiv_id":null,"evidence_quote":"also credited for the doubly stochastic matrix decomposition theorem in the paper's argument."},{"cited_title":"Notes on Birkhoff–von Neumann decomposition of doubly stochastic matrices","cited_arxiv_id":null,"evidence_quote":"provides the algorithm used to compute a decomposition in the explicit paradoxical-profile construction."},{"cited_title":"Linear algebra","cited_arxiv_id":null,"evidence_quote":"supplies the supporting hyperplane theorem used in the upper-bound proof."}],"review_version":1}