betaFeedback

WorksMathematics

Minimax-Optimal Semiparametric Contextual Dynamic Pricing with Multimodal Revenue

Abstract

We study contextual dynamic pricing with arbitrary covariate sequences and bounded, possibly nonbinary purchase quantities. Demand follows a semiparametric surplus-index model with an unknown linear valuation parameter and an unknown Hölder-smooth response. We impose neither concavity nor strong unimodality on revenue and allow nonunique optimal prices. We develop a pilot-corrected layered decision-partitioning policy that combines directional pilot estimation, local polynomial learning, predictable data assignment, and global action elimination. Pilot correction removes the first-order effect of valuation-parameter error, while permanent labels enable concentration under adaptive sampling. The policy attains the minimax smoothness-dependent horizon rate up to logarithmic factors; a matching lower bound already holds for a constant-context binary-demand subclass.

Introduction

Dynamic pricing is a central problem in revenue management. A seller must learn how demand responds to prices while simultaneously using the accumulated information to generate revenue. This learning problem becomes more challenging when customer, product, or market heterogeneity is observed through covariates. Although such information enables personalized pricing, every posted price also determines what the seller subsequently learns. This feedback creates the exploration–exploitation trade-off at the heart of contextual dynamic pricing; see [12] for a broad review and [24] for applications.

A widely studied framework models a customer’s latent valuation as a finite-dimensional function of the observed covariates plus an additive market shock. In semiparametric formulations, the contextual component is typically linear, whereas the distribution of the market shock is left unspecified ([20, 22, 23, 13]). This framework combines an interpretable representation of customer heterogeneity with a flexible demand curve. Binary purchase feedback dominates this single-index literature. Shape-free regret guarantees are available for Lipschitz links, whereas the higher-order-smooth literature typically couples smoothness with distributional coverage and/or stable revenue geometry.

At Lipschitz smoothness, [25] allow arbitrary adaptive contexts and [15] allow general valuation classes under independent and identically distributed contexts; both obtain the optimal shape-free two-thirds horizon exponent with binary feedback. For smoother links, recent improvements rely on nondegenerate or feature-diverse stochastic contexts together with stable revenue geometry ([16]; [8]), or on a smooth oracle-price map induced by strong unimodality ([14]).

A particularly consequential restriction is strong unimodality ([26]; [16]; [14]). In the form used by recent smooth-pricing analyses, this condition requires every contextual revenue function to have a unique interior maximizer and its revenue loss to be uniformly comparable to the squared distance from that maximizer. It is therefore considerably stronger than smoothness or a local second-order condition. Strong unimodality rules out separated revenue modes, flat optimal-price regions, and many asymmetric or boundary-optimal revenue landscapes. At the same time, it provides several powerful analytical advantages: the policy can safely localize around one estimated optimizer, price-estimation errors translate into quadratic revenue losses, and the context-dependent optimal price can often be represented by a regular oracle price map. Indeed, these properties are central to the algorithms and improved regret guarantees in [26], [16], and [14].

This paper studies contextual pricing without these structural conveniences. In each period, the seller observes a covariate vector, posts a price, and observes a bounded purchase quantity, which may be binary, discrete, or continuous. Latent valuation is linear in the observed covariates and subject to an unknown market shock. After integrating out the shock, expected demand is an unknown function of the difference between price and a linear contextual valuation index; both the index parameter and the response function are unknown. The usual binary-purchase model is obtained as a special case, but the formulation also accommodates bounded unit sales and purchase volume. We allow the covariates to arrive arbitrarily and impose only Hölder smoothness on the observable response function. The induced revenue function may consequently be multimodal, may contain a flat optimal region, and need not have a unique maximizer. The smoothness assumption also has natural primitive foundations: it follows, for example, when the market-shock distribution is smooth and the quantity-response function has bounded variation, or when the quantity-response function is itself sufficiently smooth.

Removing strong unimodality fundamentally changes the learning problem. Hölder smoothness controls only local approximation and provides no information about the global geometry of revenue. Learning accurately near a provisional optimizer is therefore insufficient: another, statistically similar region may contain a better and well-separated revenue mode. A policy that localizes prematurely may never collect enough information to discover that region. Consequently, the algorithm must preserve and compare candidates across the entire price domain rather than organize its exploration around a single estimated optimum or oracle price map.

