← Back to all news
arXiv Machine Learning October 8, 2026 By Maria Elena Vischi, Francesco Emanuele Stradi, Alberto Marchesi

Optimal Regret for Online Market Making with Limit Order Book

Read the original on arXiv Machine Learning →

The Flow has not summarised this story yet — read it at arXiv Machine Learning.

  • safety

One email a morning, machine-written

One email a day, machine-written, one click to leave. We never share your address.

Related stories

arXiv Machine Learning
Jul 21

Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond

arXiv:2503. 01701v2 Announce Type: replace-cross Abstract: Most microeconomic models of interest involve optimizing a piecewise linear function.

By Francesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti
agents
More like this →
arXiv Machine Learning
Jul 1

A Complete Characterization of Learnability for Adversarial Noisy Bandits

arXiv:2605. 09200v2 Announce Type: replace Abstract: We study adversarial noisy bandits given a known function class $\mathcal{F}$.

By Steve Hanneke, Kun Wang
reinforcement-learningsafety
More like this →
arXiv Machine Learning
Aug 11

Regret, equilibrium, and learning in games: A guided tour

arXiv:2608. 09389v1 Announce Type: cross Abstract: This note aims to serve as an entry point to the literature on learning in games, a topic with significant theoretical appeal and a wide range of applications -- from machine learning and data science to economics and beyond.

By Panayotis Mertikopoulos
agentsreinforcement-learningsafety
More like this →
arXiv Machine Learning
Sep 15

Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary

arXiv:2609.13547v1 Announce Type: new Abstract: We study switching regret in adversarial multi-armed bandits, where the learner competes with an arm sequence that changes at most $S$ times. When $S$...

By Mengxiao Zhang
safety
More like this →
arXiv Machine Learning
Jul 28

Nearly Tight Bounds for Cross-Learning Contextual Bandits with Graphical Feedback

arXiv:2502. 04678v2 Announce Type: replace Abstract: Repeated first-price auctions are contextual decision problems with censored but reusable feedback: after submitting a bid, a learner can infer the outcomes of related bids and evaluate them under different private values.

By Ruiyuan Huang, Zengfeng Huang
reinforcement-learningsafety
More like this →
arXiv AI
Jul 15

Learning When to Trust in Contextual Social Bandits

arXiv:2603. 13356v2 Announce Type: replace Abstract: Robust reinforcement learning typically assumes that feedback sources are either globally trustworthy or corrupted within a fixed global budget.

By Majid Ghasemi, Mark Crowley
reinforcement-learningsafety
More like this →
About Pricing API Newsletter Sources Privacy Terms Refunds Accessibility Provider info Contact RSS

The Flow links to publishers and never republishes their articles. Summaries are machine-generated.

v1.1.0 · 5f852ea