In-Queue Priority Purchase

Abstract

The extant priority-purchasing literature has restricted attention to the case where the only epoch for customers to purchase priority is upon arrival, and if customers choose not to upgrade when they arrive, they cannot do so later during their wait. A natural alternative is to let customers pay and upgrade to priority at any time during their stay in the queue, even if they choose not to do so initially. For instance, visitors to the London Eye could purchase a fast-track ticket at any point in their waiting process. Likewise, USCIS could allow a petitioner to file a request of expedited processing at any time after submission, not just at the moment of submission. If in-queue priority purchase is enabled, an immediate follow-up design question is whether to let customers in the regular line upgrade all at once (i.e., simultaneously) or one at a time (i.e., sequentially). In light of these considerations, this chapter examines the following two questions regarding in-queue priority purchase: (1) how will customers behave if they can upgrade to priority at any time during their wait in the queue? (2) how will rules on the specific timing of priority upgrade (i.e., simultaneous vs. sequential) impact customer behavior? This chapter is primarily based on Wang et al. (Queueing Syst 97:343–381, 2021) where interested readers can find proofs of the findings shown in this chapter.

1 Introduction

This chapter is based on Wang et al. (2021) and builds a queueing-game-theoretic model that explicitly captures self-interested customers’ dynamic in-queue priority-purchasing behavior. In-queue decisions give customers more flexibility and make the pay-for-priority option always available—even after customers join the system. Modeling the behavior of dynamic in-queue priority-purchasing is no easy task. When deciding whether to purchase priority, customers must make a delicate trade-off between the priority premium they pay and the waiting time they expect to save, which, in turn, depends on how many other customers are seeking service and competing for priority. Additionally, self-interested customers must take into account all possible future events of the queue and decide not only whether to purchase priority (as in the upon-arrival case in the literature) but also when to do so (assumed away by the upon-arrival case). These actions, in turn, shape the underlying queueing dynamics. Capturing this feedback loop necessitates (challenging) equilibrium analysis.

In this chapter, we formulate the problem of in-queue priority purchases as a dynamic game played by homogeneous customers in a queueing system. We first consider a simultaneous upgrade rule whereby customers who have not yet upgraded to priority simultaneously decide whether to upgrade at any time while they are waiting in the queue. We show that any threshold strategy cannot be sustained in equilibrium under some intuitive criteria. Furthermore, we introduce a tractable small buffer system that can hold at most two customers (including the customer in service). We analytically confirm, without assuming intuitive criteria, that such a small buffer system indeed cannot support a pure-strategy equilibrium in which some customers purchase priority.

Next, we consider an alternative sequential upgrade rule whereby each time there is a new customer arrival, the service provider sequentially asks non-priority customers one by one whether to purchase priority, with the first customer in line being called upon first, then the second one, and so on. Today’s mobile Internet makes it exceedingly easy to manage such a system efficiently. We first introduce the cases of sufficiently light traffic and sufficiently heavy traffic. Under sufficiently low traffic, customers can effectively act myopically by ignoring future arrivals. We establish the existence of a pure-strategy equilibrium of the following structure: each time the arrival of a new customer causes the low-priority queue length to tentatively reach a given threshold (given in closed form), the second last customer (and no one else) upgrades; the newcomer will be the next customer to upgrade if the low-priority queue length temporarily reaches the threshold again (due to an arrival) before the newcomer is served. This equilibrium structure implies that the low-priority queue length can never exceed the above threshold (and can only temporarily stay at the threshold). This property is preserved under any traffic intensity in equilibrium even though the maximum low-priority queue length would likely decrease with traffic. In particular, under sufficiently heavy traffic, we show that when the priority price is not too high, the equilibrium is such that as soon as the ordinary queue amasses two customers, the first ordinary customer upgrades to the priority queue. We then again turn to a small buffer system that can hold at most two customers and analytically characterize the pure-strategy equilibrium for any traffic intensity.

Finally, we numerically solve for the pure-strategy equilibrium of sequential in-queue priority purchases in a system that can hold at most three customers under various traffic intensities and priority prices. We find instances in which as soon as the number of ordinary customers reaches three, it triggers the upgrade of the very first customer but not the second or third customer, defying the equilibrium structure previously identified. Nevertheless, we numerically observe that in such a system (sequential), in-queue priority purchases still generate less revenue than upon-arrival priority purchases, corroborating the analytical insight gleaned from the small buffer system.

While we study customers’ in-queue priority-purchasing behavior, a few other recent papers consider customers’ in-queue reneging decisions, e.g., see Assaf and Haviv (1990), Afèche and Sarhangian (2015), Maglaras et al. (2017), Ata and Peng (2018), and Cui et al. (2022) for various theoretical models of reneging. Specifically, Afèche and Sarhangian (2015) study the reneging behavior in priority queues, who assume two exogenously fixed streams of customers (ordinary and priority) arriving to a priority queue without any priority premium involved, and study how being bumped by the priority customers triggers in-queue reneging behavior of the ordinary customers (the priority customers may balk upon arrival but do not have any incentive to renege after joining).

2 Model Description

Consider an M/M/1 service system. Customers arrive at the system according to a Poisson process with rate $\lambda$. The service times are independent and exponentially distributed with rate $\mu$. Customers do not balk or renege. Hence, we focus on the case $\lambda <\mu$ to ensure system stability. Customers are delay-sensitive and their waiting cost per unit time is C. Consistent with the literature, the values of $\lambda$, $\mu$, and C are common knowledge.

By default, each customer upon arrival is an ordinary customer, i.e., a non-priority customer, and decides whether and when to purchase priority throughout her stay in the system (from the arrival epoch to the departure epoch). The priority price is $P({>}0)$ and is nonrefundable. Hence, the decision to upgrade to priority is irrevocable. Once an ordinary customer purchases priority, she becomes a priority customer and obtains preemptive priority for service over all other ordinary customers. The queue disciplines within the ordinary and priority lines are both FIFO. The state of the system is described by $\{N_{o},N_{p}\}$, where $N_{o}\in \mathbb {N}_0:=\{0\}\cup \mathbb {N}$ and $N_{p}\in \mathbb {N}_0$ correspond to the number of ordinary customers and the number of priority customers in the system (including the one in service, if any), respectively. Throughout her time in the system, each customer observes the system state and her position in the queue.