A second difficulty arises from the interaction between the unknown valuation parameter and the nonparametric response function. Directly inserting a pilot parameter estimate into a nonparametric regression transfers the pilot error to the fitted response curve at first order. This error can dominate the higher-order approximation accuracy that smoothness would otherwise provide. A natural remedy, used in classical single-index estimation and recent semiparametric pricing analyses, is to profile a nonparametric fit over candidate index parameters and refine the parameter through constrained least squares ([17]; [19]; [18]; [27]; Chen, 2025; [16]). This remedy is statistically and computationally demanding. Because the local fits and their underlying sample assignments vary with the candidate parameter, the resulting objective is generally nonconvex, even in the twice-smooth case. Standard local optimization methods thus do not provide a global-solution guarantee. Moreover, the same observations are used both to construct the nonparametric fit and to evaluate the least-squares criterion, creating a complex dependence structure in online settings and making finite-sample confidence analysis delicate ([16]). These issues motivate an approach that exploits higher-order smoothness without repeatedly solving a nonconvex joint-estimation problem.

Adaptive data collection introduces a third challenge. Posted prices, residual bins, and subsequent exploration decisions all depend on previous outcomes. If past observations are reassigned whenever the valuation estimate changes, membership in a local dataset is determined retrospectively using information that was unavailable when the observation was collected. This destroys the predictable sampling structure needed for martingale concentration and makes standard offline nonparametric guarantees inapplicable.

We address these challenges through a pilot-corrected layered decision-partitioning (LDP) policy. The pilot module uses uniform-price exploration to estimate the linear valuation component and evaluates its uncertainty only along the currently observed covariate direction. A well-covered direction enters the main pricing stage immediately, whereas an insufficiently covered direction triggers additional pilot exploration. This directional mechanism avoids distributional assumptions on the covariate sequence.

During the main pricing stage, prices are represented relative to the estimated valuation index, and demand is learned locally in the resulting residual coordinate. An augmented local-polynomial representation absorbs the leading pilot perturbation into the regression coefficients, leaving only a second-order pilot error in addition to the usual nonparametric approximation error. Thus, the policy benefits from higher-order smoothness without solving the nonconvex constrained least-squares problems used in alternative joint estimation procedures. Each observation is also assigned a permanent layer–bin label before its demand is observed. These labels are never recomputed after the pilot estimate changes, preserving predictable sampling and enabling self-normalized concentration within every local dataset.

Finally, the layered policy maintains candidate actions over the entire residual domain. An action is eliminated only when its optimistic revenue is statistically separated from the best surviving benchmark. This design protects distant modes and flat near-optimal regions and therefore performs global rather than local revenue learning.

Balancing pilot exploration, local approximation, and statistical uncertainty yields the minimax smoothness-dependent horizon rate, up to logarithmic factors, for fixed problem primitives. We establish a matching expected-regret lower bound over an admissible constant-context, binary-demand subclass. The construction begins with a smooth instance whose revenue is flat over a nondegenerate interval and introduces statistically indistinguishable perturbations in separated price regions. Together, the upper and lower bounds characterize the minimax dependence on the horizon for the general revenue class considered here.

Contributions. Our contributions are twofold.

  • A shape-free model and higher-order online method. We combine arbitrary context

sequences, general Hölder smoothness, and bounded quantity feedback in a translated-residual single-index model without concavity, strong unimodality, or a unique optimal price. Our pilot-corrected LDP policy integrates directional exploration, higher-order local polynomials, predictable permanent labels, and global elimination. Relative to the Lipschitz LDP framework of [15], this replaces an episodic offline pilot and piecewise-constant learning with an online directional pilot, first-order error correction, and higher-order residual learning.

  • Minimax-optimal regret for shape-free smooth links. For fixed dimension and fixed problem primitives, the proposed policy achieves O~(Tβ+12β+1)\widetilde{O}\left(T^{\frac{\beta+1}{2\beta+1}}\right) regret, matching Ω(Tβ+12β+1)\Omega\left(T^{\frac{\beta+1}{2\beta+1}}\right) lower bound. Together, the upper and lower bounds characterize the minimax horizon dependence for the general revenue class studied in this paper.

