{"id":"6f3b0b60-a00c-47db-a0d1-d4005008a1e8","arxiv_id":"2501.18966","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Closed-form enumeration and dimension formulas are given for simple games with a unique minimal winning vector, parameterized by the number of players and equivalence classes of players.","lead":"The paper counts, for each number of players, how many nonequivalent simple voting games have exactly one minimal winning coalition, and gives formulas for this count and for the dimension of each such game. The result gives exact control over a natural subclass of simple games that models bicameral and other voting rules.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Definition 2.3 omits maximality of desirability classes, so Remark 2.4 overstates the characterization; Theorem 3.14 relies on an unproved lemma that null and veto players each form at most one class.","rationale":"The reader identifies the incomplete characterization in Definition 2.3 as the weakest point, and my reading agrees. This is the most load-bearing concern because the enumeration formulas in Theorem 3.14 ultimately rest on a four-case decomposition whose exhaustiveness is asserted but not proved. The missing lemma—that a simple game has at most one null class and at most one veto class—is the precise condition that separates the true counting of isomorphism classes from the overcounting of raw pairs satisfying the insufficient conditions. Without this lemma, a reader cannot verify from the paper's definitions that every game with a unique minimal winning vector is counted exactly once. I do not believe the final formulas are wrong: manual checks of small cases (n ≤ 6) reproduce Table 2, the generating-function arguments for the no-null/no-veto case are standard and correct, and the construction of Theorem 3.14 is internally consistent if the missing lemma is supplied. However, because a central proof step is absent and a stated characterization is false as written, the paper should not be accepted without a revision that either incorporates the full conditions from Theorem 1 of [17] or explicitly proves the one-null-class/one-veto-class lemma and deduces the four categories from it. The reader's conditional verdict is appropriate, and my stress-test does not change it.","tokens_in":66,"tokens_out":22405,"duration_ms":273123,"concrete_test":"Write an exhaustive enumeration for n ≤ 7 that generates all simple games with a unique minimal winning vector directly from their minimal winning coalitions, computes the actual desirability equivalence classes, and groups the resulting isomorphism classes by (n, t). Compare these counts with Table 2 and with the values obtained from Theorems 3.11, 3.14, and 3.16. If the exhaustive counts match the table for every n ≤ 7, the formulas are numerically correct and the defect is confined to the definitions; if they differ, the central claim fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central enumeration depends on the claim that every pair (n, M) satisfying Definition 2.3 corresponds to a simple game with t equivalence classes. As stated, this is false: n=(4,3,2), M=(0,0,1) satisfies (a)-(c) but represents a game with only two equivalence classes, since the two null classes must be merged. Similarly, n=(2,2), M=(1,1) satisfies the conditions but describes a game with one veto class, not two. Thus counting all solutions of Definition 2.3 would overcount. The paper's actual formulas are not derived from this defective count; Theorem 3.14 instead constructs games from a no-null/no-veto base by adding at most one null class and at most one veto class. The proof of Theorem 3.14 asserts that every game with a unique minimal winning vector falls into one of the four categories a-d, but it never proves the key structural fact that null players form at most one equivalence class and veto players form at most one equivalence class. This lemma is true for simple games, but it is not stated or justified in the paper, so the exhaustiveness of the four-case split is an assumption rather than a demonstrated step. If that assumption failed, the summation in Theorem 3.14 could undercount or double-count, and the headline values in Table 2 would be unsupported. The gap is foundational rather than numerical: small cases match, and the underlying construction is sound, but the paper's stated definitions do not yet rigorously connect the enumeration to the class of games it claims to count.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies simple games (monotone Boolean functions) that have a unique minimal winning vector, called simple games with minimum. Building on a pair parameterization (n, M) of non-isomorphic simple games from the authors' earlier paper [17], it derives formulas for the number SG(n, t, 1) of such games with n players and t desirability-equivalence classes, sums these over t to obtain SG(n, 1), and gives dimension formulas: dimension is t, t-1, max(t-1,1), or max(t-2,1) depending on the presence of null and veto players (Theorems 4.1-4.4). Table 2 lists SG(n, t, 1) for n up to 20.","tokens_in":15861,"tokens_out":29727,"duration_ms":278109,"significance":"If the foundational issues are repaired, the paper is a meaningful contribution to the exact enumeration of monotone Boolean functions up to isomorphism: it gives a closed-form enumeration of an infinite family, not merely computational values, and it provides a complete dimension formula for that family. The enumeration uses Pólya's theorem and generating functions in a reproducible way, and the dimension results are proven from the definitions rather than fitted to data. I checked several small parameter ranges and found the formulas in Theorems 3.14 and 3.11 consistent with the nontrivial rows of Table 2. The main obstacle is that the formal definition of the counting object is currently incomplete, which affects the rigor of the central enumeration claim.","major_comments":[{"comment":"Definition 2.3, as written, does not require the classes N_i to be the maximal equivalence classes of the desirability relation, and Remark 2.4 is therefore not a consequence of Theorem 1 of [17] unless the missing maximality condition from the original definition is included. A concrete counterexample is n=(4,3,2) with M=(0,0,1): this pair satisfies conditions (a)-(c), but the two classes with m_i=0 are both null classes, and all null players are desirability-equivalent, so the game actually has two equivalence classes, not three. Counting all solutions of Definition 2.3 would therefore overcount configurations of this kind. Since SG(n,t,1) is defined as the number of such solutions, the object being counted is not the stated class of games with exactly t equivalence classes.","section":"Definition 2.3 and Remark 2.4"},{"comment":"The exhaustiveness of the four-case split in the proof of Theorem 3.14 assumes that every simple game with minimum has at most one null equivalence class and at most one veto equivalence class. This structural fact is true (null players are all mutually equally desirable because their entries in M vanish, and veto players are all mutually equally desirable because every winning coalition contains all of them), but it is neither stated nor proved in the paper. Without this lemma, the case split could undercount games with several null or veto classes, and the same omission is needed in Proposition 3.4(b) for the bound t <= floor(n/2)+1. The lemma should be stated and proved before Theorem 3.14.","section":"Theorem 3.14"},{"comment":"Table 2 contains an internal inconsistency whose source appears to be the defective Definition 2.3: for n=3, t=3 the table reports SG(3,3,1)=1, whereas Theorem 3.14 and Proposition 3.4 give SG(3,3,1)=0. The extra configuration is exactly the non-proper pair with two null classes discussed above. The authors should regenerate Table 2 from a single, corrected definition and ensure that the table, Definition 2.3, and Theorem 3.14 all refer to the same counting object.","section":"Table 2"}],"minor_comments":[{"comment":"The binomial coefficient in the convolution is typeset ambiguously as \"n-k / k\"; it should read n/k - 1, matching Proposition 3.9 and Corollary 3.12.","section":"Theorem 3.11"},{"comment":"In the proof of Proposition 3.9, the line displaying g(x^a) is missing the indicator function and uses an inconsistent variable n'; rewriting this step with n' and the divisibility condition explicitly would avoid confusion.","section":"Proposition 3.9"},{"comment":"In the lower-bound part of the proof of Theorem 4.3, the phrase \"for each 1 <= 2 < j <= t\" appears to be a typo for \"for each 2 <= i < j <= t\"; please correct it.","section":"Theorem 4.3"}],"recommendation":"major_revision","confidential_remarks":"The central enumeration and dimension results appear to be correct in substance, and the gap identified in Definition 2.3 is fixable within the manuscript's scope. The authors should be asked to restate the proper-representation definition with the missing maximality condition, prove the uniqueness of null/veto classes, and reconcile Table 2 with the theorem statements. I do not see evidence of circularity or data fitting; the reliance on [17] is a legitimate building block."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Sunny summary: this paper does something real. It gives a closed formula for the number of isomorphism classes of simple games with a unique minimal winning vector, for every number of players and every number of equivalence classes, plus a complete dimension characterization. The enumeration matches earlier special cases and the new values in Table 2 are internally consistent. The dimension proofs (Theorems 4.1–4.4) are clean and convincing; the lower-bound argument with pairs of losing coalitions is particularly nice.\n\nThe real weakness is in the parameterization. Definition 2.3, as stated, omits the condition that the N_i are the actual maximal desirability classes. So Remark 2.4 is false: there are pairs satisfying (a)–(c) that do not describe a game with t classes. The example n=(4,3,2), M=(0,0,1) with two null classes is a genuine counterexample. (The stress-test's other example, n=(2,2), M=(1,1), is actually a valid two-class game, so it doesn't land.) Relatedly, the proof of Theorem 3.14 splits into four categories but never proves the key structural fact that null players form at most one equivalence class and veto players form at most one equivalence class. That fact is true for simple games, but it is doing real work in the exhaustiveness of the split. Without it, the summation could in principle undercount or double-count.\n\nI want to be clear that this is patchable, not fatal. The enumeration formulas are not obtained by naively counting the defective Definition 2.3; they build games from a no-null/no-veto base by adding at most one null class and at most one veto class, which is the right construction. The small cases check out. The missing lemma is a few lines. So the central results are very likely correct.\n\nThis paper deserves a serious referee. It provides the first exact counts for general t and the dimension for all games with minimum. A competent referee should ask for a corrected Definition 2.3 (citing the full conditions in [17]) and a proof of the null/veto class lemma. After that, I'd be happy with it. Bring it to a reading group if the group likes enumeration or voting theory.","headline":"New enumeration and dimension results for simple games with a unique minimal winning vector; the results look right, but the parameterization definition and one proof need tightening.","tokens_in":16375,"tokens_out":12166,"would_cite":true,"duration_ms":105675,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05A15","91A12"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves closed formulas for the number of non-isomorphic simple games with a unique minimal winning vector, and shows that their dimension is t, t-1, max(t-1,1), or max(t-2,1) depending on null and veto players.","keywords":["simple games with minimum","unique minimal winning vector","monotone Boolean functions","generating functions","Pólya enumeration theorem","dimension of simple games","weighted games","null and veto players"],"falsifier":"Enumerate, for $n\\le 8$, all pairs of a class-size vector $\\mathbf n$ and a single vector $\\mathbf m$ with $0\\le m_i\\le n_i$, form the simple game whose winning coalitions are exactly the supersets of coalitions with composition $\\mathbf m$, quotient by all player permutations, and compare the number of isomorphism classes with $\\mathrm{SG}(n,1)$ in Table 2. A mismatch would identify a missing or duplicated class in the orbit-counting enumeration.","tokens_in":1,"feed_emoji":"🧮","tokens_out":17938,"duration_ms":241284,"temperature":0.7,"pith_summary":"Every simple game is a monotone yes/no rule on coalitions of players, and counting all of them up to renaming the players is an open problem. This paper carves out the subclass with a unique minimal winning vector, called simple games with minimum, and proves closed formulas for the number of non-isomorphic such games with $n$ players. The count is made by representing each game by its desirability-equivalence class sizes $\\mathbf n=(n_1,\\dots,n_t)$ and its single minimal winning vector $\\mathbf m=(m_1,\\dots,m_t)$, then using generating functions and Pólya's enumeration theorem to remove class permutations. The same representation yields a dimension theorem: such a game is the intersection of exactly $t$, $t-1$, $\\max(t-1,1)$, or $\\max(t-2,1)$ weighted majority games, depending on whether null players (never decisive) or veto players (needed for every win) are present. If the formulas hold, this voting-game family is exactly counted and dimensionally classified for every $n$.","feed_headline":"Exact formula found for simple games with a unique minimal win","feed_subtitle":"For any number of players, the count and dimension follow from class sizes and null/veto structure.","key_machinery":"The carrying object is the proper representation $(\\mathbf n,\\mathbf m)$: $\\mathbf n=(n_1,\\dots,n_t)$ lists the sizes of the $t$ equivalence classes of players under the desirability relation, and $\\mathbf m=(m_1,\\dots,m_t)$ records the unique minimal winning vector, normalized lexicographically so that isomorphic games share one pair. The counting machinery is Pólya's enumeration theorem on the symmetric group $S_t$: the single-class generating function $g(x)=x^2/(1-x)^2$ is symmetrized through $g(x^k)$ terms, and the coefficient of $x^n$ in the resulting series is $\\mathrm{SG}_{\\neg v,\\neg n}(n,t,1)$. Null and veto players are added afterward as extra singleton classes following Theorem 3.14. The dimension lower bound is forced by pairs of losing coalitions whose voter exchanges produce winning coalitions, proving that the corresponding weighted factors cannot be merged.","core_discovery":"The central result is an exact enumeration and a dimension classification. Theorem 3.11 gives $\\mathrm{SG}_{\\neg v,\\neg n}(n,t,1)$, the number of non-isomorphic one-minimal-winning-vector games with no null or veto players, as a finite sum over integer compositions $j_1+2j_2+\\cdots+tj_t=t$ of a convolution of binomial coefficients; Theorem 3.14 builds all games from these by appending one null class, one veto class, or both, yielding closed formulas for $\\mathrm{SG}(n,t,1)$, and Theorem 3.16 sums over $t\\le \\lfloor n/2\\rfloor+1$ to get $\\mathrm{SG}(n,1)$. The dimension theorems state that the minimum number of weighted games whose intersection gives the game is $t$ with no null or veto players, $t-1$ with nulls but no vetoes, $\\max(t-1,1)$ with vetoes but no nulls, and $\\max(t-2,1)$ with both. Table 2 lists the resulting counts for $n\\le 20$.","pith_inferences":["Because each fixed-$t$ generating function is rational, the counts $\\mathrm{SG}(n,t,1)$ are quasi-polynomial in $n$; this is an immediate consequence of the formulas even though the paper does not single it out.","The same parameterization and orbit-counting setup should extend to two or more minimal winning vectors; the paper identifies the rapid growth of the number of minimal winning vectors, not the enumeration method, as the bottleneck.","One could test the dimension theorem directly by computing the dimension of random games in the class with a standard integer-programming formulation and checking the results against the null/veto profile."],"forward_implications":["For every $n$, the total number $\\mathrm{SG}(n,1)$ can be computed exactly without enumerating monotone Boolean functions; the paper's Table 2 already gives values up to $n=20$.","Every game in the class has an explicit representation as an intersection of at most $t$ weighted games, and the null/veto profile tells exactly whether $t$, $t-1$, $\\max(t-1,1)$, or $\\max(t-2,1)$ factors are needed.","The bound $t\\le \\lfloor n/2\\rfloor+1$ makes Theorem 3.16 a finite sum, so the formulas apply for arbitrarily large $n$ without new computation beyond the summing.","The recursive formula in Corollary 3.12 reduces the symbolic generating-function work to a dynamic program in $n$ and $t$, so low-$t$ counts are easy to produce."],"supporting_citations":[{"why":"Supplies the parameterization of non-isomorphic simple games by class sizes and a minimal-winning-vector matrix, here restricted to the one-row case.","marker":"[17]"},{"why":"Provides the bipartite simple game enumeration and the t=2 count that Theorem 3.14 matches.","marker":"[11]"},{"why":"Introduces the desirability relation whose equivalence classes are the player classes n_i used throughout the parameterization.","marker":"[13]"},{"why":"Supplies the enumeration theorem used to quotient the class-counting generating functions by the symmetric group on equivalence classes.","marker":"[20]"}],"fun_headline_variants":["Exact count and dimension for unique-minimal-win simple games","Closed form enumerates simple games with one minimal winning set","Formula counts simple games with a unique minimal winning vector","Count and dimension solved for games with a single minimal win"],"cache_read_input_tokens":18560,"weakest_assumption_plain":"The formulas assume that every isomorphism class is counted exactly once by the normalized pairs $(\\mathbf n,\\mathbf m)$, and that a game with null or veto players always arises from a smaller no-null/no-veto game by adding at most one null class and at most one veto class; if two null classes or two veto classes could appear separately in one game, the total count would miss those games.","fun_headline_variants_meta":{"raw":{"variants":["Exact count and dimension for unique-minimal-win simple games","Closed form enumerates simple games with one minimal winning set","Formula counts simple games with a unique minimal winning vector","Count and dimension solved for games with a single minimal win"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000126,"raw_usage":{"total_tokens":1076,"prompt_tokens":874,"completion_tokens":202,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":490,"completion_tokens_details":{"reasoning_tokens":135}},"tokens_in":490,"tokens_out":202,"duration_ms":2801,"temperature":1.0,"reasoning_tokens":135,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-09T21:52:13.318200+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate, for $n\\le 8$, all pairs of a class-size vector $\\mathbf n$ and a single vector $\\mathbf m$ with $0\\le m_i\\le n_i$, form the simple game whose winning coalitions are exactly the supersets of coalitions with composition $\\mathbf m$, quotient by all player permutations, and compare the number of isomorphism classes with $\\mathrm{SG}(n,1)$ in Table 2. A mismatch would identify a missing or duplicated class in the orbit-counting enumeration.","supporting_citations":[{"cited_title":"Enumeration of simple g ames with two equivalence classes of players","cited_arxiv_id":null,"evidence_quote":"Supplies the parameterization of non-isomorphic simple games by class sizes and a minimal-winning-vector matrix, here restricted to the one-row case."},{"cited_title":"On the enumeration of bipartite simple games","cited_arxiv_id":null,"evidence_quote":"Provides the bipartite simple game enumeration and the t=2 count that Theorem 3.14 matches."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces the desirability relation whose equivalence classes are the player classes n_i used throughout the parameterization."},{"cited_title":"Kombinatorische Anzahlbestimmungen f ¨ ur Gruppen, Graphen und chemische Verbindungen","cited_arxiv_id":null,"evidence_quote":"Supplies the enumeration theorem used to quotient the class-counting generating functions by the symmetric group on equivalence classes."}],"review_version":1}