AI Paper Atlas

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

Online Spatio-Temporal Matching in Stochastic and Dynamic Domains

AAAI 2016 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 23 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 two-stage stochastic matching with future demand samples instead of myopic greedy/one-step matchingtaxi matching · Dataset1 8:00 AMcompetitive ratio (revenue, requests): more than 85% of optimal revenue at 11 samplesHelped
use full TSS instead of Benders decomposition (3 iterations) (ablation)two-stage matching · Dataset1 8:00 AMrevenue: +5% revenue, +10% requestsHelped
use Benders decomposition instead of full TSS (ablation)two-stage matching · Dataset2solution qualityNo clear effect
use Benders decomposition instead of full TSS (ablation)two-stage matching · Dataset1 runtimeruntime: TSS up to 100 secondsHelped
increase number of taxis (reduce scarcity)TSS/BD vs myopic · Dataset1gain over myopicHurt

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