Online Learning for Equilibrium Pricing in Markets under Incomplete Information
Not on the map. Why?
Abstract (arXiv)
The computation of equilibrium prices at which the supply of goods matches their demand typically relies on complete information on agents' private attributes, e.g., suppliers' cost functions, which are often unavailable in practice. Motivated by this practical consideration, we consider the problem of learning equilibrium prices over a horizon of T periods in the incomplete information setting wherein a market operator seeks to satisfy the customer demand for a commodity by purchasing it from competing suppliers with cost functions unknown to the operator. We first consider the setting when suppliers' cost functions are fixed and develop algorithms that, on three pertinent regret metrics, simultaneously achieve a regret of O(1) when the customer demand is constant over time, and O(√T) when the demand varies over time. In the setting when the suppliers' cost functions vary over time, we demonstrate that, in general, no online algorithm can achieve sublinear regret on all three metrics. Thus, we consider an augmented setting wherein the operator has access to hints/contexts that reflect the variation in the cost functions and propose an algorithm with sublinear regret in this augmented setting. Finally, we present numerical experiments that validate our results and discuss various model extensions.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 30 of its 81 references that are in the map. First posted on arXiv 21 Mar 2023.
Builds on
30 of 81 references.
References · 30
- 2019Introduction to Online Convex Optimizationcited by 793
- 2017Spectrally-normalized margin bounds for neural networkscited by 681
- 2021The Statistical Complexity of Interactive Decision Makingcited by 208
- 2014Taming the Monster: A Fast and Simple Algorithm for Contextual Banditscited by 200
- 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 195
- 2013Bandits with Knapsackscited by 163
- 2017Online Convex Optimization with Stochastic Constraintscited by 94
- 2015Adaptive Algorithms for Online Convex Optimization with Long-term Constraintscited by 65
- 2013Relative Loss Bounds for On-line Density Estimation with the Exponential Family of Distributionscited by 59
- 2020The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problemscited by 58
- 2015An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectivescited by 43
- 2018On the Fenchel Duality between Strong Convexity and Lipschitz Continuous Gradientcited by 42
18 more
- 2014Fast Algorithms for Online Stochastic Convex Programmingcited by 36
- 2018Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descentcited by 33
- 2013Data-Driven Estimation in Equilibrium Using Inverse Optimizationcited by 32
- 2019Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimizationcited by 31
- 2019Online Linear Programming: Dual Convergence, New Algorithms, and Regret Boundscited by 31
- 2020Simple and Fast Algorithm for Binary Integer and Online Linear Programmingcited by 27
- 2020Regularized Online Allocation Problems: Fairness and Beyondcited by 22
- 2021Fair Dynamic Rationingcited by 19
- 2015Watch and Learn: Optimizing from Revealed Preferences Feedbackcited by 17
- 2021The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsackscited by 16
- 2020No-Regret and Incentive-Compatible Online Learningcited by 14
- 2021An Improved Analysis of LP-based Control for Revenue Managementcited by 13
- 2014Learning Economic Parameters from Revealed Preferencescited by 8
- 2016Opportunities for Price Manipulation by Aggregators in Electricity Marketscited by 4
- 2022Online Learning for Traffic Routing under Unknown Preferencescited by 4
- 2017Social welfare and profit maximization from revealed preferencescited by 3
- 2018Distributed Mechanism Design for Multicast Transmissioncited by 3
- 2022Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancementscited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Constrained Online Decision-Making: A Unified Frameworkcited by 0
- 2025Constrained Online Decision-Making: A Unified Framework11 May 2025