arXiv Machine Learning
Regret Bounds for Market Making with Persistent Orders
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
Hugging Face Trending Papers
2d ago
Regret Bounds for Market Making with Persistent Orders
We study adversarial market making with orders that remain active until execution. The maker operates on two markets: a primary market where orders are made and a secondary market where the resulting...
arXiv Machine Learning
Oct 8
Optimal Regret for Online Market Making with Limit Order Book
arXiv:2610.09691v1 Announce Type: cross Abstract: We study online learning in market making, where, at each round, a market maker posts bid and ask prices before observing the market price and the pr...
arXiv Machine Learning
Aug 24
Adaptive Inference for Resource-Constrained Dynamic Pricing
arXiv:2606. 03736v2 Announce Type: replace-cross Abstract: We study resource-constrained dynamic pricing when the seller seeks revenue and valid inference about demand at a price fixed before the selling season.
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$...
arXiv Machine Learning
Jul 3
Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy
arXiv:2607. 02196v1 Announce Type: new Abstract: We study online resource allocation when both rewards and consumption sizes may be continuously distributed.
arXiv Machine Learning
Oct 9
Toward Optimal Regret in Adversarial MDPs with Stochastic Hard Constraints
arXiv:2610. 12153v1 Announce Type: new Abstract: We study episodic constrained Markov decision processes with adversarial losses under stochastic hard constraints.