Research map / Bandits and online learning / Online convex optimization and games
Online Learning in the Repeated Mediated Newsvendor Problem
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 online learning of a mediator's trading price in a repeated newsvendor problem where a new supplier and retailer with private costs and utilities arrive at each step.
Problem
Repeated newsvendor trading mediated by a learning platform, where each round a new supplier (private production cost) and retailer (private utility) join and the mediator must propose a unit trading price.
Approach
Frames supply-chain trading as an online learning problem in which the mediator learns the price online from private supplier and retailer types arriving each round, rather than assuming known distributions.
Closest papers by meaning
- Explaining the Law of Supply and Demand via Online Learning (NeurIPS 2025 · similarity 0.86)
- A Parametric Contextual Online Learning Theory of Brokerage (ICML 2025 · similarity 0.86)
- Learning to price with resource constraints: from full information to machine-learned prices (NeurIPS 2025 · similarity 0.85)
- Regret Analysis of Repeated Delegated Choice (AAAI 2024 · similarity 0.84)
- Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets (NeurIPS 2025 · similarity 0.84)
- Non-stochastic Budgeted Online Pricing with Semi-Bandit Feedback (AAAI 2025 · similarity 0.84)
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.