atlas

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

No-Regret Learning in Dynamic Competition with Reference Effects Under Logit Demand

NeurIPS 2023 · Bandits and online learning › Online convex optimization and games · approach: Fast no-regret dynamics in games

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 diminishing step-sizes satisfying the stated conditionsOPGA · Dynamic duopoly with MNL demand and reference effectsconvergence to SNEHelped
choose step-sizes η^t = Θ(1/t)OPGA · Dynamic duopoly with MNL demand and reference effectssquared price and reference-price error rate: O(1/t)Helped
use the over-large constant step-size η^t = 1 instead of diminishing step-sizes (ablation)OPGA · Example 2price and reference-price convergenceHurt
use diminishing step-sizes instead of the over-large constant step-size η^t = 1 (ablation)OPGA · Examples 1 and 2price and reference-price convergenceHelped
use OPGA rather than repeatedly applying the equilibrium pricing policyDynamic duopoly with reference effects · Example 3rate of reaching SNENo clear effect

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