Customers are fully rational in our model in that (i) they act to maximize their own expected utility (or equivalently, minimize the expected cost) at any given time upon and after arriving to the system, and (ii) they take into consideration the actions of other customers, including the current customers in the system as well as any future arrivals. To that end, customers are able to calculate the probabilities for all different sample paths according to which the system evolves. Given that the priority premium is nonrefundable, once any customer has purchased priority, they have no more actions to take. We consider two different rules that can be imposed on the specific timing of priority upgrades: the simultaneous upgrade rule and the sequential-upgrade rule .

3 Simultaneous Upgrade Rule

In this section, we consider a simultaneous upgrade rule specified as follows. Each ordinary customer in the system continuously evaluates the options of purchasing and not purchasing priority—until she either upgrades to priority or completes service. The evaluation and priority upgrade are instantaneous. Thus, at any time point, all (ordinary) customers simultaneously decide whether to upgrade to priority.

When multiple ordinary customers decide to upgrade, it is imperative to specify the order in which these customers join the priority line, i.e., their service order (because the order affects the calculation of customers’ expected utilities and hence the equilibrium analysis). We adopt the first-come-first-upgrade rule, i.e., customers who upgrade at the same time will join the priority line according to their order of arrival to the system, which is also their order in the ordinary line. First-come-first-upgrade is arguably the fairest and most natural rule for customers.

3.1 Equilibrium Definition

We set up the in-queue priority-purchasing problem under the simultaneous rule as a dynamic game. We focus on Markovian priority-purchasing strategies that depend on the system state $\{N_o, N_p\}$ (i.e., the numbers of ordinary and priority customers in the system), and the position of a given customer within the ordinary line (due to the first-come-first-upgrade rule). The information set an ordinary customer acts on can thus be described by a three-dimensional position vector $(i,j,k)$, where $i\in \mathbb {N}$ indicates the position of the customer in the ordinary line including any ordinary customer at the server, $j\in \mathbb {N}_0$ the number of ordinary customers behind her in the ordinary line, and $k\in \mathbb {N}_0$ the number of customers already in the priority queue. For example, if the only customer in the system is an ordinary customer at the server, then her position vector is $(i,j,k)=(1,0,0)$. By definition, at any system state $\{N_o, N_p\}$ with $N_o\ge 1$, any ordinary customer’s position vector $(i,j,k)$ must satisfy $i+j = N_o$ and $k = N_p$.

Given the position vector $(i,j,k)$, each ordinary customer chooses between “Yes” (for purchasing priority) and “No” (for not purchasing priority). A (Markovian) strategy$\sigma : \mathbb {N}\times \mathbb {N}_0\times \mathbb {N}_0\rightarrow \{Y, N\}$ is a mapping from the position vector $(i,j,k)$ to a Yes or No priority-purchasing action. We use $\Sigma$ to denote the strategy space. Because customers are homogeneous, we consider symmetric (pure) strategies. When all customers follow strategy $\sigma$, we call system state $\{N_o,N_p\}$ a stable state under$\sigma$ if and only if (i) $N_o=0$, or (ii) $N_o>0$ and $\sigma (i,N_o-i,N_p)=N$ for all $i\in \{1,2,\ldots ,N_o\}$. That is, at a stable state (under $\sigma$), the strategy $\sigma$ specifies that all of the ordinary customers, if any, do not purchase priority (i.e., to stay “stable”). A system state that is not stable under $\sigma$ will be referred to as a transient state under$\sigma$. See Fig. 7.1 for an illustration of the system dynamics when customers follow a specific strategy.

Fig. 7.1

System dynamics as an arrival occurs, assuming customers follow strategy $\sigma$ specified in each box

Define the value function $V(i, j, k): \mathbb {N}\times \mathbb {N}_0\times \mathbb {N}_0\rightarrow \mathbb {R}$ as the expected utility (or the continuation value) of an ordinary customer at position $(i, j, k)$. We use $\mathcal {V}$ to denote the value-function space. Note that $V(i, j, k)$ is time-homogeneous because the underlying queueing system evolves according to a time-homogeneous Markov chain.

Definition 1

A symmetric pure-strategy equilibrium under the simultaneous upgrade rule is characterized by any strategy and value-function pair $(\sigma , V)\in \Sigma \times \mathcal {V}$ that satisfies Conditions (7.1), (7.3a)–(7.3b), (7.4), and (7.5):

(7.1)