Semiparametric contextual dynamic pricing. Contextual pricing with a linear valuation component and an additive shock has been studied under known parametric noise distributions ([20]; [3]), unknown nonparametric noise ([22]; [23]; [13]; [10]; [28]; [8]), and more general valuation or utility classes ([9]; [15]). These works differ in the feedback available, the distributional assumptions on contexts, and the geometry imposed on revenue. The papers most closely related to ours are summarized in Table 1. The rates in the last column suppress logarithmic factors and polynomial dependence on fixed problem primitives.

WorkFeedbackContextsSmoothnessRevenue geometryRegret
Tullii et al. (2024)BinaryArbitraryβ=1\beta= 1GeneralO~(T2/3)\widetilde{O}(T^{2/3})
Gong et al. (2025)Binaryi.i.d.β=1\beta= 1GeneralO~(T2/3)\widetilde{O}(T^{2/3})
Wang and Chen (2025)Binaryi.i.d.β=2\beta= 2Strongly unimodalO~(T3/5)\widetilde{O}(T^{3/5})
Han et al. (2026)Binaryi.i.d.β≥2\beta\ge2Strongly unimodalO~(Tβ+12β+1)\widetilde{O}(T^{\frac{\beta+1}{2\beta+1}})
Fan et al. (2026)BinaryArbitraryβ≥2\beta\ge2Strongly unimodalO~(T2β−14β−3+T)\widetilde{O}(T^{\frac{2\beta-1}{4\beta-3}}+\sqrt{T})
This paperBounded quantityArbitraryβ≥1\beta\ge1GeneralO~(Tβ+12β+1)\widetilde{O}(T^{\frac{\beta+1}{2\beta+1}})

Table 1. Representative results for smooth semiparametric contextual pricing. Here β\beta denotes link or tail smoothness; rates suppress logarithmic factors and dependence on fixed problem primitives.

The principal comparison at β=1\beta= 1 is [25]: it already allows arbitrary adaptive contexts and general revenue geometry, and attains the same T2/3T^{2/3} horizon exponent, but is restricted to binary feedback and Lipschitz smoothness. [15] introduce the LDP architecture for a shape-free Lipschitz problem with binary feedback and i.i.d. contexts. Thus, our claim at β=1\beta= 1 is not a better horizon exponent. The contribution is to retain arbitrary contexts and shape-free revenue while covering general β\beta and bounded quantity feedback.

For twice-smooth demand, [26] establish the sharp O~(T3/5)\widetilde{O}(T^{3/5}) regret rate under strong unimodality and nondegenerate i.i.d. contexts, using contextual successive elimination together with semiparametric estimation. [16] extend this line to general Hölder smoothness by combining local-polynomial estimation with the stationary learning subroutine of [26], while retaining similar revenue-geometry and context-coverage conditions. [14] also impose strong unimodality but allow arbitrary contexts; by directly learning the resulting smooth oracle-price map, they obtain a faster horizon exponent when β>2\beta> 2. Our result addresses the complementary regime in which higher-order smoothness is available but the revenue geometry remains unrestricted. The flat-optimum construction underlying our lower bound shows that this distinction is structural: without strong unimodality, the hard instances need not admit a unique and stable oracle-price map on which localization can be based.

Xu and Wang (2026) study an adjacent, nonnested regime: binary feedback with possibly discontinuous demand, including jumps induced by atoms, under stochastic well-conditioned contexts. Their model relaxes link regularity, whereas ours uses Hölder smoothness to handle arbitrary contexts and bounded quantity feedback.

Algorithmically, our closest antecedent is the policy of Gong et al. (2025). Relative to its episodic offline pilot and piecewise-constant residual learning, our policy uses an online directional pilot, higher-order local polynomials, an augmented correction that makes pilot error second order, and permanent residual labels that preserve predictable sampling as the pilot evolves. Uniform-price exploration in Javanmard and Nazerzadeh (2019); Fan et al. (2024); Chen et al. (2024) and the arbitrary-context mechanisms in Tullii et al. (2024) provide additional points of contact.

Nonparametric and multimodal pricing. Without covariates, nonparametric dynamic pricing has been studied under a range of smoothness and shape conditions (Besbes and Zeevi, 2009, 2015; Wang et al., 2021). In particular, Wang et al. (2021) establish the minimax rate O~(T(β+1)/(2β+1))\widetilde{O}(T^{(\beta+1)/(2\beta+1)}) for smooth multimodal revenue using local-polynomial optimism. Their confidence indices explicitly incorporate a local approximation envelope, and thus require the corresponding smoothness radius.

