AI Paper Atlas

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

A Study of Compact Reserve Pricing Languages

MohammadHossein Bateni, Hossein Esfandiary, Vahab Mirrokni, Saeed Seddighin

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

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 multiplicative reserve prices (iterative algorithm) instead of per-impression unrestricted reservesreserve pricing on AdX data · AdX bids, 18 data setsrevenue vs unrestricted optimum: 94%Improved
use a single uniform reserve price instead of the iterative multiplicative algorithmreserve pricing on AdX data · AdX bids, 18 data setsaverage revenue loss: 40%Hurt
compare practical revenue loss to theoretical O(log R) bounditerative algorithm · AdX bidsrevenue lossImproved

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