Metraipolis › archive › dc_10cae6764aa4
Optimal Regret for Profit Maximization in Bilateral Trade — arXiv:2611.09558
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.09558
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:37:53.142Z
- SHA-256 of the archived text
1ebab5163af48f8e1badd2e5581ee92b173eaf58f2a327c0dd36f491d704c38f- Stable URL of this page
https://metraipolis.com/documento/dc_10cae6764aa4
How to cite
Optimal Regret for Profit Maximization in Bilateral Trade — arXiv:2611.09558 — arXiv (en), https://arxiv.org/abs/2611.09558 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_10cae6764aa4 (Metraipolis archive dc_10cae6764aa4, sha256 1ebab5163af48f8e1badd2e5581ee92b173eaf58f2a327c0dd36f491d704c38f)
BibTeX
@misc{dc10cae6764aa4,
title = {Optimal Regret for Profit Maximization in Bilateral Trade — arXiv:2611.09558},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.09558},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_10cae6764aa4; sha256 1ebab5163af48f8e1badd2e5581ee92b173eaf58f2a327c0dd36f491d704c38f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09558. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Learning to profit from trade requires learning both sides of a market: what a seller is willing to accept and what a buyer is willing to pay. We study repeated bilateral trade, where an intermediary posts a purchase price to a seller and a sale price to a buyer whose valuations are drawn from an unknown joint distribution. Trade occurs only if both parties accept their respective prices, in which case the intermediary earns the difference between the two prices. The intermediary observes only whether trade occurs, without observing either valuation. We show that learning both sides of the market is no harder, in terms of regret, than learning just one. Specifically, we design an algorithm achieving regret $\widetilde{\mathcal{O}}(T^{2/3})$ against the best fixed pair of prices, matching, up to logarithmic factors, the classical lower bound for one-dimensional dynamic pricing. Our result shows that the classical one-dimensional regret rate survives the transition to two dimensions, raising the question of whether this absence of a curse of dimensionality extends to arbitrarily high dimensions.
Tema degli esploratori: economia dei servizi IA (elenco arXiv cs.GT, nuovi lavori del giorno).
Categorie arXiv: Computer Science and Game Theory (cs.GT) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2611.09558 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:32:17.017Z dalla pagina https://arxiv.org/list/cs.GT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).