| paper | Picking Sequences and Monotonicity in Weighted Fair Division |
| authors | Mithun Chakraborty, Ulrike Schmidt-Kraepelin, Warut Suksompong |
| venue | IJCAI 2021 |
| filed under | fairalloc · indivisible |
| judged by | gpt-5.6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
The opponent wins the formal gate: the paper's named results prove fairness, monotonicity, and characterizations, but provide no qualifying computational result. The proposed high-multiplicity sequential-allocation model is plausible and preserves indivisible bundles and the picking rule, but it cannot repair the absence of bit (a). Therefore no anchor can support a green grade.
fails bit a — no named computational result to mirror
Theorem 4.6 is a fairness guarantee rather than a named computational result, so it cannot satisfy bit (a); additionally, the induced mass distribution requires explicit sequential-limit constraints beyond the displayed flow formulation.
fatal: True
The proposed mirror covers the weighted power-mean divisor rules and their WWEF1 guarantee, including Adams, Jefferson, Webster, Hill, and Dean; it leaves the paper's other fairness, monotonicity, quota, and MWNW results without a computational mirror.
On the rubric’s strict anchoring rule, this paper has no qualifying computational anchor. None of its numbered theorems, lemmas, corollaries, or propositions asserts NP-hardness, membership in P, FPT, W[1]-hardness, or an analyzed LP/MILP/SAT formulation. The paper proves fairness and monotonicity statements. Thus, strictly speaking, it cannot support a compliant ChoCo computational mirror.
If substantive named results are allowed as anchors, the strongest positive case is Theorem 4.6, proved in this paper. It states that every weighted power-mean divisor method satisfies WWEF1. Here, for \(p\in\mathbb{R}\) and \(\omega\in[0,1]\),
\[ f_{p,\omega}(t)= \begin{cases} \left(\omega t^p+(1-\omega)(t+1)^p\right)^{1/p}, & p\neq 0,\\ t^\omega(t+1)^{1-\omega}, & p=0, \end{cases} \]
with \(f_{p,\omega}(0)=0\) when \(p\le 0\). The associated picking sequence repeatedly gives the next item to an agent minimizing \(f_{p,\omega}(t_i)/w_i\). Corollary 4.7 consequently gives WWEF1 for Adams, Jefferson, Webster, Hill, and Dean.
My lead mirror would be:
Continuum Weighted-Power-Mean Picking and WWEF1. There are finitely many agent types \(T\), with population distribution \(\mu\), where a type \(t\) includes its entitlement \(w_t\) and additive values \(v_t(g)\) for finitely many item classes \(g\in G\). The regime is \(N\gg |T|,|G|\): for each large \(N\), there are \(N\mu_t\) agents of type \(t\) and \(Nq_g\) copies of item class \(g\), with \(\mu_t,q_g\) rational. This models many households, districts, or local allocation units sharing a small number of preference-and-entitlement types.
The action variable is an integral-bundle mass allocation \(x_{t,b}\), where \(b\in\mathbb{Z}_{\ge0}^{G}\) is the bundle received by one agent and \(x_{t,b}\) is the mass of type \(t\) receiving it. Thus
\[ \sum_b x_{t,b}=\mu_t, \qquad \sum_{t,b}b_gx_{t,b}=q_g. \]
Every unit of mass still receives an integral bundle; only type-level averages are fractional. The allocation must be obtainable as a limit of finite clone populations run under the paper’s \(f_{p,\omega}\)-divisor picking rule, with truthful highest-valued-item picking and fixed tie-breaking.
The continuous question is: given \((T,\mu,G,q,w,v,p,\omega)\), construct such an allocation, or decide whether one exists, and determine whether every positive-mass pair of bundles \(b,b'\) for types \(t,t'\) satisfies the continuum version of WWEF1: for some zero-or-one-item subbundle \(B\subseteq b'\),
\[ \frac{u_t(b)}{w_t}\ge \frac{u_t(b'-B)}{w_{t'}} \quad\text{or}\quad \frac{u_t(b+B)}{w_t}\ge \frac{u_t(b')}{w_{t'}}. \]
Here \(u_t(b)=\sum_g b_gv_t(g)\).
This is a genuine population mirror of the paper’s problem. The types are complete descriptions of agents, the number of agents is large relative to the type space, the objects remain indivisible for each agent, and the paper’s picking rule is preserved rather than replaced by an arbitrary fractional allocation. The natural expected direction is Class A: the divisor part becomes a fluid quota process, while the item assignment can be represented by a finite type-item flow or configuration formulation. Whether that formulation has polynomial-size separation is itself a worthwhile ChoCo question.
The main weakness is substantial. The paper’s theorem is about finite picking sequences, not computational complexity, and its proof does not establish an efficient algorithm for the continuous configuration problem. Also, the literal political-parties/ministry story has few agents and few items; the high-multiplicity scenario has to be a repeated allocation environment such as many local authorities or households. If one insists that an anchor must be a named complexity result, however, the correct conclusion is simply that this paper supplies none.
The negative case is decisive at ChoCo’s formal gate: this paper has no qualifying computational anchor. None of its numbered results gives a complexity classification, an algorithmic theorem, a reduction, an approximation guarantee, or an LP/separation formulation. Theorem 4.6 and Corollary 4.7 are fairness guarantees for an already specified picking rule. The remaining results are likewise characterizations, monotonicity statements, or counterexamples. Literature cited in the introduction does not repair that absence.
Even if Theorem 4.6 is admitted as a substantive anchor, the proposed mirror does not yet turn it into a computational problem. The variables \(x_{t,b}\) describe aggregate allocations, but they do not encode the temporal greedy process that generates those allocations. An arbitrary feasible configuration \(x\) need not be obtainable from a divisor picking sequence. Conversely, if “obtainable” is imposed as an additional constraint, the essential object is again a sequential schedule over individual picks; the displayed flow constraints alone do not capture it.
There is also a genuine population obstruction. If the paper’s finite item set is retained while the number of agents tends to infinity, at most \(|M|\) agents receive nonempty bundles, so the nonempty allocation has mass tending to zero. The continuum contains almost exclusively empty bundles, and the item-allocation problem disappears. Scaling the supply with population size is legitimate under the programme, but then one has introduced a repeated-goods market with item classes and per-capita supplies. That may be a sensible new model, but it is not supplied by Theorem 4.6 and requires a new analysis of high-multiplicity sequential allocation.
The proposed WWEF1 condition does not provide that missing analysis. If each finite clone population is run by the paper’s rule, the condition is inherited agent by agent; if a limit exists, the corresponding positive-mass bundle pairs inherit the finite inequalities under the usual bounded-support assumptions. Thus the continuous formulation has not identified a new fairness-computation problem. If instead one tests averaged bundles, then the objects are fractional outcomes and the one-item WWEF1 condition has been replaced by a different, outcome-space relaxation.
A stronger rescue—“compute the limiting bundle distribution of the divisor process”—could be worthwhile, but it would be a new high-multiplicity sequential-allocation problem, not a continuization of a computational result in this paper. Likewise, optimizing over fair type-mass allocations would discard the picking-sequence rule and become a separate fair-division/configuration problem. Neither can serve as the paper’s anchor.
So the honest negative verdict is strong under the programme’s stated standard: the paper offers no computational result to continuize, and the only proposed rescue either degenerates, omits the rule’s defining dynamics, or becomes a new project. I would not claim that no related high-multiplicity fair-division model could ever be interesting; the universal modelling claim is necessarily less airtight. But this paper does not support a worthwhile ChoCo continuous mirror as presented.
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.