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.
Mark Keil and Anil Maheshwari and Saeed Mehrabi and Debajyoti Mondal and Michiel H
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
years
2026 5verdicts
UNVERDICTED 5representative citing papers
Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.
Witness Set for simple polygons is in NP ∩ XP and admits an n^{f(k)}-time algorithm via combinatorial discretization, in contrast to its ∃R-complete dual.
Constructs infinite 3⁺-parameterized-square-free ternary words and 3⁺-order-preserving-square-free binary words via morphic substitutions, plus reports longest finite ℓ⁺-square-free words under several equivalences.
Polynomial samples learn dual pricing and polynomial queries learn near-optimal anonymous pricing for online resource allocation with heterogeneous agents.
citing papers explorer
-
Asymmetric Trading Prophets
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.
-
The price of incrementality in k-center clustering
Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.