| paper | d4-journals-mss-2025-0057 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | yes |
P→P discrete result → its continuous mirror
Answer: Polynomial-time solvable in \(m\), \(\tau\), and \(L\), including with \(m=2\) fixed. · discrete side: polynomial · adjudication: proved
full proof & adversarial review →
Proposition 4.1
statement extracted from the paper’s text layer
Given rational type masses \(\mu\), a rational two-chamber weight matrix \(A\), quotas \(q\), a baseline coalition \(s\), a target type \(t^\star\), and a required focal mass \(\delta>0\), find the infimum of \(\sum_t x_t\), report whether it is attained, and return a witness if it is. For an outside action, require \(As\not\ge q\), \(0\le x\le\mu-s\), \(x_{t^\star}\ge\delta\), \(A(s+x)\ge q\), and \(A(s+x-\delta e_{t^\star})\not\ge q\); for every \(t\) with \(x_t>0\), also require \(A(s+x-x_t e_t)\not\ge q\). For an inside action, require \(As\ge q\), \(0\le x\le s\), \(x_{t^\star}\ge\delta\), \(A(s-x)\not\ge q\), and \(A(s-x+\delta e_{t^\star})\ge q\); for every \(t\) with \(x_t>0\), also require \(A(s-x+x_t e_t)\ge q\).
A society consists of types with masses \(\mu_t\), each type carrying its pair of chamber weights. The decision variable \(x_t\) is the mass of type \(t\) joining or leaving a coalition; the objective minimizes total changed mass while a focal cohort of mass \(\delta\) is pivotal and every participating type block is essential.
The block test treats all selected mass of one type as a single actor, so a submass can be inessential even when the full type block is pivotal; this is not the paper's individual-by-individual essentiality.
fatal: False
The mirror extends Proposition 4.1's rank calculation to finding minimum critical mass in a two-chamber weighted quota game. It leaves the monotonicity and null-player results and the probability-based power indices untreated.
The honest computational anchor is Proposition 4.1, proved in this paper. It gives a way to compute \(g\)-criticality rank from minimal coalition families: if \(S\) is losing, player \(i\) is \(g\)-critical exactly when some minimal winning coalition, after removing \(S\), still contains \(i\); the rank is the smallest cardinality of such a residual set. If \(S\) is winning, the same statement holds using minimal blocking coalitions after removing \(S^c\). The paper notes that a similar procedure for inside criticality appeared earlier in Aleandri et al.; Proposition 4.1 itself is proved here. The paper gives no named result classifying a problem as polynomial-time, NP-hard, or otherwise, so this is an algorithmic foothold rather than a complexity theorem.
My lead mirror is Essential Mass-Rank. Consider a large federation whose delegates can join coalitions to pass proposals in two separately counted chambers. Many delegates have the same voting role, represented by the same pair of chamber weights. If there are \(n\) delegates but only \(\tau\) such types, with \(n\gg\tau\), type \(t\) has population mass \(\mu_t\), where \(\sum_t\mu_t=1\). Mass is a fraction of delegates. This is a plausible high-multiplicity regime; the paper’s Italian party example, with few parties, need not be that regime.
Here is one precise version of the problem. The input is rational type masses \(\mu\), a nonnegative weight matrix \(A\in\mathbb{Q}_{\ge0}^{2\times\tau}\), chamber quotas \(q\), and a baseline coalition \(s\in[0,\mu]\). A coalition \(y\) wins when \(Ay\ge q\) coordinatewise. The input also specifies a target type \(t^\star\) and a positive target-cohort mass \(\delta\): this cohort must participate in the action. For an outside action, the baseline \(s\) is losing and we choose added mass \(x\), with \(0\le x\le\mu-s\) and \(x_{t^\star}\ge\delta\). The resulting coalition \(y=s+x\) must win, while removing the target cohort must make it lose: \(A(y-\delta e_{t^\star})\not\ge q\). For an inside action, \(s\) is winning and we choose removed mass \(x\), with \(0\le x\le s\) and \(x_{t^\star}\ge\delta\). Now \(y=s-x\) must lose, while restoring the target cohort must make it win: \(A(y+\delta e_{t^\star})\ge q\). In either case, every type contributing positive action mass must be essential at the type-block level: removing that type’s added mass must undo the outside action’s win, or restoring its removed mass must undo the inside action’s loss. The task is to find the infimum of \(\sum_t x_t\), report whether it is attained, and return a witness if it is. The value is the continuous analogue of the minimum coalition size in Proposition 4.1.
For this fixed two-chamber quota version, I would expect Class A. The focal cohort’s essentiality can be handled by trying each chamber as the one whose quota fails after its removal or restoration. At a mass-minimizing solution, any other nonessential type component could be removed from the action to lower its mass while preserving the target cohort’s essentiality. That leaves a constant number of linear programs in \(\tau\) variables. Strict quota failures can mean the infimum is not attained, which is why the problem asks for attainment as well as value. This is a prediction about the proposed mirror, not a result proved by the paper. For arbitrary simple games represented by their minimal winning families, I make no tractability claim.
I think the authors could recognize this as an extension of their group-criticality question: coalitions still act inside or outside a baseline, the objective still seeks the smallest critical group, and participating type blocks must be essential. The mirror covers Proposition 4.1’s rank calculation in a two-quota setting. It does not cover the paper’s monotonicity and null-player propositions, or its probability-based power indices.
The weak point is substantial: the paper requires each individual player in a critical group to be essential. In an atomless population, removing one individual has zero mass and cannot change a quota outcome. Essential Mass-Rank therefore tests the essentiality of a participating type block, while \(\delta\) preserves a positive-size focal cohort. That is a defensible group-level continuation, but it is not an exact limit of individual essentiality. If the authors or a referee require their player-by-player definition to remain unchanged, this mirror fails.
Proposition 4.1 is the only serious computational anchor. It characterizes a player’s \(g\)-criticality rank by filtering an explicitly given family of minimal winning or blocking coalitions and taking the smallest residual cardinality. That is a useful computation rule, but the paper gives no input model or complexity result: with the families explicitly listed, the operation is just a scan; with an implicit game representation, its difficulty depends on that representation. So the proposed mass optimization would introduce a new computational problem rather than continue a complexity question this paper has already formulated.
There are plausible high-multiplicity settings for quota games, such as large assemblies or shareholder votes. The obstacle is what happens to the paper’s defining condition. A \(g\)-critical coalition requires every individual member to be essential. In an atomless population, removing one individual changes no mass and therefore cannot change whether the coalition wins. The individual-level condition disappears. Requiring a positive target cohort of size \(\delta\) restores essentiality only for that cohort; testing the other contributors by removing an entire type’s action mass treats each such mass as a single agent. That is a different unit of participation from the paper’s players, and the result can depend on how participants are grouped into cohorts.
The strongest repair is to define essentiality at the mass level: no proper positive-mass subcoalition may still be critical. That is coherent for quota games, and an optimization over mass could be worth studying. But it replaces “every player is essential” with inclusion-minimality of a measurable group. For explicit quota boundaries, the resulting question is an optimization over that boundary; for general monotone games, there is no canonical winning region on type-mass vectors supplied by the paper. The two-chamber model picks one such region and makes its own problem well-defined, but it does not establish that the paper’s \(g\)-criticality computation has a continuous counterpart.
So the negative case is strongest against this being a clear ChoCo continuation: the paper supplies an algorithmic characterization, not a complexity landscape, and preserving its central notion of essential players fails in the atomless limit. I would not claim the universal “no worthwhile mirror” conclusion is secure, though. If the authors accept mass-minimality as their group-level notion, a quota-based mirror is plausible; the weak point in the case against is that this repair may be a sensible new question even though it changes the paper’s definition.
The adversarial triple: the proponent anchors on up to three named results; the opponent sees that case and must defeat every anchor; the judge decides which case convinced it. These are the pipeline’s own outputs, generated by tools/triple_run.py — no human edited them. The paper’s own text is not reproduced here beyond the quoted statement above.