AI Paper Atlas

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

Double Auctions with Two-sided Bandit Feedback

Soumya Basu, Abishek Sankararaman

NeurIPS 2023 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 2 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 UCB for buyers and LCB for sellers in the average-mechanism double auctionbuyers and sellers with unknown valuations · synthetic 8x8 system, K*=5number of matches K(t): converges to 5Improved
use UCB for buyers and LCB for sellersdouble auction · synthetic 8x8 systemprice difference p(t)-p*: converges to 0Improved
use UCB for buyers and LCB for sellersdouble auction · synthetic, T=50k, 100 pathssocial regretImproved
use optimism on both sides (OFUL) in two-sided uncertaintydouble auction learners · theoryinformation flowHurt

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