| paper | d4-journals-geb-2016-0062 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The paper’s propositions establish comparative bargaining and risk-aversion claims, not an algorithm, complexity bound, or other computational result. Bit (a) therefore fails before a continuous-population question can be anchored; adding a distribution of bargainers would also require new choices about how they are paired and how their utilities are aggregated.
fails bit a — no named computational result to mirror
The paper’s propositions and lemmas characterize risk aversion, bargaining toughness, and a correspondence’s continuity; none is a computational result covered by a mirror.
I can’t make an honest positive case under ChoCo’s anchor requirement: this paper contains no named computational result. Its propositions and lemmas concern bargaining outcomes, comparative risk aversion, and continuity of a correspondence. None asserts a complexity classification or an algorithm for a computational problem.
The closest foothold is Proposition 5, proved here: for every \(x\in(0,\bar\epsilon)\) and every \(u_0\in\operatorname{int}(U)\), there exists \(u\in U\) that is more risk-averse than \(u_0\) on \([x,1]\) and is a tougher bargaining opponent than \(u_0\) against every \(v\in U\), under both Nash and Kalai–Smorodinsky bargaining. The paper combines this with Propositions 2 and 4, cited from KRS: if \(u\) is globally more risk-averse than \(u_0\), then \(u_0\) is tougher than \(u\) under KS and Nash, respectively. These support the paper’s claim about the fragility of the relationship between risk aversion and bargaining toughness. They are not computational anchors.
A conceivable follow-on scenario would have many repeated bargaining units, with agents grouped by identical utility functions and a mass distribution over those types. But the paper models one pair of bargainers at a time; it gives no population objective, mass-transfer decision, or computational task for such a population. Defining one would add a new problem rather than continueize a result in this paper. Nor do the paper’s lotteries, continuum of feasible shares, or correspondence over utility functions make its society continuous: those are outcome, uncertainty, and function-space objects, not a continuous population.
So there is no per-anchor continuous problem to hand to a prover without inventing a different research question. The weakest point is decisive: the paper’s subject is axiomatic bargaining between two individuals, while ChoCo’s target is computational complexity for a society represented by type masses. A population extension may be worth studying, but this paper does not provide the required computational result to anchor it.
The case against a ChoCo mirror is strongest at the point the proponent identifies: this paper states no computational problem and proves no algorithmic or complexity result. Proposition 5 is an existential comparative-static result about utility functions; Propositions 2 and 4 are cited bargaining theorems. The upper-hemicontinuity failure concerns a correspondence over pairs of functions. None gives a finite input, a computational task, or a complexity claim to continuize. They are the paper’s central results, but that does not make them computational anchors.
The proponent’s repeated-bargaining scenario is the best starting point for a stronger mirror. One could imagine a large society whose members have different utility functions and participate in negotiations. But the paper supplies no rule for pairing those members, forming bargaining sides, or aggregating their utilities and outcomes. Pair independent dyads and a distribution over dyad types adds an aggregation question to pointwise bargaining results. Form teams and the model needs a collective utility rule, changing the bargaining problem. Either construction may inspire a worthwhile project; its computational question comes from those added choices, not from a result in this paper.
That gap persists if types are defined as complete utility functions, as high multiplicity requires. Repeated agents with the same utility curve do not create a larger bargaining population inside the paper’s model: each bargaining instance still has two players, \(u\) and \(v\). Treating a cohort as one side requires specifying how its members’ utilities combine. Treating each member as a separate player requires a multi-party bargaining model. Neither choice is determined by the paper.
Nor does asking an algorithm to construct Proposition 5’s witness supply the missing mirror. The paper assumes a compact function class \(U\), but gives no finite encoding of its members or of the class itself. Discretizing utility curves could define a computational problem, yet the discretization and the search task would be new modeling decisions. The existing continuum of feasible shares, lotteries, and utility functions is continuity in outcomes and mathematical objects; it does not make the society continuous.
So none of the proponent’s candidate footholds survives as a population-computational anchor. The honest limit of this negative case is that one could develop a valuable computational theory of bargaining in large populations. The paper, however, does not provide the result or the population model that would make that theory its continuous mirror.
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.