Bounded quantity observations are not new by themselves. Wang et al. (2021) analyze general demand feedback without contexts, while Bu et al. (2022, 2025) study partially linear and separable contextual demand models. The present model instead places the unknown context effect inside the translated residual p−xTθ⋆p-x^{\mathsf{T}}\theta_{\star}. Consequently, the valuation shift and the nonparametric link must be learned jointly under an arbitrary context sequence. This translated single-index structure, rather than nonbinary feedback alone, is the relevant distinction.

Layered contextual bandits. Our analysis draws on standard confidence-based methods for contextual bandits (Auer, 2002; Chu et al., 2011; Abbasi-Yadkori et al., 2011; Lattimore and Szepesvári, 2020). Classical layered partitioning separates observations by precision level to obtain sharper confidence control. In the present problem, however, the local regression model itself depends on an evolving pilot index and is only approximately specified. The permanent labeling rule is therefore essential: it fixes the residual coordinate, local bin, and stopping layer used for each observation before the outcome is revealed. This converts the adaptively collected local samples into predictable martingale arrays while retaining global price exploration.

Organization. Section 3 introduces the model, the induced demand link, and its regularity. Section 4 presents the directional pilot, pilot-corrected local regression, and layered pricing policy. Section 5 establishes the regret upper bound and the matching minimax lower bound. The paper concludes with directions for future research.

Problem Formulation

Notation. Throughout the paper, we write [n]:={1,…,n}[n]:=\{1,\ldots,n\} for any positive integer nn, denote the cardinality of a set AA by ∣A∣|A|, and use 1{E}\mathbf{1}\{E\} for the indicator of an event EE. For vectors, ∥⋅∥p\|\cdot\|_{p} denotes the standard ℓp\ell_p norm for 1≤p≤∞1 \le p \le\infty. The notation O~\widetilde{O} suppresses absolute constants and logarithmic factors. For a positive definite matrix AA, define ∥z∥A:=zTAz\|z\|_A := \sqrt{z^{\mathsf{T}}Az}. For an interval I=[a,b]I=[a,b], let ΠI(z):=min⁡{b,max⁡{a,z}}\Pi_I(z):=\min\{b,\max\{a,z\}\} denote projection onto II.

Basic Model. We consider a contextual dynamic pricing problem over a finite horizon TT. In each period t∈[T]t \in[T], a customer arrives and the seller observes a covariate vector xt∈X⊆Rd\boldsymbol{x}_t \in\mathcal{X} \subseteq\mathbb{R}^d that characterizes the observable customer, product, or market characteristics. Unlike standard i.i.d. assumptions, we do not impose any distributional assumption on the covariate sequence {xt}t=1T\{\boldsymbol{x}_t\}_{t=1}^T; it can be arbitrary and possibly dependent. The covariate space is bounded, i.e., there exists Cx<∞C_x < \infty such that sup⁡x∈X∥x∥2≤Cx\sup_{\boldsymbol{x}\in\mathcal{X}}\|\boldsymbol{x}\|_2 \le C_x. For each t∈[T]t \in[T], let Ft−1\mathcal{F}_{t-1} denote the σ\sigma-field generated by all observations and policy randomization available up to the end of period t−1t-1. Let UtU_t collect all within-period randomization used by the policy after observing xt\boldsymbol{x}_t. Conditional on Ft−1∨σ(xt)\mathcal{F}_{t-1}\vee\sigma(\boldsymbol{x}_t), the seed UtU_t is drawn independently of the current valuation shock.

The customer’s valuation for the product is modeled as a linear function of the covariates plus random noise:

vt=xtTθ⋆+ϵt,v_t = \boldsymbol{x}_t^{\mathsf{T}}\boldsymbol{\theta}_\star+ \epsilon_t,

where θ⋆∈Θ={θ∈Rd:∥θ∥2≤Cθ}\boldsymbol{\theta}_\star\in\Theta= \{\boldsymbol{\theta} \in\mathbb{R}^d : \|\boldsymbol{\theta}\|_2 \le C_\theta\} is an unknown parameter vector, and ϵt\epsilon_t is an unobserved random shock. The shocks {ϵt}t=1T\{\epsilon_t\}_{t=1}^T are independent and identically distributed according to an unknown cumulative distribution function FF with zero mean. For every t∈[T]t \in[T], ϵt\epsilon_t is independent of Ft−1∨σ(xt,Ut)\mathcal{F}_{t-1}\vee\sigma(\boldsymbol{x}_t,U_t).

