d4-journals-jair-2023-0006

· ? (d4-journals-jair-2023-0006)

mirror foundnew result: P → P — proved & adversarially reviewed →
paperd4-journals-jair-2023-0006
authors—
venue?
filed underunclassified
judged bygpt-6-luna / xhigh (triple__luna__xhigh__c6r1)
judge confidencehigh
authors would recognise ityes

The new result

P→P discrete result → its continuous mirror

Answer: \(\text{Polynomial-time solvable for every fixed }d\) · discrete side: polynomial · adjudication: proved

full proof & adversarial review →

The anchor — algorithmic

Theorem 3

PDF text-layer excerpt — equations and symbol order may be approximateSuppose the instance is negative and that agents have linear utility functions for bads and SPLC utility functions for goods. If the number of bads is constant, then we can compute all CE in polynomial time, i.e., for each CE we obtain one with the same utility profile.

statement extracted from the paper’s text layer

Every anchor argued

The continuous mirror question

Given a finite set of complete types \(T\) with rational masses \(\mu_t>0\), \(\sum_{t\in T}\mu_t=1\), rational per-type budgets \(e_t<0\), and SPLC utilities for goods plus linear disutilities for a fixed number \(d\) of chores, compute competitive equilibria for a negative instance. Each type receives a per-person bundle \(x_t\); item \(j\) has rational supply \(q_j\) per unit of population mass, so market clearing requires \(\sum_{t\in T}\mu_t x_{tj}=q_j\). Find supporting prices and type bundles that maximize each type’s utility subject to its budget, fully spend budgets, and return one equilibrium for each distinct vector of type utilities.

The model it lives in

A finite-support society \((T,\mu)\) of complete utility-and-budget types, with per-capita item supplies \(q_j\), type-level per-person bundles \(x_t\), and common prices \(p_j\). The objective is to compute supporting prices and bundles satisfying individual utility maximization, budget spending, and mass-weighted market clearing, with a fixed number of chores and the negative-instance restriction.

What the mirror covers

Covers Theorem 3’s polynomial-time result for negative instances with a fixed number of linear-utility chores; leaves Theorem 2, Corollary 2, and other market regimes untouched.

Open questions for a prover

The case FOR (proponent)

The strongest mirror is the paper’s Theorem 3, proved in this paper. It says that in a negative mixed-manna instance, if agents have SPLC utilities for goods and linear utilities for bads, then with a constant number of bads one can compute all competitive equilibria in polynomial time. Here “all” means that for each equilibrium utility profile, the algorithm returns an equilibrium with that same profile. The result allows arbitrarily many agents and goods.

I would turn that into a type-based competitive-equilibrium problem with bounded chores. The population is a distribution \(\mu\) over \(\tau\) types, where \(\mu_t\) is the fraction of the population of type \(t\), and \(\sum_t\mu_t=1\). A type fully specifies its SPLC utility functions for every good, its linear disutility for every chore, and its per-person budget. There are \(m\) item categories, including a fixed number \(d\) of chores, with \(d\) constant. Give each category a rational supply \(q_j\) per unit of population mass. The masses, supplies, budgets, and utility data are binary rationals.

A type receives a per-person bundle \(x_t\), and the market has prices \(p_j\). A type’s bundle must maximize its utility subject to its budget at those prices; the market must clear, so \(\sum_t\mu_t x_{tj}=q_j\) for every item \(j\); and budgets must be fully spent, as in the paper’s equilibrium definition. Restrict to negative instances, with negative budgets \(e_t<0\), linear disutility for chores, and SPLC utility for goods. A solution is a supporting price vector and type-level bundles, with one equilibrium returned for each distinct vector of type utilities.

This is a population model, not a claim that divisible outcomes make the paper continuous already. The items are divisible in the paper; the new continuous object is the distribution of people. A plausible regime is a large workforce or municipality with many participants but relatively few complete preference-and-budget types. People in each type share the same preferences and entitlement, while the number of distinct types \(\tau\) is much smaller than the population. The chores could be recurring work categories and the goods could be divisible benefits or resources. Negative budgets can represent participants who are net recipients of compensation for taking on chores.

Per-capita supplies are part of this mirror. In a finite population of \(n\) people, the corresponding market has \(nq_j\) units of item \(j\); dividing the clearing equations by \(n\) gives the type-mass constraints above. This scaling makes the market a plausible growing-population regime. It also keeps the paper’s problem recognizable: it remains competitive-equilibrium computation with mixed manna, the same utility restrictions, and the same chore-count parameter.

I expect this problem to be tractable for fixed \(d\). Theorem 3’s algorithm enumerates price and utility-per-buck configurations whose number is polynomial when the number of bads is constant, then checks equilibrium feasibility. In the type model, comparisons are between types, so the natural count is \(\tau\), not the number of people. Masses enter the market-clearing feasibility constraints as rational coefficients. That suggests a running time polynomial in \(\tau\), \(m\), the number of utility segments, and the input bit length, for fixed \(d\). Aggregating identical agents is exact here: their preferences and budgets agree by definition, and their allocations can be averaged while preserving equilibrium utilities.

The paper’s other named results could support narrower mirrors, but I would not add them as anchors: Theorem 3 is the clearest match to a large population with few recurring chore categories. Nor would I use the PPAD-hardness entries in Table 1 as anchors; they are cited prior results, not numbered results proved here.

The mirror covers Theorem 3’s negative-instance result, not the paper’s full set of equilibrium results. It raises natural next questions: does the same type-level tractability extend to SPLC chore utilities, which the paper identifies as open? Can the dependence on \(d\) be made fixed-parameter tractable, or does hardness emerge when the number of chores grows?

My weakest point is the supply scaling. If the intended regime holds total supplies fixed while the population grows, per-person supplies shrink, and that may not represent the market the authors had in mind. I think the growing-workforce interpretation is still credible, and the programme explicitly allows per-capita supplies to scale with population. Since the paper’s agents are discrete individuals, the type-mass algorithm would also need to be established; Theorem 3 motivates that question but does not itself prove its continuous version.

The case AGAINST (opponent, writing after the proponent)

I cannot make a persuasive case against the Theorem 3 anchor. Its strongest mirror is a finite-support society over complete types: each type has the same SPLC utilities, negative budget, and per-person bundle; fixed chore categories have per-capita supplies; and market clearing is \(\sum_t \mu_t x_{tj}=q_j\). This keeps the paper’s competitive-equilibrium computation problem and asks what happens when population counts are represented by masses.

The best objection is that exact repeated utility and budget data may be a narrow regime, and a chore-dominated market with negative budgets may be a specialized setting. But that does not rule out a credible scenario: for example, a large municipal workforce with standardized contract classes, shared benefits, and a fixed menu of divisible duties. The paper’s own output is utility profiles, so it does not need to preserve individual identities. For agents of the same type, averaging their equilibrium bundles preserves optimality under concave utilities and preserves weighted market clearing.

The type-weighted version appears to retain the structure of Theorem 3’s proof: its price comparisons range over types, while masses enter the equilibrium feasibility constraints. That may make the mirror comparatively close to the paper’s algorithm, but the programme’s rules do not make an easy or unchanged answer a reason to reject a well-posed question. The honest negative case is weak here; this anchor survives.

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.