| paper | d4-conf-sagt-2015-0015 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
NP-hard→NP-hard discrete result → its continuous mirror
Answer: \(\mathrm{NP}\)-hard, even for \(\tau=1\) with strictly positive dyadic prices, values, and supplies. · discrete side: hardness · adjudication: proved
full proof & adversarial review →
Theorem 9
statement extracted from the paper’s text layer
Given goods \(G=[m]\), finitely many additive types \(T\) with rational masses \(\mu_t\ge 0\) summing to \(1\), values \(v_{tj}\), per-capita supplies \(q_j\), and fixed nonnegative rational prices \(p_j\), does there exist a mass allocation \(y_{t,S}\ge 0\) over integral bundles \(S\subseteq G\) such that \(\sum_{S\subseteq G}y_{t,S}=\mu_t\) for each \(t\); every bundle with \(y_{t,S}>0\) spends exactly the unit budget and maximizes \(\sum_{j\in S}v_{tj}\) among bundles with price at most \(1\); and total use of each good is at most \(q_j\), with equality whenever \(p_j>0\)?
A fixed-price CEEI feasibility problem for a continuum of buyers distributed over additive types: each buyer receives an integral bundle, \(y_{t,S}\) records the mass of type \(t\) receiving \(S\), and supplies scale with population. The question is whether such a mass allocation exists; prices are inputs.
The mirror covers Theorem 9's additive-valuation, fixed-price allocation-support problem. It leaves the paper's other results, including equilibrium computation with endogenous prices, outside its scope.
I would anchor the case on Theorem 9, proved in this paper. It says: given a market with indivisible goods, additive valuations, and a fixed price vector \(p\), it is coNP-hard to decide whether there is an allocation \(x\) such that \((x,p)\) is a competitive equilibrium from equal incomes. The authors note that Aziz had also studied this question, but they give their own proof by reduction from PARTITION.
A natural high-multiplicity setting is course assignment with two large cohorts of students who share the same valuation within each cohort. Course seats scale with enrollment, while each student’s bundle remains integral: a student either gets a seat in a course or does not. If the population has \(N\) students, take \(N/2\) of each type and \(N/2\) seats in each course category. Thus \(N\) grows while the number of distinct types stays at \(\tau=2\). The type records the student’s full valuation vector and equal budget. This is a population mirror: the allocation of seats to each individual stays discrete, while the allocation to a type is a mass distribution over bundles.
Here is the problem I would hand to a prover. Call it Fixed-Price CEEI Support for Continuous Additive Types. An instance has goods \(G=[m]\), types \(T\) with rational masses \(\mu_t\) summing to \(1\), additive values \(v_{tj}\), per-capita supplies \(q_j\), and a fixed nonnegative rational price vector \(p\). Every infinitesimal agent has budget \(1\) and must receive an integral bundle \(S\subseteq G\), with utility \(u_t(S)=\sum_{j\in S}v_{tj}\). The decision variable is \(y_{t,S}\), the mass of type \(t\) assigned bundle \(S\). The question is whether there is a \(y\) such that \(\sum_S y_{t,S}=\mu_t\); each assigned bundle spends exactly \(1\) and maximizes its type’s utility among bundles affordable at \(p\); and \(\sum_{t,S:j\in S}y_{t,S}\le q_j\), with equality whenever \(p_j>0\). The solution is the allocation measure \(y\); prices are inputs, just as in Theorem 9. All input numbers are binary rationals.
The paper’s PARTITION reduction carries over with only two types. Given positive integers \(s_1,\ldots,s_m\) summing to \(2V\), use ordinary goods \(1,\ldots,m\) and two special goods \(a,b\). Let both types have mass \(1/2\), and set every good’s per-capita supply to \(1/2\). Prices are \(p_j=s_j/(2V)\) for ordinary goods and \(p_a=p_b=1/2\). Type \(A\) values ordinary good \(j\) at \(s_j\), and values \(a,b\) at \(3V,V-1\); type \(B\) values each ordinary good at \(1\) and the special goods at \(0\).
The candidate allocation gives all type \(A\) mass bundle \(\{a,b\}\) and all type \(B\) mass bundle \([m]\). Each spends \(1\), and all supply clears. Type \(B\) can afford all ordinary goods, which is its unique utility-maximizing bundle. Type \(A\)’s assigned utility is \(4V-1\); the reduction’s case analysis shows it has a strictly better affordable bundle exactly when some subset of the \(s_j\) sums to \(V\). If such a subset exists, no other equilibrium allocation can avoid the problem: type \(B\)’s best response uses all ordinary supply, leaving type \(A\) with the special goods and the same profitable deviation. If no such subset exists, the displayed allocation is an equilibrium. So the continuous instance has an equilibrium exactly when the PARTITION instance has no solution. The mass allocation does not dissolve the reduction: type \(B\)’s strict demand pins down the allocation, and type \(A\)’s individual best-response test retains the subset-sum constraint.
I therefore expect this mirror to be Class B: coNP-hardness transfers, with the hard combinatorics in the goods and valuation agenda \(m\), not in the number of agents. In fact, the reduction has constant support size \(\tau=2\). Further questions include whether the continuous problem is coNP-complete under this encoding, and which restrictions on values or prices make it tractable.
The scope is deliberately narrow: it mirrors Theorem 9’s fixed-price allocation-support problem, not the paper’s general question of whether some prices and allocation form an equilibrium. The weak point is the supply co-modification. The paper starts with one copy of each good; this mirror scales each good category’s supply with the population and caps each person at one unit of that category. That is allowed by the continuization programme, and course seats make it a plausible regime, but a referee could still ask whether the multi-seat categories change the authors’ problem too much. The individual bundles remain integral, and the equal-income price-support question remains the same.
I cannot make an honest case that defeats the proponent’s anchor, Theorem 9. It is a named computational result, and its fixed-price allocation question has a credible continuous-population version with only two types.
The proposed reduction checks out. Give types \(A\) and \(B\) mass \(1/2\) each, and each good supply \(1/2\). Type \(A\) values the special goods \(a,b\) at \(3V,V-1\) and ordinary good \(j\) at \(s_j\); type \(B\) values each ordinary good at \(1\) and the special goods at \(0\). Set \(p_j=s_j/(2V)\) and \(p_a=p_b=1/2\). Assign \(A\) to \(\{a,b\}\) and \(B\) to all ordinary goods. Both types spend their unit budgets and all supply clears. Type \(B\)’s bundle is its unique utility-maximizing affordable bundle, so it uses all ordinary supply. That leaves \(A\) the special goods. If some subset of the \(s_j\) sums to \(V\), \(A\) can replace \(b\) with that subset: the deviation costs \(1\) and raises utility from \(4V-1\) to \(4V\). If no such subset exists, the assigned bundle is optimal for \(A\). Thus the continuous instance has an equilibrium exactly when the PARTITION instance has no solution.
This is not an artifact of allowing fractional bundles: each individual still receives an integral bundle, while only the mass of a type assigned to each bundle can be fractional. For even finite populations, take half the agents of each type and \(N/2\) units of each good category. The proposed allocation then has an exact finite replication. Scaling supplies with population is an allowed co-modification in the programme, and the two-cohort course-assignment story is plausible.
The strongest remaining objection is about scope: this mirrors fixed-price equilibrium support, not the broader task of finding prices and an allocation. The reduction is also tailored to preserve a subset-sum obstruction. Neither point defeats the anchor: one mirror is enough, and identifying whether that obstruction survives aggregation is a computational question the programme is meant to ask. The negative case here is weak; the proposed mirror appears worthwhile.
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.