AI Paper Atlas

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

Learning to Play Sequential Games versus Unknown Opponents

NeurIPS 2020 · Bandits and online learning › Online convex optimization and games · approach: Last-iterate convergence in games · 4 citations (OpenAlex)

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 StackelUCB with kernel-based response modeling and optimistic rewardsTraffic routing on the Sioux-Falls network · Traffic routingregretHelped
Use StackelUCB instead of routing all units via the shortest route or routing no unitsTraffic routing on the Sioux-Falls network · Traffic routingcumulative rewardHelped
Choose alternative routes based on users' demands using StackelUCBTraffic routing on the Sioux-Falls network · Traffic routingaverage congestionHelped
Learn the opponent's response function and exploit the bilevel reward structureWildlife patrol strategy · Wildlife conservationrewardHelped
Model the poacher response and optimize the bilevel reward rather than learning the overall objective directly (ablation)StackelUCB versus GP-UCB · Wildlife conservationconvergence to optimal strategy: ∼60Helped
Use StackelUCB instead of the full-information Hedge algorithmTraffic routing on the Sioux-Falls network · Traffic routingregretNo 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