Formalizes support-exclusion in constrained pricing and introduces target-aware controller with certified bands and regret-information accounting that identifies when polynomial target mass succeeds but 1/t branches fail without extra movement.
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
Gated Priority-based Greedy policies achieve competitive ratios for online multi-item order fulfillment in two-layer networks that match or nearly match lower bounds under time-varying and time-invariant costs.
citing papers explorer
-
Resource-Constrained Adaptive Inference for Sequential Pricing
Formalizes support-exclusion in constrained pricing and introduces target-aware controller with certified bands and regret-information accounting that identifies when polynomial target mass succeeds but 1/t branches fail without extra movement.
-
Optimal and Order-optimal Gated Priority-based Greedy Policies for Two-layer Multi-item Order Fulfillment
Gated Priority-based Greedy policies achieve competitive ratios for online multi-item order fulfillment in two-layer networks that match or nearly match lower bounds under time-varying and time-invariant costs.