{"id":"7dbfab24-fbe5-4691-b173-90dd27623b72","arxiv_id":"2608.04924","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"For generic finite games, the correlated equilibrium polytope is claimed to be affinely isomorphic to the polytope of the subgame on essential strategies, which is either full-dimensional or a singleton, but the proof contains a serious gap.","lead":"This paper proves new structural theorems about the dimension of the set of correlated equilibria for typical finite games, resolving a 2024 conjecture by Brandenburg, Hollering, and Portakal. A critical step in the proof is false, so the central theorem is not established as written.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"False induction base in Theorem 3.12: maximal r(p) does not imply strict incentive constraints, so Theorem 2.7/3.13 is unproven as written.","rationale":"The reader's weakest_assumption identifies exactly the false base case of Theorem 3.12, and the counterexample is valid: in the generic Bach-or-Stravinsky game of Example 3.6, p has full slice diversity r(p)=4=d1+d2, all slices nonzero, and yet two incentive constraints hold with equality. Since the induction parameter is (sum d_i)-r(p), the maximal-r case is the base that must support the induction; a false assertion there invalidates the proof, even though the theorem's statement happens to be true in this example. A likely repair is to balance p via Proposition 3.5 before checking the base case, after which distinct slices make the relevant cross-slice constraints strict; but as written the proof does not do this. I therefore keep the reader's REJECT verdict: this is a correctness gap in the central argument, not a disagreement with the theorem's plausibility and not a criticism of the authors.","tokens_in":14817,"tokens_out":15535,"duration_ms":132515,"concrete_test":"In a computer algebra system, construct the coefficient matrix A_G for the payoff matrices in Example 3.6 and evaluate the four incentive constraints at p=(3/10,1/5,1/5,3/10); also normalize the row and column slices and count distinct ones to compute r(p). If the script outputs r=4 and the slacks H_{2,1}^{(1)}(p_{-1,2})=0 and H_{1,2}^{(2)}(p_{-2,1})=0, the base assertion of Theorem 3.12 is refuted.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The induction base of Theorem 3.12 asserts: if r(p)=sum d_i, then all incentive constraints for p are strict. This is false. In Example 3.6's generic Bach-or-Stravinsky game, take p=(3/10,1/5,1/5,3/10). All slices are nonzero and the two row slices and two column slices are distinct, so r(p)=2+2=4=d1+d2. Direct substitution gives H_{2,1}^{(1)}(p_{-1,2})=-3(1/5)+2(3/10)=0 and H_{1,2}^{(2)}(p_{-2,1})=2(3/10)-3(1/5)=0, while the other two incentive slacks are positive. Thus p is a non-Nash correlated equilibrium with maximal r(p) but two binding constraints. The paper's Example 3.14 also exhibits a maximal-r point with a tight constraint. The base case is the zero-parameter endpoint of the induction, so the induction cannot be closed and Theorem 3.12, and hence Theorem 2.7/3.13, is not established. The gap is repairable by first applying Proposition 3.5 to balance p, after which maximal r and distinct slices give strictness, but that is not the argument written.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript studies the dimension of correlated equilibrium polytopes for finite normal-form games under an oriented-matroid notion of genericity. Its main results are Theorem 2.7 (restated as Theorem 3.13): for a generic game G, if P_G is not full-dimensional, then some proper subgame \\tilde G has full-dimensional correlated equilibrium polytope affinely isomorphic to P_G; and Theorem 3.12: if a generic game has a correlated equilibrium all of whose slices are nonzero, then P_G is full-dimensional or a singleton. The proof strategy is an induction on the number r(p) of distinct normalized slices of a suitably chosen equilibrium, with balancing perturbations from Proposition 3.5 and support-reduction via Corollary 3.10.","tokens_in":14982,"tokens_out":23410,"duration_ms":207026,"significance":"If correct, Theorem 2.7 would settle and generalize a conjecture of Brandenburg, Hollering, and Portakal for 2 x n games, and would give a substantially stronger reduction than Myerson's dual reduction. The paper also contains explicit computational examples, a careful treatment of oriented-matroid genericity, and an interesting sufficient condition for full-dimensionality. However, the central induction has a false base case, so the main theorems are not established as written; the paper's own examples exhibit the failure.","major_comments":[{"comment":"The assertion that r(p) = sum_i d_i implies all incentive constraints at p are satisfied with strict inequality is false. In the generic Bach-or-Stravinsky game of Example 3.6, the point p = (3/10, 1/5, 1/5, 3/10) lies in P_G; its four slices are all nonzero and the two slices in each player direction are distinct, so r(p) = d_1 + d_2 = 4. Direct substitution gives H_{2,1}^{(1)}(p_{-1,2}) = -3(1/5) + 2(3/10) = 0 and H_{1,2}^{(2)}(p_{-2,1}) = 2(3/10) - 3(1/5) = 0, while the other two incentive slacks are positive. Example 3.14 shows the same phenomenon at maximal r(q) = 6. Since this base case is the starting point of the induction, Theorem 3.12 is not proved, and Theorem 3.13 (and hence Theorem 2.7) is unsupported. The gap is repairable: one should first use Proposition 3.5 and Corollary 3.10 to replace p by a balanced point with all entries positive and r not decreased; then at r = sum_i d_i, balancedness plus pairwise distinctness of all slices forces H_{k,ell}^{(i)}(p_{-i,k}) > 0 for all k != ell, and positivity of all entries gives full-dimensionality. That argument is not what appears in the manuscript, and the present base case also ignores the need for positive entries rather than merely nonzero slices.","section":"Section 3, proof of Theorem 3.12, base case"}],"minor_comments":[{"comment":"In the bullet 'if ell = 1 and k > d_k^{(1)}', the condition should read k > d_1^{(1)}; the notation d_k^{(1)} is otherwise undefined in that context.","section":"Section 3, proof of Theorem 3.12, second case"},{"comment":"After constructing G' with r(p') > r(p), the proof says 'By the induction hypothesis, the theorem then follows'; it should explicitly state that G' is still in the same oriented-matroid stratum as G, so P_{G'} and P_G have the same dimension by Remark 2.6.","section":"Section 3, proof of Theorem 3.12, induction step"},{"comment":"There are several typos: 'contraint' in Proposition 3.5, 'aribitrarily' in Proposition 3.11, 'non-emtpy' and 'the the inclusion' in Theorem 3.13, and 'Sagemathscript' in the introduction.","section":"Section 3"},{"comment":"The phrase 'using Mathematica[3]' appears to attribute the computation to reference [3], which is a MathRepo entry for correlated equilibria; please clarify the software citation.","section":"Example 2.5"}],"recommendation":"major_revision","confidential_remarks":"The reader's report recommends rejection, and I agree that the proof as written is invalid. However, the defect is localized to the base case of Theorem 3.12, and a repair exists within the paper's own toolkit via Proposition 3.5 and Corollary 3.10. I therefore recommend major revision rather than rejection. The authors should be asked to restructure the proof so that balancing and positivity of p are established before the maximal-r case, and to add the missing transfer argument via Remark 2.6."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague—\n\nThe paper is worth a look: it attacks a real conjecture, and the main reduction idea is genuinely cleaner than Myerson's dual reduction. But the central proof has a load-bearing flaw, and I don't think Theorem 2.7/3.13 is established as written.\n\nWhat's new: the balanced-point notion (Definition 3.3) and the perturbation Proposition 3.5 are original tools, and the paper uses them to propose a reduction to the subgame of essential strategies that is affinely isomorphic—stronger than Myerson's. If the proof goes through, it settles and generalizes the 2024 Brandenburg–Hollering–Portakal conjecture. The exposition is clear and the examples, especially Example 3.14, are helpful. The computational examples and supplementary code are a plus.\n\nThe soft spot: Theorem 3.12's induction base. The proof claims that if r(p)=Σd_i, then all incentive constraints at p are strict. That assertion is false. Using the authors' own generic Bach-or-Stravinsky game (Example 3.6), take p=(3/10,1/5,1/5,3/10). All slices in both directions are nonzero and distinct, so r(p)=4=d1+d2. Direct substitution gives H_{2,1}^{(1)}(p_{-1,2}) = -3(1/5)+2(3/10)=0 and H_{1,2}^{(2)}(p_{-2,1}) = 2(3/10)-3(1/5)=0, while the other two incentive slacks are positive. So p is a correlated equilibrium with maximal r(p) and two binding constraints. The base case is exactly the zero-parameter endpoint of the induction, so the induction cannot be closed as written. The gap might be repairable—perhaps by first using Proposition 3.5 to balance p, then arguing that maximal r plus balancedness forces strictness—but that argument is not in the manuscript. Everything downstream (Theorem 3.13, Theorem 2.7) inherits the gap.\n\nThe auxiliary lemmas (3.9, 3.10, 3.11) look plausible, and the citation pattern is fine; the paper engages properly with [3], [4], [12], [15]. I don't see a circularity beyond the induction base issue.\n\nWho this is for: people working on correlated equilibrium polytopes, oriented matroid strata, and game-theoretic dimension questions. They will find the ideas worth engaging with, and the conjecture is important enough that a corrected proof would be valuable. I'd send it to a serious referee—this deserves refereeing, not desk rejection—but I would not cite it as a proof yet, and the authors need to fix the base case.\n\nRecommendation: engage, but tell the authors to repair the induction base before you trust Theorem 3.12.","headline":"The reduction idea and balanced-point toolkit are genuinely new, but the main theorem rests on a false induction base: maximal r(p) does not imply strict incentive constraints, so the proof as written is incomplete.","tokens_in":15608,"tokens_out":7099,"would_cite":false,"duration_ms":51039,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["91A10","52B11","05B35"],"pacs":[],"model":"deepseek-v4-flash","headline":"Generic games reduce to full-dimensional subgame polytopes.","keywords":["correlated equilibrium","generic games","polytope dimension","oriented matroid","subgame reduction","affine isomorphism","full-dimensional polytope","game theory"],"falsifier":"Compute the generic Bach–Stravinsky game of Example 3.6 and take the point $p=(2/7,3/7,0,2/7)$: it is a correlated equilibrium with $r(p)=4=\\sum_i d_i$, but the player-2 constraint comparing column 2 against column 1 holds with equality, directly refuting the induction's base-case premise that maximal $r(p)$ implies strictness of all incentive constraints.","tokens_in":14518,"feed_emoji":"🎲","tokens_out":7884,"duration_ms":67088,"temperature":0.7,"pith_summary":"This paper studies the dimension of the correlated equilibrium polytope, the convex set of joint mixed strategies that are stable against unilateral deviations. For generic finite games, it claims that whenever this polytope is not full-dimensional, there is a proper subgame whose correlated equilibrium polytope is full-dimensional and affinely isomorphic to the original. This generalizes a 2024 conjecture for 2×n games. If true, it means the combinatorial shape of a generic game's correlated equilibria is fully captured by the smaller game formed by the strategies that actually appear with positive marginal probability.","feed_headline":"Generic game polytopes shrink to full-dimensional subgames","feed_subtitle":"If the proof holds, every flat correlated-equilibrium polytope is just the polytope of a smaller game.","key_machinery":"The argument runs on the coefficient matrix $A_G$ of the incentive and nonnegativity constraints and on oriented-matroid genericity: all nonzero maximal minors of $A_G$ are required to be nonzero, so the face poset of $P_G$ is constant on each oriented-matroid stratum. The internal engine is the slice-count function $r(p)$, which counts how many distinct normalized nonzero slices $\\pi_{-i,k}(p)$ occur across all players; the proof pushes a correlated equilibrium through convex combinations and small payoff perturbations to raise $r(p)$ until, in the intended base case, all incentive constraints are strict.","core_discovery":"The paper's central claim is that the dimension defect of the correlated equilibrium polytope $P_G$ of a generic game $G$ is concentrated entirely on unused strategies. Let $S_c^{(i)}$ be the set of player $i$ strategies that occur with positive marginal probability in some correlated equilibrium, and let $\\tilde G$ be the subgame on these strategy sets. Then $P_G$ is affinely isomorphic to $P_{\\tilde G}$, and $P_{\\tilde G}$ is either full-dimensional or a singleton. The proof strategy first establishes a sufficient condition: if a generic game has a correlated equilibrium $p$ whose every slice $p_{-i,k}$ is nonzero for all players $i$ and strategies $k$, then $P_G$ is either full-dimensional or a singleton. It then strips away strategies with zero marginal probability and applies this condition to the support subgame.","pith_inferences":["If the theorem survives repair, a natural next step is to make the reduction constructive, outputting the support subgame and an explicit affine isomorphism; that would provide a practical dimension-reduction routine for correlated-equilibrium computation.","The slice-count function $r(p)$ behaves like a tensor-rank witness, and the proof's technique of raising $r$ by convex combinations suggests an unexplored link between the dimension of $P_G$ and the tensor rank of points inside it.","The proof's base case assumes that maximal $r(p)$ forces all incentive constraints to be strict, but the paper's own Bach–Stravinsky example has a vertex with $r(p)=\\sum_i d_i$ and a non-strict constraint, so a corrected argument needs another way to handle the maximal-$r$ case."],"forward_implications":["For generic 2×n games, the earlier conjecture is settled: every non-full-dimensional correlated equilibrium polytope is affinely isomorphic to the full-dimensional polytope of a smaller 2×~n subgame.","If a generic game has a correlated equilibrium with every slice nonzero, intermediate dimensions are impossible: the polytope is either full-dimensional or a point.","The dimension of $P_G$ is determined by which pure strategies have positive marginal probability in some correlated equilibrium.","The reduction is strictly stronger than the classical dual reduction, because it preserves the entire polytope up to affine isomorphism rather than only one inclusion of equilibrium sets.","The affine-isomorphism statement gives a precise combinatorial meaning to the notion that only actively used strategies matter for the shape of correlated equilibria."],"supporting_citations":[{"why":"Introduces correlated equilibrium, the object whose polytope dimension is studied.","marker":"[1]"},{"why":"Establishes that the correlated equilibrium set is a convex polytope in the probability simplex.","marker":"[2]"},{"why":"States the 2×n conjecture that the paper claims to settle and generalize.","marker":"[3]"},{"why":"Supplies the oriented-matroid genericity condition and strata used throughout the proofs.","marker":"[4]"},{"why":"Classifies generic 2×2 games, used to test the oriented-matroid strata and to recover the two known polytope types.","marker":"[5]"},{"why":"Density of games with finitely many Nash equilibria, used to show a generic non-singleton polytope cannot consist only of Nash equilibria.","marker":"[10]"},{"why":"Prior dual-reduction procedure whose weaker preservation property motivates the stronger affine-isomorphism claim.","marker":"[12]"},{"why":"Shows Nash equilibria lie on the boundary of the correlated equilibrium polytope, used in Proposition 3.11.","marker":"[14]"}],"fun_headline_variants":["Correlated equilibrium polytopes flatten only on unused strategies","CE polytope dimension defect is concentrated in unused strategies","Flat CE polytopes are always subgame polytopes in generic games","Generic CE polytopes: only the support subgame matters for dimension"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument assumes that a correlated equilibrium whose normalized slices reach the maximum possible count must satisfy every deviation constraint strictly; the paper's own Bach–Stravinsky example has this maximum count yet one constraint holds with equality, so that premise fails as stated.","fun_headline_variants_meta":{"raw":{"variants":["Correlated equilibrium polytopes flatten only on unused strategies","CE polytope dimension defect is concentrated in unused strategies","Flat CE polytopes are always subgame polytopes in generic games","Generic CE polytopes: only the support subgame matters for dimension"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000578,"raw_usage":{"total_tokens":2658,"prompt_tokens":813,"completion_tokens":1845,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":429,"completion_tokens_details":{"reasoning_tokens":1771}},"tokens_in":429,"tokens_out":1845,"duration_ms":11189,"temperature":1.0,"reasoning_tokens":1771,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T14:39:05.036127+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the generic Bach–Stravinsky game of Example 3.6 and take the point $p=(2/7,3/7,0,2/7)$: it is a correlated equilibrium with $r(p)=4=\\sum_i d_i$, but the player-2 constraint comparing column 2 against column 1 holds with equality, directly refuting the induction's base-case premise that maximal $r(p)$ implies strictness of all incentive constraints.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces correlated equilibrium, the object whose polytope dimension is studied."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Establishes that the correlated equilibrium set is a convex polytope in the probability simplex."},{"cited_title":"Brandenburg, B","cited_arxiv_id":null,"evidence_quote":"States the 2×n conjecture that the paper claims to settle and generalize."},{"cited_title":"Brandenburg, B","cited_arxiv_id":null,"evidence_quote":"Supplies the oriented-matroid genericity condition and strata used throughout the proofs."},{"cited_title":"Calv´ o-Armengol","cited_arxiv_id":null,"evidence_quote":"Classifies generic 2×2 games, used to test the oriented-matroid strata and to recover the two known polytope types."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Density of games with finitely many Nash equilibria, used to show a generic non-singleton polytope cannot consist only of Nash equilibria."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Prior dual-reduction procedure whose weaker preservation property motivates the stronger affine-isomorphism claim."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Shows Nash equilibria lie on the boundary of the correlated equilibrium polytope, used in Proposition 3.11."}],"review_version":1}