Wait Time Based Pricing for Queues with Customer-Chosen Service Times: The Delay Differential Optimality Equations Have a Decreasing Concave SolutionResearch Paper
Motivation
Service systems such as public fast-charging stations for electric vehicles let each customer choose how long to be served. Lin, Shang and Sun (SSRN 3709573, 2020; later in Management Science, doi:10.1287/mnsc.2022.4474) study a firm that announces to every arriving customer the current wait time (the work already in the queue) and a price rate per unit of service time. The customer then decides whether to join and, if so, how long a service to buy. Queue pricing usually conditions on the queue length with random service times (Low 1974; Paschalidis and Tsitsiklis 2000; Kim and Randhawa 2018). Here the state is the wait time, and it moves deterministically between arrivals.
The firm maximizes long-run average revenue or social welfare. The optimality condition the paper derives is not an ordinary differential equation but a delay differential equation (DDE) that looks ahead: the value at depends on the value at . This mission formalizes the paper's existence theorem for that equation.
Setting
A model has a usage utility , a waiting cost , a Poisson arrival rate and a maximum service time , under Assumption 1 (p. 7):
- , , and on ;
- on ;
- , and for .
At price a joining customer chooses the service time (5). They join when . Three thresholds follow:
- solves ; above it nobody joins.
- , for , is the highest price at which a customer still joins (Proposition 2).
- and (Proposition 1) describe when the marginal price still attracts a customer.
The per-customer value is , with , for revenue and , for welfare (Lemma 1).
The optimality equations (12)–(15) ask for a constant (the average rate) and a relative value function with
Algorithm 1 (p. 14) is a backward explicit-Euler shooting scheme. For a guess and grid cells on , it starts from for . It then builds a piecewise-linear cell by cell from right to left. On the cell ending at the slope is , where the slope adjustment is times the positive part of the inner maximum at . The shooting value is (23). Finally (24) and (Proposition 6).
Formalization targets
Goal: Theorem 1 (p. 17)
Milestones
The milestones follow the paper's proof in order:
- Thresholds and the value function (Propositions 1–3, pp. 8–11): uniqueness of and , the characterization (8) of , with decreasing, and the bounds (V1)–(V2) on .
- The finite- scheme (Proposition 4, Lemmas 2, 3, 5): is concave and is nonincreasing; increases when the grid is refined and decreases in ; and .
- The limits (Proposition 5, Lemma 6, Proposition 6): increases to , the are uniformly -Lipschitz, and they converge uniformly to a concave, nonincreasing, Lipschitz .
- The equations in the limit (Lemma 7, Propositions 7–8): ; the boundary condition (13); differentiability of on and the DDE (12).
Significance
Theorem 1 is the existence half of the paper's verification argument. Its Theorem 2 then shows that the constructed equals the optimal long-run average rate over all predictable price processes. Its Theorem 3 reads the structure of the optimal price and service-time policies off . Without a solution of (12)–(15) neither result has an object to talk about. The construction also gives a convergent numerical method (Algorithm 1) for a class of look-ahead DDEs that standard ODE theory does not cover.
The proofs are written out in the paper's Appendix B, except Lemma 12, an internal step of Proposition 8 whose proof the authors leave out. None of it is machine-checked. A complete formalization would check every step of the shooting argument and supply the omitted lemma. It would also yield a reusable framework: Euler-type schemes for delay equations whose delay points forward, monotone in the grid and in a scalar parameter.
Difficulty
The obvious approach, Cauchy–Lipschitz, fails: (12) is not an initial-value problem. depends on on , so the equation must be integrated backwards from , and then the value is unknown. The shooting scheme fixes , integrates backwards, and tunes so that the boundary condition (13) at holds in the limit. For fixed the approximations need not converge as (the slope at can diverge), so and must be coupled through .
The hard step is Proposition 8. Each has kinks at every grid point, yet the limit has to be differentiable. One has to show that the left and right derivatives of the concave limit coincide and equal the right-hand side of (12), which requires passing a maximum over a -dependent price set to the limit.
Formalization scope
All declarations live in the namespace WaitTimePricing.Existence, and only Mathlib is imported. Conventions:
- are and on , a disclosed strengthening of "three/two times differentiable". Assumption 1's inequalities are imposed exactly on and . and are added; the paper uses them without stating them.
- , meaningful for . , , and are defined by their characterizing sets, not by closed forms. Propositions 1–2 are theorems about these sets.
- The objective is one of Lemma 1's two cases. The paper's remark that any satisfying (V1)–(V2) would do is not formalized, because it silently needs continuity of .
- Every "max" in (12), (13), (19) and (22) is a real supremum over . For the continuous used here this set is nonempty and bounded, and the supremum is attained.
- is never a default-valued derivative. (12) and (14) assert that has the prescribed derivative, two-sided for and ; Proposition 8 states the case with a right derivative.
- Algorithm 1 is a recursion over the passes of its loop, with . The initialization (16) is extended from to so that (14) can hold as printed on . Only values on enter the loop, so the construction is unchanged.
- and are defined as limits that take a default value when the limit does not exist. Propositions 5–6 and the goal assert the convergence.
- "Decreasing" is nonincreasing everywhere (including , Proposition 2(iii)), the reading the proofs establish.
Trivializations ruled out. The goal names the paper's and together with their convergence, not an arbitrary solution and not default values of undefined limits. It cannot be met at a kink through a default-valued derivative. Its inner maxima cannot vanish through an empty or unbounded set. and are not closed forms that would make (8) true by definition. The weaker statement "some solves (12)–(15)" is not the goal.
Contributions are welcome at every milestone. Reusable pieces include monotonicity of a max-operator under backward induction, Dini-type uniform convergence of monotone sequences of equi-Lipschitz concave functions, and the differentiability of a concave limit of piecewise-linear functions. Theorem 2 (optimality over predictable controls) and Theorem 3 (policy structure) are outside this mission. Theorem 3 appears to fail as printed when .
Selected references
- C.-A. Lin, K. Shang, P. Sun, Wait Time Based Pricing for Queues with Customer-Chosen Service Times, SSRN 3709573, version of October 12, 2020. https://ssrn.com/abstract=3709573 (journal version: Management Science, https://doi.org/10.1287/mnsc.2022.4474)
- D. W. Low, Optimal dynamic pricing policies for an M/M/s queue, Operations Research 22(3), 1974. https://doi.org/10.1287/opre.22.3.545
- I. C. Paschalidis, J. N. Tsitsiklis, Congestion-dependent pricing of network services, IEEE/ACM Transactions on Networking 8(2), 2000. https://doi.org/10.1109/90.842140
- J. Kim, R. S. Randhawa, The value of dynamic pricing in large queueing systems, Operations Research 66(2), 2018. https://doi.org/10.1287/opre.2017.1668
- D. P. Bertsekas, Dynamic Programming and Optimal Control, 2nd ed., Athena Scientific, 2000. http://www.athenasc.com/dpbook.html