AI Paper Atlas

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

A Multiarmed Bandit Based Incentive Mechanism for a Subset Selection of Customers for Demand Response in Smart Grids

Jain Shweta, Gujar Sujit

AAAI 2020 · 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
use the GLS local-search subset selection instead of brute-force optimal subsetGLS · simulation, 5000 random samples, C=3loss ratio vs optimal (average)No clear effect
use GLS instead of the brute-force optimum in the worst caseGLS · simulation, 5000 random samplesworst-case loss ratio vs optimalHurt
increase rounds t from 1 to 10^6GLS-MAB · simulation, n=15, 40 samplesexpected regret R_TImproved
increase number of agents n (up to 15 for R_T, up to 10 for R_G_T)GLS-MAB · simulationexpected regretHurt
measure regret against global optimum instead of GLS local optimumGLS-MAB · simulation, n up to 10expected regretNo 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