atlas

Research map / Bandits and online learning / Online convex optimization and games

Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions

NeurIPS 2017 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 3 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use DPDS, which discretizes feasible bids and optimizes empirical payoffs with dynamic programmingRepeated multi-commodity auctions · Repeated multi-commodity auctionsregret: O(\sqrt{T\log{T}}) upper bound; \Omega(\sqrt{T}) lower bound for any strategyHelped
Use DPDS instead of UCBID-GR, SA, and SVM-GRVirtual trading on New York market historical data · NYISO virtual trading, five consecutive yearscumulative profitMixed
Use DPDS instead of SASimulated auction with K=5 · Simulation, budgets 13.845, 17.018, 20.870, and 25.828regretHelped
Use DPDS instead of sliding-window forecastingSimulated auction with K=5 · Simulation, budgets 13.845, 17.018, 20.870, and 25.828regretHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy