AI Paper Atlas

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

Product Ranking for Revenue Maximization with Multiple Purchases

Renzhe Xu, Xingxuan Zhang, Bo Li, Yafeng Zhang, xiaolong chen, Peng Cui

NeurIPS 2022 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 1 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 MPB-UCB multiple-purchase model instead of Single Purchase baselineMPB-UCB · synthetic dataregretImproved
use MPB-UCB instead of Keep Viewing baselineMPB-UCB · synthetic dataregretImproved
use UCB-style exploration instead of explore-then-exploitMPB-UCB · synthetic dataregretImproved
rank products during exploration (Explore Then Exploit B vs A)Explore Then Exploit · synthetic dataregretImproved
use MPB-UCB on Taobao semi-synthetic dataMPB-UCB · Taobao ad dataregretImproved
Keep Viewing vs Single Purchase when estimated s is large (s = 0.907)Keep Viewing · Taobao ad dataregretImproved
use MPB-UCB on average revenue and revenue ratio metricsMPB-UCB · synthetic and Taobao dataaverage revenue / revenue ratioImproved

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