Online min-cost matching with general arrivals has unbounded competitive ratio in adversarial and random-order models but admits an O(log² n)-competitive algorithm in the unknown i.i.d. model.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Develops generator-agnostic audits for combinatorial uniformity on the hypersimplex using marginal chi-square, pair maxima, serial overlap, anchored-box discrepancy and low-dimensional geometry, with a finite-witness guarantee.
citing papers explorer
-
Online Min-Cost Matching with General Arrivals
Online min-cost matching with general arrivals has unbounded competitive ratio in adversarial and random-order models but admits an O(log² n)-competitive algorithm in the unknown i.i.d. model.
-
Auditing Combinatorial Randomness from Finite Transcripts
Develops generator-agnostic audits for combinatorial uniformity on the hypersimplex using marginal chi-square, pair maxima, serial overlap, anchored-box discrepancy and low-dimensional geometry, with a finite-witness guarantee.