| paper | d4-conf-wine-2023-0033 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorems 4.1 and 5.1 are named computational results, so bit (a) holds. In the proposed atomless model, a unilateral report leaves the distribution of ballot types unchanged, making impartiality automatic; optimizing selected mass by type score is a different problem from designing an impartial mechanism for individually influential agents. Treating an entire positive-mass cohort as the deviator would change the axiom to coalition impartiality, so neither anchor yields an author-recognizable continuous analogue.
fails bit b-changes — the continuum limit changes the question
The proposed mirrors target Theorems 4.1 and 5.1. Theorem 4.4 is expressly excluded, and the remaining results are not anchored.
The strongest mirror I see is for Theorem 4.1, proved in the paper. It says that when \(1<k<n\) and \(k-k\bmod 2\ge 2\sqrt n\), there is a deterministic mechanism that selects at most \(k\) agents, is impartial, and guarantees a score ratio of
\[
\alpha=\frac{k-k\bmod 2}{k\left\lceil 2n/(k-k\bmod 2)\right\rceil}
\]
against the best set of exactly \(k\) agents, for every nonnegative, zero-diagonal vote matrix. The paper proves this by constructing the mechanism; it is an approximation result, not a hardness result.
A plausible population regime is a very large peer community that selects a fixed fraction of its members: for example, an online community with recurring patterns of weighted nominations. Let \(\kappa\in(0,1)\) be the fraction to select. A type \(t\) records both the member’s candidate class \(c(t)\) and their complete ballot pattern \(v_t\); \(\mu_t\) is the fraction of the community of that type, with \(\tau\) recurring types. As a per-capita model, let \(v_t(c)\) be the weight one member of type \(t\) directs to each member of candidate class \(c\). The score density of that class is \(q_c=\sum_t\mu_t v_t(c)\). This normalizes scores by population size and lets selected mass be fractional, as a continuous model requires.
Call the mirror Atomless Impartial Fractional Selection. Given \((T,\mu,v,\kappa)\), its solutions are deterministic measurable sets \(S\) of members with mass at most \(\kappa\). The objective is to maximize \(\int_S q_{c(i)}\,di\), against the benchmark \(\mathrm{OPT}_\kappa=\sup_{\lambda(Y)\le\kappa}\int_Y q_{c(i)}\,di\). Require impartiality in the paper’s individual sense: changing one member’s outgoing ballot must not change whether that member is selected. A deterministic rule selects the highest-score mass, using a fixed identity order only to resolve ties. In the atomless model, changing one ballot changes no aggregate score density, so this rule is impartial and reaches \(\mathrm{OPT}_\kappa\). With rational finite-support input, the mass allocation is found by sorting class scores and filling the capacity; it is tractable.
This is recognizable as a continuous version of their selection problem, but its main prediction is that the approximation barrier disappears: at fixed \(\kappa\), Theorem 4.1’s guarantee remains a constant, roughly \(\kappa/2\) when the ceiling aligns, while the atomless mirror achieves \(1\). The relevant further question is how the optimum changes when members have small but positive influence, rather than zero individual mass. I expect this mirror to be tractable; I see no hardness-transfer or continuum-specific hardness claim here.
A second, related mirror uses Theorem 5.1, also proved in the paper. For \(1<k<n\), \(mk\le 2n\), and \(k-k\bmod 2\ge2\sqrt n\), it gives an impartial assignment mechanism: agents can be assigned to at most one of \(m\) jobs, each job receives at most \(k\) agents, and the mechanism achieves ratio
\[
\alpha=\frac{k-k\bmod 2}{2k\left\lceil 2n/(k-k\bmod 2)\right\rceil}
\]
against the best feasible assignment.
Its continuous form, Atomless Impartial Fractional Assignment, uses the same population and ballot model, with a score density \(q_{\ell,c}\) for each job \(\ell\) and candidate class \(c\). It asks for disjoint measurable sets \(S_1,\ldots,S_m\), each of mass at most \(\kappa\), maximizing \(\sum_{\ell=1}^m\int_{S_\ell}q_{\ell,c(i)}\,di\). A single member’s ballot edit leaves every job’s aggregate scores unchanged, so a deterministic optimal assignment remains impartial. On finite-support rational input, the type-to-job mass allocation is a linear program with polynomially many variables in \(\tau\) and \(m\). The theorem’s condition \(mk\le2n\) becomes \(m\kappa\le2\). This mirror is also tractable; the next question is again how the result changes when individual influence is positive.
The weakness is central, not cosmetic: in an atomless population a unilateral report has no effect on any aggregate, so impartiality is nearly automatic. Also, using identity order to choose among equal-score members complicates the claim that the population has few complete types; if those tie-breaking identities count as type attributes, \(\tau\) is no longer small. The authors may recognize these as legitimate population-limit versions of selection and assignment, but they may reject them as mirrors of the paper’s strategic difficulty. That objection would leave the mirrors mathematically well-defined, while substantially limiting what they say about the paper’s main contribution.
I would not use Theorem 4.4 as an anchor: it proves tightness for the paper’s particular mechanism, not a limit on all impartial mechanisms. The mirrors cover the paper’s weighted selection and assignment guarantees; they do not claim to continuize every result or the cited impossibility and upper-bound work.
Theorem 4.1 and Theorem 5.1 are genuine algorithmic results: they construct impartial mechanisms with approximation guarantees. The strongest objection to mirroring them is that their central constraint is individual impartiality. In the proposed atomless model, that constraint disappears.
Let \(r\) describe reports on an atomless population, and let \(\mu_r\) be the distribution of report types. Changing the report of one individual \(x\) leaves the distribution unchanged: \(\mu_{r'}=\mu_r\). A selector based on that distribution therefore returns the same outcome after \(x\)’s deviation. A fixed identity order or randomized tie-breaking does not restore the constraint; either can be chosen independently of \(x\)’s report. Impartiality holds automatically.
That defeats the strongest version of the Theorem 4.1 mirror. For finitely many ballot types, the continuous benchmark can rank type-level scores and fill the capacity fractionally. But this computes an optimal fractional selection without the strategic trade-off that motivates the theorem. An individual deviation leaves type masses unchanged. Making a whole positive mass of a type deviate would create a group-impartiality problem, which changes the agent in the axiom from one person to a coalition. Keeping positive-mass individuals as atoms preserves individual influence only for those atoms; the remaining population is still atomless, and a model with many such atoms returns to a finite-agent problem. Shrinking the atoms as the population grows removes their influence in the limit.
Theorem 5.1 has the same obstruction. A continuous type-to-job assignment can be expressed as a linear program, with capacity constraints for each job and mass constraints for each type. Its aggregate solution is optimal for the stated fractional objective. Yet an individual report change does not alter the input distribution, so impartiality again imposes no restriction. Requiring an entire type mass to change reports would instead ask whether a cohort can affect its own assignment. The paper’s theorem concerns whether each agent can affect that agent’s own assignment.
There are plausible high-multiplicity settings for peer selection, including communities whose members nominate recurring classes of candidates. That helps make the population model sensible, and I would not count high-multiplicity work or type-based costs against it. The trouble remains even in that favorable regime: once reports and outcomes are represented only by population masses, the individual-level axiom that makes these theorems interesting is vacuous. For ballots aimed at named individuals, keeping complete ballot patterns in a small type space also requires substantial symmetry, but that is secondary to the axiom’s collapse.
The negative case is strongest for these two anchors, not airtight. A study of optimal fractional selection or assignment for anonymous cohorts could be worthwhile in its own right. The case against is that it would not preserve the computational question these theorems answer: how to approximate a good selection while preventing each selected agent from influencing their own selection.
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.