Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.30156

Advance versus Spot Selling in Queueing Systems: the Effect of Uncertainty Sources

Yumeng Liu·Dongyuan Zhan
View original source ↗Read source document ↗Export metadata ↓

Abstract

We develop an unobservable M/M/1 queueing model to analyze advance selling and spot selling under uncertainty. Customers are heterogeneous in waiting costs, drawn from a uniform distribution. We disentangle two fundamental sources of uncertainty: customer valuation and service capacity. We derive the respective revenue functions for both advance and spot selling strategies and compare their performance. Our analysis reveals that advance selling is more profitable when customer valuations are uncertain. Conversely, spot selling emerges as the more profitable strategy when uncertainty originates from service capacity. When both sources are present, our numerical experiments suggest that the preferred regime depends on the relative dispersion of the two uncertainties: advance selling tends to be favored when valuation uncertainty is sufficiently pronounced relative to capacity uncertainty, whereas spot selling tends to be favored when capacity uncertainty is more pronounced. These results highlight how the origin and magnitude of uncertainty shape the optimal selling strategy in service queues and offer practical guidance for platforms and service providers deciding between advance and spot selling.

Explore related subjects

math.OCmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yumeng Liu, Dongyuan Zhan. 2026-08-29. Advance versus Spot Selling in Queueing Systems: the Effect of Uncertainty Sources. https://doi.org/10.1007/s11134-026-10001-w

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization

This paper addresses nonconvex optimization problems via a two-level smoothing framework, where the high-order Moreau envelope (HOME) provides a smooth approximation of weakly convex cost functions. We study the differentiability and weak smoothness of HOME. Building on the inexact two-level smoothing optimization framework (ItsOPT), we propose an inexact two-level smoothing descent algorithm (ItsDEAL) by: (i) approximately solving the proximal subproblem to obtain an inexact first-order oracle for HOME at the lower level; and (ii) applying an inexact first-order method at the upper level. We derive computable sufficient conditions for lower-level inexactness, enabling approximate high-order proximal-points to be certified without access to the exact proximal-point or HOME value. In particular, we study a parameter-free Hölderian inexact gradient method and an inexact descent method with Armijo line search, both exploiting the weak smoothness of HOME. We establish subsequential convergence under mild inexactness assumptions, and global and linear convergence under the Kurdyka--Łojasiewicz (KL) property. Preliminary experiments on ridge-regularized hinge-loss classification, a high-dimensional MCP-regularized classification model, and robust matrix completion illustrate the numerical behavior of the proposed methods and the role of the HOME order.

math.OC↗
arXiv2026

OFF Newton-type Methods for Unconstrained Optimization with Inexact Derivatives

We study objective-function-free (OFF) Newton-type methods for smooth unconstrained optimization with inexact gradients and Hessians. We propose two methods for first- and second-order stationarity, coupling explicit step-size rules with derivative-accuracy and linear-solver residual conditions to guarantee sufficient decrease without evaluating the objective function. The OFF regularized Newton method finds an $\varepsilon$-first-order stationary point in $\mathcal{O}(\varepsilon^{-2})$ iterations. Under strong convexity, a local Newton variant converges with \(Q\)-order at least $1+θ$, where \(θ\in (0, 1]\). For second-order stationarity, we combine regularized Newton steps with approximate eigenvectors associated with the minimum eigenvalue. With high probability, the resulting method finds an $(\varepsilon, \sqrt{L_h\varepsilon})$-second-order stationary point in $\mathcal{O}(\varepsilon^{-3/2})$ iterations, using a total of $\widetilde{\mathcal{O}}(\varepsilon^{-7/4})$ approximate gradient evaluations and Hessian-vector products. For finite-sum problems, we develop subsampling schemes that yield best-iterate convergence in expectation in the nonconvex first-order setting and local \(R\)-linear convergence with high probability in the strongly convex setting, followed by \(Q\)-order at least \(1+θ\) once full sampling is reached. The subsampled second-order method achieves a high-probability $\widetilde{\mathcal{O}}(\varepsilon^{-7/2})$ total sample-operation bound, counting component gradient evaluations and component Hessian-vector products.

math.OC↗
arXiv2026

An efficient mixed-integer linear programming formulation for solving influence diagrams

Influence diagrams represent decision-making problems with interdependencies between random events, decisions, and consequences. Traditionally, they have been solved using tailored algorithms that determine the expected utility-maximizing decision strategy. Towards this end, most recent state-of-the-art solution approaches convert them into mixed-integer linear programming (MILP) models that can be solved using off-the-shelf MILP solvers. Computationally, these approaches are most efficient for influence diagrams that represent periodic (or sequential) decision processes, which can be cast as partially observable Markov Decision Processes. However, they are inefficient for problems that lack this periodic structure or whose influence diagrams have large state spaces. The efficient MILP formulation presented in this paper is specifically designed for influence diagrams that are challenging for earlier MILP formulations. Additionally, this formulation can be adapted to optimize conditional value-at-risk and to incorporate chance and logical constraints, thereby retaining the modeling flexibility of MILP-based methods. Finally, computational experiments on a range of problems from the literature are reported to show that the proposed formulation is much more efficient than earlier MILP formulations, particularly in problems which cannot be modeled as partially observable Markov decision processes and which lead to influence diagrams whose decision or chance nodes may have large state spaces.

math.OC↗