arXiv:2608. 16699v1 Announce Type: cross Abstract: Motivated by modern marketplaces, where the platform or the seller routinely gathers detailed user profiles, we study a novel learning theoretic model that simultaneously involves information and mechanism design.
By Maria-Florina Balcan, Tejas Pagare, Karan Singh
arXiv:2302.02006v2 Announce Type: replace
Abstract: Major Internet advertising platforms offer budget pacing tools as a standard service for advertisers to manage their ad campaigns. Given the inhere...
By Santiago Balseiro, Rachitesh Kumar, Vahab Mirrokni, Balasubramanian Sivan, Di Wang
arXiv:2503. 01701v2 Announce Type: replace-cross Abstract: Most microeconomic models of interest involve optimizing a piecewise linear function.
By Francesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti
arXiv:2607. 24115v1 Announce Type: cross Abstract: We study the contextual dynamic pricing problem under non-stationarity, where a firm sells products to $T$ sequentially arriving consumers that behave according to an unknown demand model that can change over time.
By Feiyu Jiang, Zifeng Zhao
arXiv:2608. 11383v1 Announce Type: new Abstract: We study new algorithms for Contextual Bandits with Knapsack.
By Zhen Xu
arXiv:2609.06083v1 Announce Type: new
Abstract: To make optimal joint pricing and inventory control decisions is a critical challenge for modern retailers. In practice, retailers face changing market...
By Zean Han, Zezhen Ding, Jiheng Zhang
arXiv:2609.00710v1 Announce Type: cross
Abstract: An LLM application often sells or internally allocates several service products: a small or premium model, a short or long token cap, and possibly mu...
By Patrick Wong
arXiv:2209. 04942v2 Announce Type: replace-cross Abstract: Problem definition: This paper studies the problem of estimating consumer preferences from bundle sales data.
By Ningyuan Chen, Setareh Farajollahzadeh, Qingwei Jin, Fanni Shen, Guan Wang
arXiv:2605. 09448v2 Announce Type: replace Abstract: We study the operational problem of automated bidding in repeated first-price auctions under budget and return-on-spend (RoS) constraints.
By Zihao Hu, Yuxiao Wen, Yuan Yao, Jiheng Zhang, Zhengyuan Zhou
arXiv:2606. 03736v2 Announce Type: replace-cross Abstract: We study resource-constrained dynamic pricing when the seller seeks revenue and valid inference about demand at a price fixed before the selling season.
By Ruicheng Ao, Jiashuo Jiang, David Simchi-Levi
arXiv:2606. 05363v1 Announce Type: cross Abstract: On a platform with many sellers, should a pricing algorithm explicitly model competitors' prices when learning demand?
By Yuhang Wu, Assaf Zeevi
arXiv:2606. 11118v1 Announce Type: new Abstract: We study a dynamic assortment problem on a two-sided service platform with incomplete information and heterogeneous customers in a discrete-time setting.
By Rahul Roy, Nur Sunar, Jayashankar M. Swaminathan