Assumption 3.1 (Bounded Valuations) There exist B>0B>0 and Bϵ∈(0,B/2)B_\epsilon\in(0,B/2) such that:

  • The noise is uniformly bounded: ∣ϵt∣≤Bϵ|\epsilon_t| \le B_\epsilon almost surely.

  • The linear valuation satisfies xTθ⋆∈[Bϵ,B−Bϵ]\boldsymbol{x}^{\mathsf{T}}\boldsymbol{\theta}_\star\in[B_\epsilon,B-B_\epsilon] for all x∈X\boldsymbol{x}\in\mathcal{X}.

Assumption 3.1 guarantees that vt=xtTθ⋆+ϵt∈[0,B]v_t=\boldsymbol{x}_t^{\mathsf{T}}\boldsymbol{\theta}_\star+\epsilon_t\in[0,B] almost surely, so the realized valuation and any feasible posted price lie in the same known interval [0,B][0,B]. This is a standard and natural requirement in practical pricing applications.

After observing xt\boldsymbol{x}_t, the seller posts a per-unit price pt∈[0,B]p_t\in[0,B]. The price and every auxiliary action label constructed by the policy before demand is observed are measurable with respect to the full pre-demand information field Gt:=Ft−1∨σ(xt,Ut)\mathcal{G}_t:=\mathcal{F}_{t-1}\vee\sigma(\boldsymbol{x}_t,U_t). If the realized valuation satisfies vt≥ptv_t\ge p_t, a sale occurs and the seller observes a positive purchase quantity yt>0y_t>0; otherwise, no sale occurs and yt=0y_t=0, i.e., 1{yt>0}=1{vt≥pt}\mathbb{1}\{y_t>0\}=\mathbb{1}\{v_t\ge p_t\} almost surely. The observed quantity yty_t may be discrete (e.g., number of units) or continuous (e.g., physical volume or usage), depending on the application. We assume there exists a constant 0<D<∞0<D<\infty such that 0≤yt≤D0\le y_t\le D almost surely. The realized revenue at time tt is ptytp_ty_t, and each round yields the observation triple (xt,pt,yt)(\boldsymbol{x}_t,p_t,y_t). We set Ft:=Gt∨σ(yt)\mathcal{F}_t:=\mathcal{G}_t\vee\sigma(y_t), so Gt\mathcal{G}_t and Ft\mathcal{F}_t describe, respectively, all information immediately before and after current demand is observed.

Generalized Single Index Model. The basic model above only specifies the qualitative relationship between yty_t and the surplus vt−ptv_t-p_t. However, to enable statistical learning and regret minimization, the seller must quantify how the expected demand varies with the posted price and covariates. To make the problem tractable while retaining flexibility, we adopt a surplus-dependent single-index structure. This formulation generalizes the widely studied binary purchase model ([14]; [16]; [23]; [13]; [15]) by allowing the realized demand quantity to depend on the surplus through a function q(⋅)q(\cdot), rather than restricting to a binary sale indicator.

Specifically, we posit that, conditional on the information available before demand is observed and on the realized valuation, the expected demand depends on the current price and covariates only through the net surplus vt−ptv_t-p_t. This single-index form is natural: it implies that a customer’s purchasing quantity decision is driven by the perceived value relative to the price, rather than by their absolute levels separately. Under this premise, there exists an unknown baseline function q(⋅)q(\cdot) that maps the surplus to the expected quantity. Importantly, we impose no parametric form, such as a linear or logistic specification, on qq, allowing it to accommodate richly heterogeneous and potentially nonmonotone demand responses. The formal statement is as follows.

Assumption 3.2 (Surplus-dependent demand response) There exists an unknown measurable function q:R→[0,D]q:\mathbb{R}\to[0,D] with q(z)=0q(z)=0 for z<0z<0 or z>Bz>B and q(z)>0q(z)>0 for z∈[0,B]z\in[0,B], such that, for every t∈[T]t\in[T],

E[yt∣Gt∨σ(vt)]=q(vt−pt)almost surely.\mathbb{E}[y_t\mid\mathcal{G}_t\vee\sigma(v_t)]=q(v_t-p_t)\quad\text{almost surely.}