where $(i',j',k')$ is as specified by

(7.2)

In particular, $\forall (i, j, k)\in \mathbb {N}\times \mathbb {N}_0\times \mathbb {N}_0$, if $\sigma (s,i+j-s,k)=N$ for all $s=1,\ldots ,i+j$, then:

$$\displaystyle \begin{aligned} V(i,j,k) &= -\frac{C}{\lambda+\mu} + \frac{\mu}{\lambda+\mu} V(i,j, k-1) \\ &\quad + \frac{\lambda}{\lambda+\mu} V(i,j+1, k), \quad \forall (i, j, k)\in\mathbb{N}\times\mathbb{N}_0\times\mathbb{N}, {} \end{aligned} $$

(7.3a)

$$\displaystyle \begin{aligned} V (i,j,0) &= -\frac{C}{\lambda+\mu} + \frac{\mu}{\lambda+\mu} V (i-1,j, 0) \\ &\quad + \frac{\lambda}{\lambda+\mu} V (i,j+1, 0), \quad \forall (i,j)\in \mathbb{N}\times\mathbb{N}_0, {} \end{aligned} $$

(7.3b)

$$\displaystyle \begin{aligned} V (0,j,0)\equiv 0,\quad \forall j\in \mathbb{N}_0, {} \end{aligned} $$

(7.4)

(7.5)

where $(i',j',k')$ is as specified by (7.2). □

In Definition 1, Conditions (7.1), (7.3a)–(7.3b), and (7.4) pin down the value function V  (through a system of linear equations) for a given strategy $\sigma$. Specifically, Condition (7.1) gives recursive formulas of the value function when state transitions occur due to priority upgrades without changing the total number of customers in the system. If $\sigma$ requires that an ordinary customer with position $(i,j,k)$ purchase priority at the cost of premium P, then she will join the priority line with the position in the priority line according to the first-come-first-upgrade rule, which means she must wait behind the orignal k priority customers and all upgraders who are originally ahead of her. Her expected waiting cost until service completion is thus . If instead she chooses not to purchase priority, her position vector changes from $(i,j,k)$ to $(i',j',k')$ as specified by (7.2), which indicates that her updated position $i'$ in the ordinary line is her original position i less than the number of upgraders who are originally ahead of her; the updated number of customers waiting behind her $j'$ is the original number j less than the number of upgraders who are originally behind her; and the updated number of priority customers $k'$ is the original number k plus the total number of upgraders.

Note that Condition (7.1) is applicable to both transient and stable states, although for a stable state, it would simply give a trivial identity equation, i.e., $V (i,j,k) = V (i,j,k)$. Hence, Conditions (7.3a)–(7.3b) add to Condition (7.1) by specifying the recursive formulas of the value function for stable states (in which everyone in the ordinary line chooses “N” according to $\sigma$). A stable state evolves if and only if an arrival or departure event occurs, which (unlike transitions in Condition (7.1)) changes the total number of customers in the system. Specifically, the mean time till the next (arrival or departure) event is $1/(\lambda + \mu )$, during which each ordinary customer incurs a waiting cost of C per unit of time. If an event occurs, it is an arrival with probability $\lambda /(\lambda +\mu )$, in which case, the number of customers waiting behind any ordinary customer is incremented by one. On the other hand, with probability $\mu /(\lambda +\mu )$, a departure occurs as the next event, in which case, either the number of priority customers is decremented by one if originally there is at least one priority customer (see Condition (7.3a)) or the position of any ordinary customer moves up by one otherwise (see Condition (7.3b)). On the other hand, Condition (7.4) specifies boundary conditions for absorbing states of service completion.

Note that while the value function V  is determined by Conditions (7.1), (7.3a)–(7.3b), and (7.4) for a given strategy $\sigma$, there is no guarantee that $\sigma$ is an equilibrium. Hence, Condition (7.5) acts as a consistency check that ensures the continuation value $V(i,j,k)$ is indeed the maximum expected utility any customer with position $(i,j,k)$ can obtain (even if they could choose differently than $\sigma (i,j,k)$), provided that all other customers follow $\sigma$. That is, when all customers adopt $\sigma$, no one can strictly improve their expected utility at any position $(i,j,k)$ by unilaterally deviating from the action specified by $\sigma (i,j,k)$, which implies that the best response to $\sigma$ coincides with $\sigma$ itself. Taken together, Conditions (7.1), (7.3a)–(7.3b), (7.4), and (7.5) close the feedback loop to qualify $\sigma$ as an equilibrium strategy.

3.2 Analysis

The strategy space and the value-function space of the game are massive. To facilitate equilibrium analysis, we first propose three intuitive criteria on value functions. This enables us to focus on a reasonable subspace of $\Sigma \times \mathcal {V}$ that complies with these criteria.

Intuitive Criteria

We propose three intuitive criteria on value functions as follows:

Criterion 1

$V(i+1,j,k)\leq V(i,j,k)$.

Criterion 2

$V(i,j+1,k)\leq V(i,j,k)$.

Criterion 3

$V(i-1,j,k+1)\leq V(i,j,k)$.

Criterion 1 states that all else being equal, an ordinary customer does not receive a higher expected utility when there are more customers ahead of her in the ordinary line. Criterion 2 specifies that all else being equal, an ordinary customer does not receive a higher expected utility when there are more customers behind her in the ordinary line. Criteria 1 and 2 are consistent with the intuition that a non-priority customer cannot be better off with a more congested system (corresponding to more potential competitors for priority). On the other hand, Criterion 3 states that for an ordinary customer, when the number of ordinary customers ahead of her in the ordinary line and the number of priority customers in the priority line add up to a constant, the customer (weakly) prefers the scenario with fewer priority customers. The intuition here is that any customer already in the priority line will be served before the tagged ordinary customer with certainty regardless of whether she upgrades, whereas a customer ahead of her in the ordinary line may not be served before her if she upgrades in a timely manner and the other person does not.

Roadmap

The rest of this section is devoted to proving that pure equilibrium strategies do not exist under the intuitive criteria. In particular, we proceed with the following two-step approach which is also illustrated by the corresponding Venn diagrams in Fig. 7.2.

Fig. 7.2

Illustration of the analytical roadmap

Step 1. :

We establish that any pure-strategy equilibrium subject to intuitive criteria must be of a state-dependent threshold type. In particular, combining the equilibrium conditions from Definition 1 (which characterize a subset of $\Sigma \times \mathcal {V}$, denoted by $\mathcal {E}$) with the three intuitive criteria (corresponding to set $\mathcal {I}$), we show that if a pure-strategy equilibrium exists, it must be of a state-dependent threshold type (the set of such threshold strategies is denoted by $\mathcal {T}$). That is, Step 1 shows that if $(\mathcal {E} \cap \mathcal {I}) \neq \varnothing$, then $(\mathcal {E} \cap \mathcal {I}) \subseteq \mathcal {T}$.

Step 2. :

We show that any state-dependent threshold strategy cannot be an equilibrium, i.e., $(\mathcal {E} \cap \mathcal {T}) =\varnothing$. The result implies $(\mathcal {E} \cap \mathcal {I}) \nsubseteq \mathcal {T}$, and by the contrapositive argument of Step 1, we can conclude that $(\mathcal {E} \cap \mathcal {I}) =\varnothing$. That is, there does not exist any pure-strategy equilibrium of our game that would satisfy the intuitive criteria. In other words, a pure-strategy equilibrium, even if it ever existed, would be peculiar and thus might be of little practical interest.

3.2.1 Step 1: Equilibrium Structure

In this subsection, we search for the equilibrium structure subject to Definition 1 and Criteria 1–3. Hence in this step, we treat the three intuitive criteria as underlying assumptions for all the derivations. For brevity, we do not repeatedly state in each of the formal results in Step 1 their reliance on the three intuitive criteria. We develop some supporting lemmata first.

Lemma 1

In equilibrium, under Criteria 1–3, for any system state$\{N_o,N_p\}=\{i+j,k\}$, if$\sigma (i,j,k)=N$, we must have$\sigma (i+s,j-s,k)=N$for all$s\in \{1,2,\ldots ,j\}$.

Lemma 1 implies that under any equilibrium strategy, an ordinary customer does not purchase priority unless all other customers ahead of her in the ordinary line do. This is consistent with the first-come-first-upgrade rule whereby an ordinary customer with a more advanced (resp., backward) position in the ordinary line also receives a more advanced (resp., backward) position in the priority line, when the two of them decide to upgrade to priority at the same time.

Lemma 2

In equilibrium, $V(i,j,k)- V(i,j,k+1)\geq C/\mu .$

Lemma 2 gives a lower bound for the difference between $V(i,j,k)$ and $V(i,j,k+1)$. Intuitively, when there is one more priority customer in the line (all else being equal), an ordinary customer’s expected utility is reduced by at least the waiting cost of a service period, but could be more because waiting longer in the ordinary line (if she does not upgrade) further increases the likelihood of being overtaken (by more other customers).

Lemma 3

In equilibrium,

• (i) if$\sigma (1,j,k)=N$, then$\sigma (1,j',k')=N$for all$j'\in \{0, 1, \ldots , j\}$and$k'\in \{0,1,\ldots ,k\}$;

• (ii) if$\sigma (1,j,k)=Y$, then$\sigma (1,j',k')=Y$for all$j'\in \{j, j+1,\ldots \}$and$k'\in \{k, k+1, \ldots \}$.

Lemma 3 suggests that the first customer in the ordinary line is more inclined to purchase priority when the lines are longer (either due to more customers waiting behind in the ordinary line or due to more customers waiting ahead in the priority line). Intuitively, more other customers standing in the ordinary line provide the first customer with a greater incentive to upgrade since their presence spells more competition for priority. More customers being in the priority line also motivate priority-purchasing because a longer waiting time caused by these priority customers implies that the first customer is likely to encounter more future arrivals who pose a threat as prospective competitors for priority.

Based on Definition 1 and Criteria 1–3 and using Lemmas 1–3 as stepping stones, we now establish the structure of pure-strategy equilibrium in the following Theorem 1. Note that it is a necessary condition for any equilibrium strategy under the three intuitive criteria.

Theorem 1

A pure-strategy equilibrium under the three intuitive criteria must be of a state-dependent threshold type as specified by Definition2.

Definition 2

For a weakly decreasing sequence of nonnegative integers $\{n_s\}_{s\in \mathbb {N}_0}$ such that

$$\displaystyle \begin{aligned} n_0=\infty\geq n_1 \geq n_2\geq\ldots \geq n_{(\underline{m}-1)} >n_{\underline{m}}=0=n_{(\underline{m}+1)}=n_{(\underline{m}+2)},\ldots \end{aligned} $$

(7.6)

with $\underline {m}\leq \left \lceil \frac {\mu P+C}{C} \right \rceil$, we define the following strategy $\sigma$: For any $N_o\in \mathbb {N}$ and $N_p\in \mathbb {N}_0$,

$$\displaystyle \begin{aligned} \sigma(i,N_o-i,N_p)=\left\{ \begin{array}{ll} Y & \mbox{if}\ i\in\{1,2,\ldots,\overline{n}_{\{N_o,N_p\}}\}, \\ N & \mbox{if}\ i\in\{\overline{n}_{\{N_o,N_p\}}+1,\overline{n}_{\{N_o,N_p\}}+2,\ldots,N_{o}\}, \end{array} \right. \end{aligned} $$

(7.7)

where

$$\displaystyle \begin{aligned}\overline{n}_{\{N_o,N_p\}}=\min\{s\vert N_{p}+s\leq n_{(N_o-s)}-1, s\in\mathbb{N}_0\}. \end{aligned} $$

(7.8)

Let us unpack Theorem 1. First, it states that given any state $\{N_o,N_p\}$, an equilibrium strategy is a state-dependent threshold strategy that specifies that the first and only the first $\overline {n}_{\{N_o,N_p\}}$ ordinary customers should purchase priority; see Eq. (7.7). Therefore, $\overline {n}_{\{N_o,N_p\}}$ also corresponds to the number of ordinary customers who purchase priority at state $\{N_o,N_p\}$ under an equilibrium strategy. Note that $\overline {n}_{\{N_o,N_p\}}$ is well-defined by Eq. (7.8) and $\overline {n}_{\{N_o,N_p\}}\leq N_o$ because $N_o$ is an element that belongs to the set $\{s\vert N_{p}+s\leq n_{(N_o-s)}-1, s\in \mathbb {N}_0\}$. Because only customers at the front of the ordinary line purchase priority, the FIFO service order is preserved. Second, Theorem 1 indicates that $\overline {n}_{\{N_o,N_p\}}$ should be derived for any given $\{N_o,N_p\}$ from a weakly decreasing integer sequence $\{n_s\}_{s\in \mathbb {N}_0}$that only depends on the system parameters but not the system state; see Eq. (7.8). It is easier to interpret the relationship between an equilibrium strategy and $\{n_s\}_{s\in \mathbb {N}_0}$ through the lens of an equivalent condition presented in the following Corollary 1.

Corollary 1

In equilibrium, for any given system state$\{N_o, N_p\}$, we have$\sigma (i,N_o-i,N_p)=Y$if and only if$N_p+s\geq n_{(N_o-s)}$for$s\in \{0,1,2,\ldots ,i-1\}$.

The second implication of Theorem 1 is the following Corollary 2.

Corollary 2

In equilibrium, the occurrence of a departure event in a stable state will not trigger any customer to purchase priority.

Corollary 2 follows directly from the condition in Corollary 1 because by plugging $s=0$, we know that a system state is stable if and only if $N_p<n_{N_o}$. When a departure event occurs to a stable state, i.e., $N_p$ is reduced by 1 if $N_p\geq 1$ or $N_o$ is reduced by 1 if $N_p=0$, the condition $N_p<n_{N_o}$ is preserved because $n_{N_o}$ is weakly decreasing in $N_o$ (Theorem 1).

3.2.2 Step 2: Nonexistence of Pure-Strategy Equilibria

Thus far, Theorem 1, together with Corollaries 1 and 2, has presented a clear view of the equilibrium structure—if equilibrium strategies exist. To characterize the equilibrium strategies under Criteria 1–3, it is sufficient to focus on the state-dependent threshold strategies in Definition 2. In this step, we now prove that any pure strategy given by Definition 2 cannot be sustained in equilibrium.

Theorem 2

Any pure strategy defined by Definition2cannot be sustained in equilibrium. That is,$(\mathcal {E} \cap \mathcal {T}) =\varnothing$. Furthermore, under the simultaneous upgrade rule, pure-strategy equilibria do not exist if the intuitive criteria hold. That is,$(\mathcal {E} \cap \mathcal {I}) =\varnothing$.

We will provide some intuition for why pure-strategy equilibria do not exist through the lens of a tractable small buffer system that has a buffer size $K=2$, i.e., a system that can hold at most two customers (including the customer in service if any). A firm understanding of this simplified setting will shed light on our main model that does not have a buffer limit (i.e., $K=\infty$).

3.3 A Small Buffer System

In this subsection, we analyze a small buffer system with $K=2$ to sharpen intuition. For notational convenience, we define traffic intensity $\rho \triangleq \lambda /\mu$ and normalized price $\nu _P \triangleq \mu P/c$. Since a small buffer system is always stable, we relax the assumption $\lambda <\mu$, i.e., traffic intensity $\rho$ can be less than or greater than 1.

Theorem 3

Consider a small buffer system with $K=2$ subject to the simultaneous upgrade rule. If $\nu _P>1$ , then no customer purchasing priority is an equilibrium. Otherwise, i.e., if $\nu _P\leq 1$ , there exist no pure-strategy equilibria.

Theorem 3 shows that in a small buffer system, no customer purchasing priority is an equilibrium strategy for customers when the priority price is high ($\nu _P>1$). This is intuitive because customers would never purchase priority if the priority price is higher than the maximum expected reduction in delay cost. More importantly, when the priority price is not too high ($\nu _P\le 1$), a pure-strategy equilibrium does not exist (note that this result does not rely on the intuitive criteria as an assumption). In this case, customers have conflicting interests: a customer that is ahead in the queue only has an incentive to upgrade if the customer behind her upgrades, whereas the customer that is behind in the queue only gains from upgrading if the customer ahead does not upgrade.

When buffer size K increases, “no customers purchasing priority” will be sustained in equilibrium for any $\nu _P>K-1$. On the other hand, if $\nu _P \leq K-1$, we conjecture that no pure-strategy equilibria exist. Note that as K increases, the condition $\nu _P>K-1$ becomes more difficult to satisfy. When $K \uparrow \infty$, we conjecture that there will not be any pure-strategy equilibrium for any $P>0$ (we have proved this under the caveat of three intuitive criteria in Theorem 3).

The nonexistence of pure-strategy equilibria implies that the simultaneous upgrade rule may be troublesome to implement. Similar phenomenon can be found in ticket queues, where Kerner et al. (2017) prove that any threshold strategies cannot be an equilibrium. In addition, the simultaneous rule requires real-time updates of system states without delay (as all the customers move at the same time), which may also pose implementation challenges.

4 Sequential Upgrade Rule

In this section, we consider an alternative, sequential upgrade rule specified as follows. Each time a new customer arrives, the service provider sequentially asks each ordinary customer one at a time whether they wish to purchase priority, with the first customer in line being called upon first, then the second one, and so on, until all the ordinary customers are asked. Unlike the simultaneous upgrade rule, customers in this case cannot purchase priority until it is their turn. They have a single opportunity to upgrade each time a new customer arrives, and if they choose not to upgrade this time, they must wait until the next customer arrival for a new upgrade opportunity. The sequential upgrade rule can be implemented with the aid of today’s mobile Internet, which may efficiently automate the inquiry and upgrade process.

4.1 Equilibrium Definition

We set up the in-queue priority-purchasing problem under the sequential rule as a dynamic game. Consider an ordinary customer whose position vector is $(i,j,k)$, where i is the number of ordinary customers ahead of and including her; j, the number of ordinary customers behind her; and k, the number of priority customers. When it is her turn to upgrading, we define her (Markovian) strategy to be $\sigma (i,j,k)\in \{Y,N\}$, where “Y ” indicates “upgrade” (or purchase priority) and “N” indicates “no.” Note that in most sequential games, it is necessary to specify a player’s strategy as a function of the possible strategies of all the other players who move before she does (which would be cumbersome). However, in our case, this information is subsumed by a customer’s position vector when she is about to decide on upgrading. In other words, what matters to a customer is not how she reaches her position vector, but what the position vector is at the moment of decision-making. Therefore, for our purpose, it suffices to condition customer strategies only on the position vectors, instead of tracking the history of previous customers’ moves.

Next, we define the value function. Let $V_x(i,j,k)$ denote the expected utility of a customer with position vector $(i,j,k)$ when the x-th ordinary customer is about to decide on upgrading, for $x=1,\ldots ,i+j+1$. Specifically, $V_i(i,j,k)$ is the expected utility of customer $(i,j,k)$ when it is her turn to upgrade (right before she acts); $V_{i+j+1}(i,j,k)$ is the expected utility of customer $(i,j,k)$ when the upgrade process is complete (i.e., after all the ordinary customers have been asked).

Definition 3

A symmetric pure-strategy equilibrium under the sequential upgrade rule is characterized by any strategy and value-function pair $(\sigma , V)$ that satisfies Conditions (7.9)–(7.13):

$$\displaystyle \begin{aligned} &V_{x}(i,j,k)\\& \kern-0.5pt= \kern-0.5pt\begin{cases} V_{x}(i\kern-0.5pt-\kern-0.5pt1,j,k\kern-0.5pt+\kern-0.5pt1), & \text{if }\sigma({x,i\kern-0.5pt+\kern-0.5ptj-x,k})\kern-0.5pt=\kern-0.5ptY,\\ V_{x\kern-0.5pt+\kern-0.5pt1}(i,j,k), & \text{otherwise}, \end{cases} \\ &\qquad \forall x\kern-1pt=\kern-0.5pt1,\ldots,i\kern-0.5pt-\kern-0.5pt1, i\ge 2, (j, k)\in\mathbb{N}_0\kern-0.5pt\times\kern-0.5pt\mathbb{N}_0, {} \end{aligned} $$

(7.9)

$$\displaystyle \begin{aligned} V_{i}(i,j,k) = \begin{cases} -\frac{c(k+1)}{\mu}-P, & \text{if }\sigma({i,j,k})=Y,\\ V_{i+1}(i,j,k), & \text{otherwise}, \end{cases}\quad \forall (i, j, k)\in\mathbb{N}\times\mathbb{N}_0\times\mathbb{N}_0, {} \end{aligned} $$

(7.10)

$$\displaystyle \begin{aligned} & V_x(i,j,k)\\ &\,\kern-1pt=\kern-1pt \begin{cases} V_{x} (i,j\kern-1pt-\kern-1pt1,k\kern-1pt+\kern-1pt1), & \text{if }\sigma({x,i\kern-1pt+\kern-1ptj\kern-1pt-\kern-1ptx,k})\kern-1pt=\kern-1ptY,\\ V_{x\kern-1pt+\kern-1pt1} (i,j,k), & \text{otherwise}, \end{cases}\\ &\qquad \forall x\kern-1pt=\kern-1pti\kern-1pt+\kern-1pt1\ldots, i\kern-1pt+\kern-1ptj, (i, j, k)\kern-1pt\in\kern-1pt\mathbb{N}\kern-1pt\times\kern-1pt\mathbb{N}\kern-1pt\times\kern-1pt\mathbb{N}_0,{} \end{aligned} $$

(7.11)

$$\displaystyle \begin{aligned} V_{i+j+1}(i,j,k) &= -\frac{C}{\lambda+\mu} + \frac{\mu}{\lambda+\mu} V_{i+j+1}(i,j, k-1) \\&\quad + \frac{\lambda}{\lambda+\mu} V_1(i,j+1, k), \quad \forall (i, j, k)\in\mathbb{N}\times\mathbb{N}_0\times\mathbb{N}, {} \end{aligned} $$

(7.12a)

$$\displaystyle \begin{aligned} V_{i+j+1}(i,j,0) &= -\frac{C}{\lambda+\mu} + \frac{\mu}{\lambda+\mu} V_{i+j} (i-1,j, 0) \\&\quad + \frac{\lambda}{\lambda+\mu} V_1 (i,j+1, 0), \quad \forall (i,j)\in \mathbb{N}\times\mathbb{N}_0, \end{aligned} $$

(7.12b)

$$\displaystyle \begin{aligned} V_{j+1} (0,j,0) &\equiv 0,\quad \forall j\in \mathbb{N}_0, {} \end{aligned} $$

(7.12c)

$$\displaystyle \begin{aligned} V_{i}(i,j,k) = \max\left\{-\frac{c(k+1)}{\mu}-P, V_{i+1}(i,j,k)\right\},\quad \forall (i, j, k)\in\mathbb{N}\times\mathbb{N}_0\times\mathbb{N}_0.\quad \hfill \square {} \end{aligned} $$

(7.13)

In Definition 3, Conditions (7.9) specify the state transition due to the action of the x-th ordinary customer who moves before customer $(i,j,k)$ does. If the x-th ordinary customer upgrades, then customer $(i,j,k)$’s position vector becomes $(i-1,j,k+1)$ (because now there is one fewer ordinary customers ahead of her but one more customer in the priority line). Note that the next customer who gets to choose whether to upgrade is still the x-th customer in the ordinary line as the original x-th customer joins the priority line. If the x-th ordinary customer does not upgrade, then customer $(i,j,k)$’s position vector is unchanged before the next customer upgrades, and now the next customer will be the $(x+1)$-th customer in the ordinary line. Conditions (7.10) specify the state transition due to customer $(i,j,k)$’s action. Conditions (7.11) specify the state transition due to the action of a customer who moves after customer $(i,j,k)$ does. Conditions (7.12a) through (7.12c) specify the state transition due to arrivals and departures. Note that a new arrival triggers a new round of priority upgrades starting from the first customer in the ordinary line, and therefore the subscript of the value function is reset to 1. Conditions (7.13) ensure that customers indeed maximize their expected utility by choosing strategy $\sigma$ provided that other customers choose $\sigma$. While Definition 3 applies to a system without a buffer limit, we can easily modify Conditions (7.12a) through (7.12c) by imposing boundary conditions that accommodate any finite buffer K.

Given the complexity of the problem, it is challenging to solve for the equilibrium in general, but we can nevertheless analytically characterize the equilibrium both under sufficiently light traffic and sufficiently heavy traffic, which will shed some light on the equilibrium structure in general.

4.2 Sufficiently Light or Heavy Traffic

We first examine a case of sufficiently light traffic in which arrival rate $\lambda$ is much smaller than service rate $\mu$ (i.e., $\lambda \ll \mu$) such that customers do not need to concern themselves with future arrivals that are not yet present in the system (because $\lambda \ll \mu$ implies that any existing customers in the system will be served long before any future customers arrive). We first define a threshold-type “X-strategy” below in Definition 4.

Definition 4 (X-Strategy)

Whenever the number of ordinary customers reaches $X+1$, the X-th customer (or equivalently the second last customer) and only that customer upgrades.

Theorem 4 shows the X-strategy will arise in equilibrium under sufficiently low traffic.

Theorem 4

When$\lambda \ll \mu$, the X-strategy as defined in Definition4with$X= \lceil \nu _P \rceil$is a pure-strategy equilibrium, where$\nu _P=\mu P/C$.

Under sufficiently light traffic ($\lambda \ll \mu$), customers compete only with existing customers and can act myopically without loss of optimality. In essence, the underlying game reduces to a one-shot sequential game. To understand the equilibrium in Theorem 4, consider the example of $\nu _P=1.5$. In this case, $\lceil \nu _P\rceil =2$, which implies that the maximum stable ordinary-queue length is 2. As soon as a new customer arrives, the number of customers in the ordinary queue temporarily reaches 3, which triggers the upgrade of the second customer (while the first and third customers stay put), and the newcomer becomes the one to occupy the second position. In this simple case, it is easy to verify the equilibrium. Customer 1 loses $C/\mu$ by being overtaken, which is better than paying $P=1.5 C/\mu$ to secure her position. Given that Customer 1 does not upgrade, Customer 2 loses $0.5C/\mu$ by upgrading (paying $1.5C/\mu$ and overtaking one customer), which is better than losing $C/\mu$ by being overtaken by Customer 3 (Customer 3 would upgrade if neither Customers 1 nor 2 were to upgrade). Given that Customer 1 stays put and Customer 2 upgrades, Customer 3 is better off not upgrading as she would incur a net cost of $0.5 C/\mu$ if he were to upgrade (overtaking Customer 1 and paying $1.5C/\mu$).

Theorem 5

If and only if$\rho \ge \sqrt {\nu _P}-1$, the X-strategy as defined in Definition4with$X= 1$is a pure-strategy equilibrium, i.e., in this equilibrium, the first and only the first customer upgrades whenever the number of ordinary customers reaches 2.

Theorem 5 shows that under sufficiently heavy traffic, an equilibrium arises in which as soon as two ordinary customers are present, the first customer upgrades. Note that if the normalized priority price is low, i.e, $\nu _P\le 1$, the condition $\rho \ge \sqrt {\nu _P}-1$ will in fact be satisfied by any traffic intensity $\rho$, i.e., the aforementioned equilibrium strategy holds for any traffic intensity. In this case, since $\lceil \nu _P \rceil =1$, the equilibrium strategy is the same as the one identified in Theorem 4. Nevertheless, for $\nu _P\in (1,4)$, combining Theorems 4 and 5 indicates that the equilibrium strategy under sufficiently heavy traffic (when forward-looking customers must take into account future arrivals) disagrees with the equilibrium strategy under sufficiently light traffic (when customers can act myopically). Although the exact equilibrium strategy differs, the equilibrium structure is still the same, both belonging to the families of X-strategies.

4.3 Small Buffer Systems

In this subsection, we introduce customers’ equilibrium strategies in small buffer systems to sharpen intuition. Specifically, we first analytically introduce a queueing system that can hold at most two customers (i.e, $K=2$). We will then numerically introduce a queueing system that can hold at most three customers (i.e., $K=3$).

4.3.1 $K=2$

If a single ordinary customer is present in the queue, it is straightforward that the customer will not upgrade. Thus, since $K=2$, specifying customer strategies when there are two ordinary customers will pin down the equilibrium. Theorem 6 characterizes the pure-strategy equilibrium through a tuple in which the first (resp., second) element indicates the first (resp., second) ordinary customer’s strategy.

Theorem 6

Consider a small buffer system with $K=2$ subject to the sequential upgrade rule. The unique pure-strategy equilibrium is $(Y,N)$ if $\nu _{P}\leq 1$ and $(N,N)$ otherwise.

When the priority price is high ($\nu _P>1$), it is intuitive that no customers purchase priority. However, unlike the simultaneous case (as shown in Theorem 3), when the priority price is not too high ($\nu _P\le 1$), a pure-strategy equilibrium exists, and in equilibrium, the first customer upgrades while the second customer does not. Under the sequential upgrade rule, the first customer gets to decide first. Should she upgrade, she would lose P; should she not upgrade, the second customer would upgrade, causing the first customer to lose $C/\mu$. Since $P\le C/\mu$ (or equivalently $\nu _P\le 1$), the first customer is better off not upgrading, which, in turn, removes the incentive for the second customer to upgrade. Based on the equilibrium strategy given in Theorem 6, we further derive the priority revenue in Corollary 3 below.

Corollary 3

Consider a small buffer system with $K=2$ subject to the sequential upgrade rule. The priority revenue per unit time as a function of $\nu _P$ is given by

$$\displaystyle \begin{aligned} \Pi^{SQ}_{K=2}(\nu_P)=\left\{ \begin{array}{ll} \frac{ C \rho^2 \nu_P}{1+\rho+\rho^2}, & \mathit{\mbox{if}}\ \nu_{P}\leq 1; \\ 0, & \mathit{\mbox{if}}\ \nu_{P}> 1. \end{array} \right. \end{aligned}$$

Next, we compare the priority revenue generated from in-queue priority purchases subject to the sequential upgrade rule with that from the classical upon-arrival priority purchase under $K=2$. To be clear, in the upon-arrival priority purchase scheme, customers are presented with the option to purchase priority only upon arrival, and if they choose not to purchase the moment they arrive, they cannot do so later. The literature has shown that customers in this case follow a threshold strategy in equilibrium: they purchase if and only if the queue length they see upon arrival reaches a certain threshold. We select the Pareto-dominant equilibrium in which all customers have higher expected utility than they would in other equilibria. Note that the Pareto-dominant equilibrium effectively corresponds to the one with the highest threshold. Proposition 1 characterizes the equilibrium and the corresponding priority revenue when customers can purchase priority only upon arrival.

Proposition 1

Consider a small buffer system with $K=2$ where customers can purchase priority only upon arrival. The unique Pareto-dominant pure-strategy equilibrium strategy is given below.

• If $\nu _{P}\leq \min \{\rho ,1\}$ , then all customers purchase priority.

• If $\rho <\nu _{P}<1$ , then a customer purchases priority if and only if she sees one (ordinary) customer in the system upon arrival.

• If $\nu _{P}\geq 1$ , then no customers purchase priority.

The priority revenue per unit time as a function of $\nu _P$ is given by

$$\displaystyle \begin{aligned} \Pi^{ARR}_{K=2}(\nu_P)=\left\{ \begin{array}{ll} \frac{C \rho (1+\rho) \nu_P}{1+\rho+\rho^2}, & \mathit{\mbox{if}}\ \nu_{P}\leq \min\{\rho,1\}; \\ \frac{C \rho^2 \nu_P}{1+\rho+\rho^2}, & \mathit{\mbox{if}}\ \rho<\nu_{P}< 1; \\ 0, & \mathit{\mbox{if}}\ \nu_{P}\geq 1. \end{array} \right. \end{aligned}$$

Next, we compare the maximum revenue (by optimizing over the priority price) of upon-arrival priority purchase, $\Pi _{K=2}^{ARR}$, and that of in-queue priority purchase subject to the sequential rule, $\Pi _{K=2}^{SQ}$, where

$$\displaystyle \begin{aligned} \Pi_{K=2}^{ARR}= \max_{\nu_P} \Pi_{K=2}^{ARR}(\nu_P),\quad \Pi_{K=2}^{SQ}= \max_{\nu_P} \Pi_{K=2}^{SQ}(\nu_P). \end{aligned}$$

Theorem 7

Consider a small buffer system with$K=2$. The optimal revenue of upon-arrival priority purchases is higher than that of in-queue priority purchases subject to the sequential rule, i.e.,$\Pi _{K=2}^{ARR}>\Pi _{K=2}^{SQ}$.

Theorem 7 shows that in a small buffer system with $K=2$, the upon-arrival priority purchase scheme yields higher revenue than in-queue priority purchase, although the latter presents customers with more upgrade opportunities. Recall that in-queue priority purchases lessen customers’ fear of being overtaken if they do not purchase priority upon arrival by allowing them to defer their purchase decision. As a result, customers have less of an incentive to purchase than they would in the upon-arrival case, causing the in-queue purchase scheme to fall short of the upon-arrival purchase scheme in terms of priority revenue.

While in-queue priority purchases create more selling opportunities for the service provider, Theorem 7 tells a cautionary tale against this practice. This implies that the service provider may instead benefit from giving customers a buy-it-or-lose-it ultimatum when they arrive.

4.3.2 ${K}=3$

As a proof of concept, we numerically solve for the pure-strategy equilibrium of sequential in-queue priority purchases in a system that can hold at most three customers (i.e., $K=3$). In each numerical instance, we enumerate all the possible strategies $\sigma$; for each given $\sigma$, we solve a modified version of Conditions (7.9) through (7.12c) that accommodates the finite-buffer system of $K=3$ (a system of linear equations) for the corresponding value function V ; we then check if V  satisfies (7.13); if so, the $(\sigma ,V)$ pair is an equilibrium. In all the numerical instances tested, we have consistently found a unique equilibrium.

By Table 7.1, we observe four types of possible equilibria:

• (1) Whenever the ordinary queue length reaches 2, the first customer upgrades.

  Table 7.1 The equilibrium strategies of sequential in-queue priority purchase under various arrival rates for $K=3$

• (2) Whenever the ordinary queue length reaches 3, the first customer upgrades.

• (3) Whenever the ordinary queue length reaches 3, the second customer upgrades.

First, as the arrival rate (and thus traffic intensity) increases, customers are more prone to upgrade (in the sense that we see more Y ’s and fewer N’s). This contrasts the case of $K=2$, in which the equilibrium strategy does not vary with traffic (see Theorem 6), but makes intuitive sense because a higher traffic intensity implies that future arrivals pose a greater threat, which warrants more preemptive upgrades. Second, when $\lambda =0.5$ (a case of light traffic), the equilibrium behavior is of type (3) and indeed agrees with the one identified in Theorem 4 for sufficiently light traffic. Third, when the traffic intensity is higher ($\lambda =0.6,0.7,0.8,0.9$), the equilibrium behavior departs from what occurs under light traffic. In particular, when $\lambda =0.6,0.7,0.8$, the equilibrium is of type (2), and it is not the second (to the last) customer but the first customer who upgrades. When $\lambda =0.9$, the equilibrium is of type (1) and the queue length only needs to reach 2, instead of 3, to trigger an upgrade. Fourth, the number of priority customers (0 or 1) does not affect the equilibrium strategy, i.e., $\sigma (1,1,0)=\sigma (1,1,1)$ and $\sigma (2,0,0)=\sigma (2,0,1)$. In fact, we can analytically prove this result, as shown in Theorem 8.

Theorem 8

Consider a small buffer system with$K=3$subject to the sequential upgrade rule. In a pure-strategy equilibrium,$\sigma (1,1,0)=\sigma (1,1,1)$and$\sigma (2,0,0)=\sigma (2,0,1)$.

We caution that the result of Theorem 8 (the equilibrium strategy being independent of the number of priority customers) is likely driven by the assumption $K=3$ and is not meant to be interpreted as a general result that applies to systems with any buffer size. What is special about $K=3$ is that if there is one priority customer and two ordinary customers in the system, then the system is already full. As a result, the two ordinary customers would not be very concerned about future arrivals (because they know the next event can only be a departure). Hence, their strategy in equilibrium is no different than if the priority customer did not exist. However, this reasoning would not generalize to a system with a larger buffer, and it is reasonable to conjecture that ordinary customers would act differently should the number of priority customers in the system differ.

We also numerically compare the priority revenue generated in sequential in-queue priority purchases with that in the upon-arrival purchasing model. The results are reported in Fig. 7.3. We observe that in the system of $K=3$, sequential in-queue priority purchases still generate less revenue than upon-arrival priority purchases (for a given priority price and under the optimal priority price), which parallels the analytical insight gleaned from the small buffer system with $K=2$ (see Theorem 7).

Fig. 7.3

Comparison of priority revenues for $K=3$

5 Concluding Remarks

The extant priority-purchasing literature has restricted attention to the case where customers who would like to purchase priority must do so upon arrival to the service system. This chapter seeks to fill this gap by formulating a dynamic game that models customers’ in-queue priority-purchasing behavior. When the simultaneous upgrade rule is imposed, we find that pure-strategy equilibria do not exist under certain intuitive criteria, contrasting the extant literature which instead shows the existence and sometimes multiplicity of pure-strategy equilibria when customers can only purchase priority upon arrival.

However, when the sequential upgrade rule is implemented, pure-strategy equilibria may exist. The upgrading behavior can be complex. Under sufficiently light traffic, if the number of ordinary customers accumulates to a certain threshold, then it is always the second last customer who upgrades, but in general, it could be a customer from another position and the queue-length threshold that triggers an upgrade can also vary with the traffic intensity. Under sufficiently heavy traffic and a not-too-high priority price, as soon as two ordinary customers gather, the first customer will upgrade. Our analytical and numerical results on systems with relatively small buffers consistently show that in-queue priority purchases do not yield as much revenue as upon-arrival priority purchases.