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...
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.
The paper introduces LLP, a Large Language Model–based generative framework for pricing second‑hand products on consumer‑to‑consumer platforms. LLP retrieves similar items to capture market dynamics, then uses LLMs to generate price suggestions, refined through supervised fine‑tuning and group relative policy optimization. A confidence‑based filter rejects unreliable predictions, and experiments show LLP outperforms prior methods, achieving higher static adoption rates when deployed on Xianyu.
arXiv:2606. 26432v1 Announce Type: new Abstract: Tabular foundation models achieve strong accuracy on choice prediction tasks, but their predictions often violate the economic logic those tasks require: raising a price can increase predicted demand, implied willingness-to-pay estimates are frequently negative or implausible, and unavailable alternatives receive nonzero probability.
arXiv:2503. 12902v4 Announce Type: replace Abstract: Model trees provide an appealing way to perform interpretable machine learning for both classification and regression problems.
arXiv:2604. 05845v2 Announce Type: replace-cross Abstract: Auto-bidding services optimize real-time bidding strategies for advertisers under key performance indicator (KPI) constraints such as target return on investment and budget.
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.
arXiv:2607. 13314v1 Announce Type: cross Abstract: Tabular foundation models (TFMs) generate predictions on structured data via in-context learning, without task-specific estimation.
arXiv:2606. 13741v1 Announce Type: new Abstract: This paper presents the design, development, and implementation of a specialized forecast-then-optimize algorithmic pricing tool for sales campaigns in fashion e-commerce.
arXiv:2606. 17805v1 Announce Type: new Abstract: Data acquisition is a major bottleneck for learning in real-time streams: analysts must decide on the fly which labels to purchase while respecting a rolling budget.
arXiv:2608. 12680v1 Announce Type: cross Abstract: Item demand forecasting is an integral component of store assortment optimization.
The paper introduces Budget-First Tariff Recommendation (BFTR), an algorithmic framework that offers telecom plans without overcharging by aligning final prices with catalog reference prices. BFTR incorporates eight Budget-First strategies, including two novel hybrid approaches—Recursive Hybrid and Knapsack-First Hybrid— and mathematically proves that a suitable offer exists for any positive budget with zero surcharge for non‑interpolated strategies. Experiments on a Nigerian MTN‑inspired dataset show that all strategies achieve zero overcharging, with Recursive Hybrid delivering optimal customer utility and Piecewise maximizing volume, while maintaining sub‑10 ms execution times.