References

  1. [3]Ban, G.-Y. and Keskin, N. B. (2021). Personalized dynamic pricing with machine learning: High-dimensional features and heterogeneous elasticity. Management Science, 67(9):5549–5568.
  2. [4]Besbes, O. and Zeevi, A. (2009). Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms. Operations research, 57(6):1407–1420.
  3. [7]Bu, J., Simchi-Levi, D., and Wang, C. (2025). Context-based dynamic pricing with separable demand models. Management Science.
  4. [8]Chai, J., Duan, Y., Fan, J., and Wang, K. (2026). Optimal semiparametric dynamic pricing with feature diversity. arXiv preprint arXiv:2605.04207.
  5. [9]Chen, E., Chen, X., Gao, L., and Li, J. (2024). Dynamic contextual pricing with doubly non-parametric random utility models. arXiv preprint arXiv:2405.06866.arxiv.org/abs/2405.06866
  6. [10]Choi, Y.-G., Kim, G.-S., Yunseo, C., Cho, W., Paik, M. C., and Oh, M.-h. (2023). Semi-parametric contextual pricing algorithm using cox proportional hazards model. In International Conference on Machine Learning, pages 5771–5786. PMLR.
  7. [12]Den Boer, A. V. (2015). Dynamic pricing and learning: historical origins, current research, and new directions. Surveys in operations research and management science, 20(1):1–18.
  8. [13]Fan, J., Guo, Y., and Yu, M. (2024). Policy optimization using semiparametric models for dynamic pricing. Journal of the American Statistical Association, 119(545):552–564.
  9. [14]Fan, Y., Han, Y., Lv, J., Xu, X., and Zhou, Z. (2026). Harnessing unimodality in semiparametric contextual pricing via oracle price map learning. arXiv preprint arXiv:2605.15411.
  10. [15]Gong, X., You, W., and Zhang, J. (2025). Minimax optimality in contextual dynamic pricing with general valuation models. Operations Research, 74(2):879–897.
  11. [16]Han, Y., Xu, X., Wen, Y., Han, Y., Lobel, I., and Zhou, Z. (2026). Semi-parametric contextual pricing with general smoothness. In The Fourteenth International Conference on Learning Representations.
  12. [17]Härdle, W., Hall, P., and Ichimura, H. (1993). Optimal smoothing in single-index models. The Annals of Statistics, 21(1):157–178.
  13. [18]Horowitz, J. L. and Härdle, W. (1996). Direct semiparametric estimation of single-index models with discrete covariates. Journal of the American Statistical Association, 91(436):1632–1640.
  14. [19]Ichimura, H. (1993). Semiparametric least squares (SLS) and weighted SLS estimation of single-index models. Journal of Econometrics, 58(1–2):71–120.
  15. [20]Javanmard, A. and Nazerzadeh, H. (2019). Dynamic pricing in high-dimensions. Journal of Machine Learning Research, 20(9):1–49.
  16. [22]Luo, Y., Sun, W. W., and Liu, Y. (2022). Contextual dynamic pricing with unknown noise: Explore-then-ucb strategy and improved regrets. Advances in Neural Information Processing Systems, 35:37445–37457.
  17. [23]Luo, Y., Sun, W. W., and Liu, Y. (2024). Distribution-free contextual dynamic pricing. Mathematics of Operations Research, 49(1):599–618.
  18. [24]Saharan, S., Bawa, S., and Kumar, N. (2020). Dynamic pricing techniques for intelligent transportation system in smart cities: A systematic review. Computer Communications, 150:603–625.
  19. [25]Tulli, M., Gaucher, S., Merlis, N., and Perchet, V. (2024). Improved algorithms for contextual dynamic pricing. In Advances in Neural Information Processing Systems, volume 37, pages 126088–126117.
  20. [26]Wang, Y. and Chen, B. (2025). Tight regret bounds in contextual pricing with semi-parametric demand learning. Available at SSRN 5133677.
  21. [27]Wang, Y., Chen, B., and Simchi-Levi, D. (2021). Multimodal dynamic pricing. Management Science, 67(10):6136–6152.
  22. [28]Xu, J. and Wang, Y.-X. (2022). Towards agnostic feature-based dynamic pricing: Linear policies vs linear valuation with unknown noise. In International Conference on Artificial Intelligence and Statistics, pages 9643–9662. PMLR.

Paper details

vlnc:W_7javyg54
Version
v1 · latest
Published
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents