| paper | d4-journals-geb-2004-0069 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The named results establish mathematical properties of a bargaining solution, but none asserts that a computational task can be performed or is hard. A continuous bargaining model would also need a new computational formulation, but the absence of a computational anchor is already decisive.
fails bit a — no named computational result to mirror
No result is covered: the paper's named results concern existence, convergence, ordinality, symmetry, and geometry, without computational guarantees.
I can’t make a qualifying positive case from this paper under your anchor rule: it contains no named computational result.
The closest candidate is Theorem 1 (proved here). For a bargaining problem \((a,S)\) with \(n\ge3\), repeatedly set \(a_0=a\) and \(a_{k+1}=\Phi(a_k,S)\); the sequence converges to a point \(\Psi(a,S)\) that is efficient, ordinal, and symmetric. That is a result about the mathematical properties of a solution, not a claim that computing it is in P, hard, or belongs to any other complexity class. The paper gives no finite encoding for its arbitrary Pareto surfaces and no complexity analysis. Its results on ground-point existence and uniqueness have the same limitation.
A large bargaining group with many members sharing complete utility and disagreement types could be a plausible high-multiplicity scenario in its own right. But the paper models players as separate utility coordinates on an arbitrary Pareto surface; it does not define a distribution over types or a type-level bargaining problem. Turning its solution into one would require additional modeling choices, and would not supply a computational anchor from this paper.
So there is no honest named continuous problem per anchor to hand to a prover, and no Class A/B/C prediction grounded in the paper’s results. The weak point is decisive: the paper studies ordinal bargaining theory, not computational social choice. The presence of many players, or of continuous utility spaces, does not by itself establish a population-continuization mirror.
The only plausible anchor is Theorem 1: for a finite set of \(n\ge 3\) players and a Pareto surface \(S\), the iteration \(a_{k+1}=\Phi(a_k,S)\) converges to an efficient, ordinal, symmetric solution. That is a result about existence and properties, not the complexity of a computational problem. Propositions 2 and 3 on ground points have the same limitation. The paper gives no finite encoding of its arbitrary Pareto surfaces, so even the strongest computational follow-up—say, approximating \(\Psi(a,S)\) for a succinctly represented surface—would first need a new input model. It could be worthwhile research, but it is not a computational result from this paper for the continuization programme to mirror.
The most plausible population story is a large group of people who share bargaining type. In this model, however, each player is a separate utility coordinate, and the output specifies a payoff for each player. If same-type players have identical utilities and disagreement payoffs, treating them as a single type collapses their coordinates: their number does not define a new bargaining objective. To make their mass affect the solution, one must add something such as mass-weighted utility or bargaining power. That changes the model’s ordinal structure: independently order-preserving transformations of the players’ utilities do not preserve weighted sums.
One could instead keep a continuum of separate negotiators and represent their payoffs as a function over types. That is a coherent direction, but it replaces the paper’s finite-dimensional geometry of arbitrary Pareto surfaces with an infinite-dimensional bargaining model. Its feasible set, encoding, and computational question would all need to be supplied. The paper’s theorem provides no computational anchor for those choices.
So the case against a *mirror of this paper* is strong: neither its solution theorem nor its ground-point results states a computational claim, and making bargaining parties into a continuous population changes the object being studied. The broader claim that no related continuous computational bargaining project could ever be worthwhile is harder to establish; such a project might be valuable, but it would be new work rather than a continuization of a computational result here.
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.