AI Paper Atlas

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

Online Pricing with Strategic and Patient Buyers

Michal Feldman, Tomer Koren, Roi Livni, Yishay Mansour, Aviv Zohar

NeurIPS 2016 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions

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
Restrict seller to changing posted price only O(T^{2/3}) times via epochs with EXP3 chosen price per epochposted-price online pricing with patient buyers · adversarial buyers, regret vs best fixed priceregretImproved
Patience increased from zero to one (windows of size >1 allowed)posted-price pricing regret rate · adversarial buyers with two pricesoptimal regret rateHurt
Running standard EXP3 directly on posted prices with patient buyersnaive bandit pricing · buyers with window size tworevenueHurt

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