AI Paper Atlas

Research map / Bandits and online learning / RL theory and MDPs

Learn to Match with No Regret: Reinforcement Learning in Markov Matching Markets

Yifei Min, Tianhao Wang, Ruitu Xu, Zhaoran Wang, Michael Jordan, Zhuoran Yang

NeurIPS 2022 · Bandits and online learning › RL theory and MDPs · approach: Regret bounds with function approximation · 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
Extend single-step MatchLinUCB to a sequential Markov setting with horizon HOptimistic RL matching algorithm with linear function approximation · Markov matching market, theoretical analysisagents' regret boundMixed
Use d^2-dimensional feature for matching utilities rather than d-dimensional featureProposed algorithm · Markov matching market, theoretical analysisd-dependence of regret boundNo clear effect
Bound planner's regret and agents' regret jointly by the sum of optimistic bonusesProposed algorithm · Markov matching market, theoretical analysistotal regretImproved

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