pith. sign in

Title resolution pending

Robustness:cost(LA-GPA(λ))≤(1 + (1−λ)2 4λ )·cost(OPT) +O( P i∈[n](bi +c i))

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.AI 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Online Allocation with Unknown Shared Supply

cs.AI · 2026-05-08 · unverdicted · novelty 7.0

Introduces the OSSA problem and a GPA policy achieving 4/3-approximation for online allocation of unknown shared supply under fixed costs and lost sales, with matching lower bounds and a forecast-robust extension.

citing papers explorer

Showing 1 of 1 citing paper.

  • Online Allocation with Unknown Shared Supply cs.AI · 2026-05-08 · unverdicted · none · ref 10

    Introduces the OSSA problem and a GPA policy achieving 4/3-approximation for online allocation of unknown shared supply under fixed costs and lost sales, with matching lower bounds and a forecast-robust extension.