pith. sign in

Hartline, and Robert Kleinberg

4 Pith papers cite this work. Polarity classification is still indexing.

4 Pith papers citing it

fields

cs.GT 3 cs.DS 1

years

2026 4

verdicts

UNVERDICTED 4

clear filters

representative citing papers

Asymmetric Trading Prophets

cs.DS · 2026-07-01 · unverdicted · novelty 7.0

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.

Evaluating the Performance of Approximation Mechanisms under Budget Constraints

cs.GT · 2026-02-15 · unverdicted · novelty 7.0

Simple mechanisms achieve arbitrary approximation to optimal revenue for bounded-support distributions with private budgets but cannot guarantee any positive fraction of optimal revenue for unbounded supports or certain bounded distributions, even under independence.

citing papers explorer

Showing 4 of 4 citing papers after filters.

  • Asymmetric Trading Prophets cs.DS · 2026-07-01 · unverdicted · none · ref 99

    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.

  • Benchmark-Tight Approximation Ratio of Simple Mechanism for a Unit-Demand Buyer cs.GT · 2026-06-08 · unverdicted · none · ref 61

    Uniform-Ironed-Virtual-Value Item Pricing achieves a tight 3-approximation to the Duality Relaxation Benchmark in unit-demand single-buyer revenue maximization.

  • Evaluating the Performance of Approximation Mechanisms under Budget Constraints cs.GT · 2026-02-15 · unverdicted · none · ref 9

    Simple mechanisms achieve arbitrary approximation to optimal revenue for bounded-support distributions with private budgets but cannot guarantee any positive fraction of optimal revenue for unbounded supports or certain bounded distributions, even under independence.

  • Learning Anonymous Pricing for Online Resource Allocation cs.GT · 2026-06-25 · unverdicted · none · ref 102

    Polynomial samples learn dual pricing and polynomial queries learn near-optimal anonymous pricing for online resource allocation with heterogeneous agents.