Introduces asymmetric (b_t, s_t) price tuples for trading prophets and gives online algorithms achieving constant competitive ratios for unit capacity and 1 - Θ(log B0/√B0) for general capacity under i.i.d. arrivals.
Max-Min Greedy Matching , booktitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Polynomial samples learn dual pricing and polynomial queries learn near-optimal anonymous pricing for online resource allocation with heterogeneous agents.
citing papers explorer
-
Learning Anonymous Pricing for Online Resource Allocation
Polynomial samples learn dual pricing and polynomial queries learn near-optimal anonymous pricing for online resource allocation with heterogeneous agents.