pith. sign in

Title resolution pending

The optimizer bids𝜆 (𝑡) in round𝑡, as long as there is budget remaining

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.GT 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Learning vs. Optimizing Bidders in Budgeted Auctions

cs.GT · 2026-04-09 · unverdicted · novelty 7.0

Budget constraints in repeated auctions require the optimizer to switch among up to k+1 mixed strategies over time, and a proportional controller for the learner makes the optimizer's utility no higher than the budgeted Stackelberg equilibrium value.

citing papers explorer

Showing 1 of 1 citing paper.

  • Learning vs. Optimizing Bidders in Budgeted Auctions cs.GT · 2026-04-09 · unverdicted · none · ref 2

    Budget constraints in repeated auctions require the optimizer to switch among up to k+1 mixed strategies over time, and a proportional controller for the learner makes the optimizer's utility no higher than the budgeted Stackelberg equilibrium value.