Cover Image

Trading Volume Maximization with Online Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cesari, Tommaso, Colomboni, Roberto
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory Machine Learning Computational Finance
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Parametric Contextual Online Learning Theory of Brokerage
by: Bachoc, François, et al.
Published: (2024)

Fair Online Bilateral Trade
by: Bachoc, François, et al.
Published: (2024)

A Tight Regret Analysis of Non-Parametric Repeated Contextual Brokerage
by: Bachoc, François, et al.
Published: (2025)

Online Budget Allocation with Censored Semi-Bandit Feedback
by: Bachoc, François, et al.
Published: (2025)

Repeated Bilateral Trade Against a Smoothed Adversary
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)

Market Making without Regret
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)

Algorithmic Aspects of Strategic Trading
by: Kearns, Michael, et al.
Published: (2025)

Large-Scale Contextual Market Equilibrium Computation through Deep Learning
by: Ma, Yunxuan, et al.
Published: (2024)

Contextual Online Bilateral Trade
by: Cosson, Romain, et al.
Published: (2026)

Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade
by: Di Gregorio, Simone, et al.
Published: (2025)

Profit Maximization in Bilateral Trade against a Smooth Adversary
by: Di Gregorio, Simone, et al.
Published: (2026)

AI Driven Near Real-time Locational Marginal Pricing Method: A Feasibility and Robustness Study
by: Jami, Naga Venkata Sai Jitin, et al.
Published: (2023)

Nonparametric Contextual Online Bilateral Trade
by: Coccia, Emanuele, et al.
Published: (2026)

Barriers to Welfare Maximization with No-Regret Learning
by: Anagnostides, Ioannis, et al.
Published: (2024)

Quantum Computing-Enhanced Algorithm Unveils Novel Inhibitors for KRAS
by: Vakili, Mohammad Ghazi, et al.
Published: (2024)

New Guarantees for Learning Revenue Maximizing Menus of Lotteries and Two-Part Tariffs
by: Balcan, Maria-Florina, et al.
Published: (2023)

Online Learning with Bounded Recall
by: Schneider, Jon, et al.
Published: (2022)

No-Regret Learning in Bilateral Trade via Global Budget Balance
by: Bernasconi, Martino, et al.
Published: (2023)

Learning-Augmented Online Bidding in Stochastic Settings
by: Angelopoulos, Spyros, et al.
Published: (2025)

The Relationship between No-Regret Learning and Online Conformal Prediction
by: Ramalingam, Ramya, et al.
Published: (2025)

Learning in Online Principal-Agent Interactions: The Power of Menus
by: Han, Minbiao, et al.
Published: (2023)

Enhancing Affine Maximizer Auctions with Correlation-Aware Payment
by: Sun, Haoran, et al.
Published: (2026)

Honor Among Bandits: No-Regret Learning for Online Fair Division
by: Procaccia, Ariel D., et al.
Published: (2024)

A New Benchmark for Online Learning with Budget-Balancing Constraints
by: Braverman, Mark, et al.
Published: (2025)

Improved Regret Bounds for Online Fair Division with Bandit Learning
by: Schiffer, Benjamin, et al.
Published: (2025)

Online Learning for Equilibrium Pricing in Markets under Incomplete Information
by: Jalota, Devansh, et al.
Published: (2023)

Decentralized and Privacy-Preserving Learning of Approximate Stackelberg Solutions in Energy Trading Games with Demand Response Aggregators
by: Kampezidou, Styliani I., et al.
Published: (2023)

Online Learning under Budget and ROI Constraints via Weak Adaptivity
by: Castiglioni, Matteo, et al.
Published: (2023)

Regret Minimization in Bilateral Trade With Perturbed Markets
by: Lunghi, Anna, et al.
Published: (2026)

No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics
by: Su, Yiheng, et al.
Published: (2026)

Evolution of Societies via Reinforcement Learning
by: Bouteiller, Yann, et al.
Published: (2024)

On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games
by: Fan, Zhiyuan, et al.
Published: (2024)

PPA-Game: Characterizing and Learning Competitive Dynamics Among Online Content Creators
by: Xu, Renzhe, et al.
Published: (2024)

Model Selection for Average Reward RL with Application to Utility Maximization in Repeated Games
by: Masoumian, Alireza, et al.
Published: (2024)

T-TAMER: Provably Taming Trade-offs in ML Serving
by: Yang, Yuanyuan, et al.
Published: (2025)

Online Generalized-mean Welfare Maximization: Achieving Near-Optimal Regret from Samples
by: Yang, Zongjun, et al.
Published: (2026)

Learning and Calibrating Heterogeneous Bounded Rational Market Behaviour with Multi-Agent Reinforcement Learning
by: Evans, Benjamin Patrick, et al.
Published: (2024)

A Line Graph-Based Framework for Identifying Optimal Routing Paths in Decentralized Exchanges
by: Zhang, Yu, et al.
Published: (2025)

Online Learning and Equilibrium Computation with Ranking Feedback
by: Liu, Mingyang, et al.
Published: (2026)