atlas

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

Online Second Price Auction with Semi-Bandit Feedback under the Non-Stationary Setting

AAAI 2020 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 9 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 Elim-NS with adaptive elimination and randomized exploration to set reserve pricesOnline second-price auction · Non-stationary switching distributionsnon-stationary regret: \tilde\mathcal{O}(\sqrt{\mathcal{S} T})Helped
Use Elim-NS with adaptive elimination and randomized exploration to set reserve pricesOnline second-price auction · Non-stationary distributions measured by total variationnon-stationary regret: \tilde\mathcal{O}(\bar\mathcal{V}^{\frac{1}{3}}T^{\frac{2}{3}})Helped
Use Elim-NS without advance knowledge of the number of switches or total variationOnline second-price auction · Non-stationary environmentnon-stationary regretHelped

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