| paper | d4-conf-atal-2013-0150 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
other→P discrete result → its continuous mirror
Answer: $C(S,\kappa,T)=1$ whenever some supported type accepts a slot. If every acceptable neighborhood is empty, the defining infimum has an empty domain and equals $+\infty$ under the extended-real convention. · discrete side: other · adjudication: proved
full proof & adversarial review →
Proposition 10
statement extracted from the paper’s text layer
Given a finite two-goal interval geometry \(S\), per-capita slot capacities \(\kappa_s\), and a fixed support of at most \(\tau\) uniform-value MAXDISTANCE types \(\theta=(g,r)\) arriving in two successive nonatomic cohorts with rational masses, what is \(\sup_{\pi}\inf_{\mu}\mathrm{SW}(\pi,\mu)/\mathrm{OPT}_{\mathrm{frac}}(\mu)\)? Here \(\pi\) is a causal posted-price policy that knows the geometry and capacities but not future cohort masses; each infinitesimal arrival chooses an available slot maximizing \(\phi\mathbf{1}[d(g,s)\le r]-p_s\), with fixed tie-breaking; and \(\mathrm{OPT}_{\mathrm{frac}}\) is the offline maximum-welfare mass matching.
Use a fixed finite base interval of slot locations \(S\), scaled to capacities \(q\kappa_s\), and scale fixed-support MAXDISTANCE arrival masses by \(q\). A causal posted-price policy induces assignment masses \(x_{\ell,\theta,s}\), with welfare \(\sum_{\ell,\theta,s}x_{\ell,\theta,s}\phi\mathbf{1}[d(g,s)\le r]\), compared with the offline fractional matching optimum.
Feng and Niazadeh’s two-stage fractional matching result gives a \(3/4\) ratio in a broader online matching model, so the general barrier may add little; it does not settle the posted-price, two-goal parking setting.
fatal: False
The mirrors cover Proposition 10’s unknown-population MAXDISTANCE bound and Theorem 18’s layered competitive guarantee. They leave the known-population optimal mechanisms and the LINEARCOST/GSP result unmirrored.
I’d make a qualified yes, with Proposition 10 as the lead. The paper studies online matching with posted prices; its population is still a finite set of drivers. A continuous mirror would replace repeated drivers by mass while retaining the same goals, walking limits, online arrivals, prices, and welfare objective.
For the mirror, let \(\theta=(g,r,\phi)\) describe a driver’s goal, maximum acceptable distance, and value for a usable space. A society has rational masses \(\mu_{\ell,\theta}\) across a fixed number \(K\) of arrival waves \(\ell\), with fixed support size \(\tau\). Parking locations have per-capita capacities \(\kappa_s\). Scaling the population by \(q\) gives \(q\mu_{\ell,\theta}\) drivers and \(q\kappa_s\) spaces; \(q\) grows while \(K\) and \(\tau\) stay fixed. Each arriving mass chooses available spaces maximizing
\[
u_\theta(s)=\phi\,\mathbf{1}[d(g,s)\le r]-p(s),
\]
or takes the default option. Let \(x_{\ell,\theta,s}\) be the mass assigned from type \((\ell,\theta)\) to location \(s\); welfare is \(\sum_{\ell,\theta,s}x_{\ell,\theta,s}\phi\,\mathbf{1}[d(g,s)\le r]\). The benchmark is the maximum welfare of the offline mass matching. The question is to determine the best worst-case welfare ratio of an online posted-price policy when it sees the geometry and past outcomes but not the future arrival masses. Fractions here describe aggregate assignments: each actual driver still gets one space.
This is a plausible high-multiplicity regime: a large commuting population, a few office or district goals, and a limited set of walking tolerances and values. Fixed rush-hour waves can contain many drivers of each type. For near-duplicate spaces—such as many spaces around each exit or along a fixed road network—the number of drivers can grow much faster than the number of distinct types. The authors should recognize this as their problem: the same MAXDISTANCE preferences, online allocation, posted prices, and social-welfare objective remain. Per-capita supply and type-level fractional assignment are co-modifications needed to describe the large-population limit, not a shift to continuity of outcomes.
Lead mirror — Fluid Two-Goal Interval Parking. Given two goals at the ends of an interval, rational arrival masses over finitely many MAXDISTANCE types, and per-capita space supply along the interval, determine the optimal worst-case competitive ratio of an online posted-price mechanism when the population is unknown.
The anchor is Proposition 10, proved in this paper. It says that under uniform values every online algorithm has worst-case approximation ratio at most \(3/4\), even on an interval; if uniform values are dropped, the upper bound is at most \(1/2\). The \(3/4\) witness has the fluid form directly: a first wave of mass \(1/2\) can use either half of the interval, followed by a mass-\(1/2\) wave that can use only one half or the other. If the first wave leaves masses \(r_1,r_2\) in those halves, then \(r_1+r_2=1/2\). One of the two continuations leaves at most \(1/4\) of capacity in its half, so at most \(3/4\) total mass is matched. This is the same adversarial uncertainty as in the paper, scaled up with fixed support. I expect the approximation barrier to transfer: it is an explicit rational fluid instance, not a phenomenon requiring many distinct individuals. Further questions include whether \(3/4\) is tight for posted prices in the fluid model, and how the optimum depends on the ratio between goal values.
Second mirror — Fluid Layered Parking. Given a space structure partitioned into \(\beta\) equivalent layers—each with the same capacity profile at every goal and distance threshold—and uniform-value MAXDISTANCE types arriving online, determine the optimal worst-case ratio of a posted-price policy. In particular, does the paper’s layer-priority pricing guarantee survive as the supply and population scale together?
The anchor is Theorem 18, proved in this paper. For \(\beta\)-layered instances with uniform values, \(\beta\gg1\), and optimal allocation size \(\mathrm{opt}\gg\beta^2\), the deterministic LAYERS mechanism has worst-case approximation ratio \(0.682\). It prices layer \(j\) at \(j\phi/(\beta+1)\), where \(\phi\) is the common value. Exact copies of a capacity profile across layers give a natural fluid subclass; scaling the mass makes the theorem’s large-instance condition meaningful. I expect a tractable algorithmic result here: the mechanism is already a simple candidate for a fluid guarantee. The exact best ratio, and whether fractional assignment improves on \(0.682\), are further questions.
These mirrors cover the paper’s MAXDISTANCE online results, not its LINEARCOST/GSP-auction result. They continuize the population while keeping matching and online choice central; they do not treat fractional outcomes as the contribution. The paper’s known-population assumption already describes finite counts by preference, which supports the high-multiplicity interpretation, but those counts remain integral. The online-matching results of Karp, Vazirani, and Vazirani are also discrete background, not a collision with a continuous-population question.
The weakest point is that these are competitive-ratio questions, not the paper’s NP-hardness or polynomial-time classifications: Proposition 10 gives an approximation barrier, and Theorem 18 a guarantee. The arrival order is also essential. I have kept it as a fixed number of waves and continuized only the mass in each wave; if the authors reject that cohort model, the case weakens. That said, repeated commuter cohorts with the same goals and walking limits are a credible regime, and Proposition 10’s barrier is especially robust because its witness already consists of just two large cohorts.
I can’t make a strong case against these mirrors. The best objection is about incremental value, not whether the questions are meaningful.
Proposition 10 survives its fluid version. Its two-witness argument depends on how much of the first flexible cohort the policy places on each side, not on voters or drivers being individually countable. Scaling the cohort and capacity together preserves the \(3/4\) bound. A stronger version can keep sequential arrivals and hidden future demand while representing arrivals as flows of a fixed set of driver types. That is a sensible commuter model, and it retains the paper’s online decision problem.
There is nearby work on adversarial, multi-stage fractional matching: it gives the optimal ratio \(1-(1-1/K)^K\) for \(K\) arrival batches, which is \(3/4\) for two batches. That makes a two-wave fluid mirror less novel as an online matching question, but it is not a collision with this paper’s posted-price and parking-structure problem, and it does not make the mirror ill-posed. [Feng and Niazadeh, *Batching and Optimal Multi-stage Bipartite Allocations*](https://knowledge.uchicago.edu/records/wftm9-vvt50)
Theorem 18 also survives. Take repeated copies of the same layer capacity profile, scale the drivers and spaces together, and keep \(\beta\) fixed. Then \(\mathrm{opt}\gg\beta^2\) holds at sufficient scale, while layer-priority prices still define a meaningful policy. Parking lots with many equivalent spaces are a plausible setting for this. Calling fractional mass assignment an outcome-space change would miss the point: the population is the object being scaled, and the paper’s welfare objective remains.
The narrowest negative point is that both anchors concern worst-case competitive ratios, rather than complexity classifications for a fixed high-multiplicity instance. Their online uncertainty also means the resulting analysis may not use the continuous optimization tools that motivate ChoCo. But approximation algorithms are within the programme’s stated scope, and the unknown future arrival masses do not prevent a finite-type fluid model. Neither point defeats the better versions of the mirrors.
So the honest negative case is weak. The paper has named algorithmic results, and large repeated commuter populations make its high-multiplicity regime credible. These anchors do not support the claim that there is no worthwhile 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.