atlas

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

An Online Learning Theory of Trading-Volume Maximization

ICLR 2025 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Studies a broker who posts trading prices between two traders in an online learning framework to maximize trading volume, based only on the abstract.

Problem

Maximizing trading volume when a broker must propose prices to two traders with private valuations that are unknown, learned online across rounds.

Approach

Frames brokerage between traders as an online learning problem in which the broker proposes a price each round and a trade occurs when one trader is willing to sell at that price; the abstract does not detail the algorithm.

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