| paper | d4-journals-jet-2005-0009 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
The paper’s numbered results characterize and compare bargaining equilibria, but assert no computational guarantee, hardness result, or solver-backed formulation. The proposed Mass-Alliance SPE is a plausible research extension, yet it is unanchored and cannot supply the missing computational result from this paper.
fails bit a — no named computational result to mirror
No named computational result is covered. The proposed extension would revisit equilibrium characterizations under unanimity and majority with type masses; the paper’s conclusions for its finite sequential game remain outside that mirror.
I find no named computational result in this paper that meets the requested anchor rule. Its named results concern equilibrium existence, characterization, and comparative statics; none classifies a problem as polynomial-time solvable, hard, FPT, or similar. The headline findings—that unanimity produces more aggressive bargaining than majority rule, and that safeguards can worsen agreements—motivate a computational question, but they are not complexity anchors. So I can’t honestly give a theorem number to mirror. The paper itself does, however, make a credible case that large organizations with composite interests are the setting: it discusses groups such as trade unions and political parties. [Working Paper 424](https://www.qmul.ac.uk/sef/media/econ/research/workingpapers/2000/items/wp424.pdf)
The strongest positive modelling case is a large union negotiating with an employer, or a large political organization negotiating with another party. Imagine hundreds of thousands of members but only a relatively small support of distinct bargaining types. A type would specify everything the game uses about a member: their utility over agreement outcomes, discount factor, disagreement payoff, and role under the internal decision procedure. The mass \(\mu_t\) is the share of the alliance with type \(t\). This is a plausible high-multiplicity regime for a paper whose central object is an organization acting through a collective decision mechanism.
Unanchored research lead — Mass-Alliance SPE. An instance contains a finite set of feasible outcomes \(X\); a singleton bargaining opponent with rational utilities and discount factor; a finite set of alliance types \(\mathcal T\) with rational masses \(\mu_t\), utilities and other protocol-relevant parameters; and one of the paper’s internal decision procedures together with the alternating-offer protocol. The question is to compute an exact stationary subgame-perfect equilibrium: the offers, each type’s action at each internal decision, continuation values, and resulting agreement lottery. The solution is the equilibrium strategy profile and outcome, with sequential-rationality conditions satisfied. The game’s objective is equilibrium behavior, not maximizing a newly invented social-welfare function. Members of a type act alike, and the internal procedure aggregates their actions by mass; under majority rule, for example, acceptance depends on the accepting share. The society is what has been continuized. Lotteries over outcomes remain part of the bargaining model, rather than being the continuization target.
For a fixed finite protocol and finite outcome set, I would tentatively expect the relevant problem to be Class A when the paper’s common-order or one-dimensional structure makes decisions turn on finitely many type-level comparisons. Then the algorithm need only work with the \(\tau\) supported types and their masses, rather than enumerate members. That is a research conjecture, not something established by this paper. Useful next questions include the exact complexity in the number of outcomes, \(\tau\), input bit length, and protocol size; whether the paper’s uniqueness claims survive with atomless mass; and whether unanimity’s greater aggressiveness persists when the alliance is described by a distribution of types.
This proposal covers only bargaining between one alliance and one outside player under a fixed internal procedure. Its weakest point is also why it cannot count as an anchor-backed case: the paper studies equilibrium behavior analytically, not the complexity of computing equilibrium. Further, replacing named members and their move order with type masses could change pivotality or veto power. The alliance setting makes the mirror plausible, but an author might still view the computational problem as a new extension rather than a result already latent in their paper.
The negative case is strong on anchoring: there is no computational result in this paper to mirror. Its results characterize subgame-perfect equilibria and compare bargaining under unanimity, majority, and other internal procedures. They do not classify the complexity of a computational problem or give an algorithm. The proponent acknowledges this, so its Mass-Alliance SPE proposal is a research lead, not an anchor from the paper.
That lead is still plausible. A large union or political organization with a modest number of preference and bargaining types is a credible high-multiplicity setting. One could represent the members by type masses, aggregate majority decisions by share, and define unanimity to require agreement from every positive-mass type. A computational question about finding an equilibrium in that model would make sense; the paper’s bargaining focus makes it reasonable to think the authors might recognize it as an extension of their problem.
That is also where the universal negative case fails. I can say the proposal is not a mirror of a computational theorem in this paper. I cannot honestly say that no worthwhile continuous-population question exists here. The missing complexity result is decisive against the requested anchors, but it does not rule out a new computational study of bargaining in a large alliance. The strongest honest verdict is therefore no surviving anchor, but a weak case for “no worthwhile mirror in any scenario.”
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.