Joining strategies under two kinds of games for a multiple vacations retrial queue with N-policy and breakdowns

Motivated by cost control and information guidance, in this work, we study a multiple vacations retrial queue with N-policy and breakdowns. This service system has the characteristics that there is no waiting space in front of the server and the waiting list is virtual. If the arriving customer finds that the system is available, he immediately receives the complete service. Otherwise, the customer leaves the system or joins the orbit (virtual waiting list). For cost control, the system is activated only when the current vacation is completed and at least N customers are waiting in the system, otherwise, the server continues to the next vacation until the number of customers in the system is not less than N. Two types of customer joining cases apply to this paper, i.e., non-cooperative customers aim to optimize individual interests, and the social planner in the cooperative case considers the profit of the whole service system. The equilibrium joining strategy for the non-cooperative case and the socially optimal joining strategy for the cooperative case are determined. Since it is difficult to obtain analytical characterization, an improved particle swarm optimization (PSO) algorithm is used to explore the impact of system parameters on the profit of the service provider. At the same time, a large number of numerical experiments visualize the influence of parameters on the system.


Introduction
In many service systems, behavioral analysis of the arriving customers' decision whether to join an unavailable system (where service seats are occupied) or leaving forever has become a hot topic in economics in recent years. More specifically, the introduction of customers' strategic behavior in the queuing system makes the analysis of performance indicators more meaningful. Although it is not very difficult to deal with the performance analysis of various M/M/1 systems, it is still difficult to conduct game theory analysis in specific such systems. In fact, the analysis of customer game behavior requires some characteristics of the system, so it is usually very difficult for the Markov process. Furthermore, considering the customer's strategic behavior in the service system can make the customer's subjective behavior theoretical and logical. The joining strategy of customers was first studied by Naor [1]. He studied the M/M/1 system under the observable case, in which the individual's equilibrium joining strategy and social optimal joining strategy were confirmed. Subsequently, the unobservable case of Nash's work was supplemented by Edelson and Hildebrand [2]. In recent years, the research of customer joining strategy in queuing systems has been widely expanded and applied. Such as Shi and Lian [3] presented the joining strategy and socially optimal welfare of passenger-taxi in both observable and unobservable cases, catastrophe or clearing systems with equilibrium [4,5], and queueing systems with setup or vacation [6][7][8]. More specifically, the monograph of Hassin and Haviv [9] summarized a large number of related studies on joining strategies and optimal social welfare.
In many queuing service systems, their default rule is that the customers leave the system once they balk and cannot join the system again. Obviously, this rule is often not suitable for the actual service system. For example, when the customer calls the call center for the first time and encounters a busy line, the customer will try again after a random length of time. The retrial queuing system widely exists in other fields such as communication, information processing, storage management, and epidemic situation control. Kosten [10] illustrated the necessity of retrial queuing through practical applications. Jiang [11] applied a tail asymptotics approach to a matching service voting system. Phung-Duc [12] presented an M/G/1 single server retrial queue with setup time. However, there are still a few works of literature on the joining strategy and social welfare of various retrial queue systems. Economou and Kanta [13] studied joining strategies and social welfare in the M/M/1 queue with retrial. Wang and Li [14] proposed a class of cognitive radio networks with retrial behavior. Wang and Zhang [15] studied price strategy and equilibrium of a local area networking retrial queue with delayed vacations.
The conservation and effective use of resources and energy is the key to sustainable economic growth. Barroso and Holzle [16] pointed out that the proportion of energy consumed by standby equipment is also very high, it can reach 60 percent of the normal operation equipment. In the queuing service system, it is necessary to take some measures to control operating costs and labor costs, which can effectively promote the growth of social welfare. For example, threshold strategy, multiple vacations, and adjusted maintenance times are often applied to queuing systems with detailed services. Wang et al. [17] studied a batch service queuing system with finite capacity and gated policy. Guo and Hassin [18] discussed joining strategy and social optimization of a single server queueing system with N-policy. Wang et al. [19] studied customers' strategic behavior and social optimization in a constant retrial queue with the N -policy. Sun et al. [20] presented the strategies of joining and optimal balking in a Markovian queue with multiple vacations. Ye [21] presented a discrete-time Geom/Geom/1 queue with single working vacation and multiple vacations. Gao [22] considered an unreliable queuing system that adjusts maintenance time and limits idle period. Unlike the previously mentioned literature, the retrial queuing system studied in this paper takes into account the N-policy and multiple vacations. More specifically, this system has the following features: The system is activated only when the current vacation is completed and at least N customers are waiting in the system, otherwise, the server continues to the next vacation until the number of customers in the system is not less than N. Generally, in actual service systems, the server cannot immediately check the system status during the vacation state; or when the number of customers reaches the desired threshold, the server cannot immediately switch to the working state; or when the server ends the vacation, there are no (or few) customers who reach the system. At the same time, it is necessary to consider the operating cycle (lifetime) of the server for the overall benefit of the system. Therefore, the multiple vacations retrial queue with N-policy and breakdowns is considered in this paper; it has a wide range of applications in actual service systems.
There are the cooperative case and the non-cooperative case for the customers to join the system with each other. In the non-cooperative case, the goal of each individual is to obtain their own maximum expected net benefit based on the reward-cost structure. Obviously, if the server is unavailable upon arrival, the customers need to decide whether to join the system or leave forever. If the customer's expected net benefit is positive, then the customer will not hesitate to join the system, otherwise, the customer chooses to balk. If the expected net benefit equals zero, the customer is indifferent to join the orbit or balk. In the cooperative case, the social planner wants the customers to cooperate with each other in order to get the best social welfare for the whole system. Some existing research results ( [7,13,19]) indicate that the optimal social joining probability does not exceed the individual's equilibrium joining probability, or the optimal social arrival rate does not exceed the individual's equilibrium arrival rate, i.e., the customers find the server unavailable upon their arrival, the customers in the non-cooperative case are more willing to join the system than the customers in the cooperative case. The result is that social benefits do not reach the expected maximum by the social planner in the non-cooperative case.
The proposed model has a potential application in an order-based production system. In order to avoid equipment wear and tear and unprofitable production, the factory's production lines will only be activated after signing the order quantity sufficient to cover all expenses. A production line is usually in four periods: Vacation, busy, idle, and repair. The vacation period is usually used to accumulate enough orders to cover all expenses, so the production line will not be activated when the order quantity does not accumulate to a certain amount. The idle period is used to prepare production materials for signing orders. The busy period is used to produce orders signed. In the process of production order, equipment may break down due to parts wear or service life. If the equipment breakdown occurs, the equipment is immediately sent for repair, the order which has interrupted service due to breakdown, continues to receive the remaining service after the equipment is repaired. If an idle production line's surplus material can make a new arrival order, the production line can directly complete the order. New orders that arrive during the busy period and the repair period can be joined the waiting list or abandon the factory contract. The new order is independent of other orders and is completed on the first-come, first-served (FCFS) discipline. In this scenario, orders, waiting list, the new order is independent of other orders and is completed on the FCFS principle, equipment breakdown, equipment repair time, the production line of the factory, and order quantity sufficient to cover all expenses corresponding to the customers, the orbit, retrial policy, server breakdown, repair time, the server, and N-policy, respectively, in the queueing terminology. The characteristics and contributions of this model considered in this paper are as follows: • This article considers a multiple vacations retrial queue with N-policy and breakdowns, it coincides with the actual service system. • Two types of customer joining cases apply to this paper, i.e., non-cooperative customers aim to optimize individual interests, and the social planner in the cooperative case considers the profit of the whole service system. • The equilibrium joining strategy for the non-cooperative case and the socially optimal joining strategy for the cooperative case are presented in this paper. • The improved PSO algorithm is used to visualize the impact of system parameters on the profit of service providers. • Both the model itself and the numerical experiment have certain guiding significance for the actual service system, this model is suitable for emergency disaster or epidemic control.
The rest of this paper is organized as follows. Section 2 gives a detailed description and parameter representation of this model. The steady-state distribution of the system and the mean orbit sizes are determined in Section 3. Section 4 obtains equilibrium joining strategies in the non-cooperative case and optimal joining strategies in the cooperative case. Section 5 focuses on the profit of the service provider and gives a simple description of PSO algorithms. Section 6 uses a large number of numerical experiments to show the influence of parameters on the two joining probabilities, social welfare, and the profit of the service provider. Section 7 presents the discussion and further study.

Model description
In this paper we consider a constant retrial queuing system with multiple vacations, N-policy, and breakdowns. Assumes the arrival of potential customers according to the Poisson process with rate λ. There is no waiting area in front of the server. Upon arrival, if the server is available ( idle state), the arriving customer will immediately receive the service and leaves the system upon the completion of the service. Otherwise, if the server is unavailable (vacation state or busy state or repair state), the arriving customer would enter an infinite capacity orbit with probability q or leave the system forever with probability q = 1−q, this virtual orbit is similar to a waiting list. The first customer in the orbit asks for service according to the first-come, first-served (FCFS) discipline with a Poisson flow of retrials of rate θ. The idle server will take an exponential time of rate θ to access (or search) the list customer to provide the service. However, if a new customer arrives during the search process, the server will abandon the search and immediately serves this new customer. The server may breakdown due to parts wear or service life during the service of customers. The life time of the server is exponentially distributed with rate α. If the server breakdown occurs, the server is immediately sent for repair, and the repair time follows an exponential distribution with rate γ. The customer who have interrupted service due to breakdown, continue to receive remaining service after the server is repaired. The service time for all (new or repeated) customers is exponentially distributed with the common rate µ, and all service times are independent.
On the other hand, the server in vacation state does not provide any services to arriving customers, and will not be activated until there are no less than N customers in the orbit after completing the current vacation. If the server finds less than N customers in the orbit at the end of the current vacation, the server will start another new vacation until no less than N customers in the orbit. Once all customers are served, or the system becomes empty, the server starts a vacation of random length V, which is assumed to be exponentially distributed with rate ξ. So we can define this type of queue system as M/M/1/MV constant retrial queueing system with N-policy and breakdowns. Once the server is activated, all customers in the system receive the complete service, and the server turns to vacation state after serving all customers.
Let S (t) be the state of the server at time t,  Figure 1. Figure 1. Transition rate diagram of the Markov chain {(S (t), N(t)), t ≥ 0}.

Remark 1.
It is worthwhile to mention that if q = 0, then the model degenerates to a system with a single state (0, 0). In this case, all customers will balk. Also, according to the above description, N should be at least equal to 1. Otherwise, the system will be the degenerated one too.
We consider every customer has a reward-cost structure. When a customer arrives, the customer can decide whether to join the system according to the reward-cost structure. It is assumed that the customers are the same except that the arrival time is unexpected. With this structure, every customer received a reward of R units upon the completion of the service. However, a waiting cost of C per unit time is charged for the waiting in the orbit for each customer. In addition, the server imposes a price p, announced to all incoming customers, for each customer to enter the system. Assume that customers are risk neutral and want to maximize their expected benefits. Upon arrival, the customer has to weigh the difference between gain and expenditures (waiting cost and announced price), the customers can evaluate the value and decide whether to enter the system or not. Obviously, the customer is more willing to join the system when all the expenses are less than the reward, while all the expenses are more than the reward, the customer does not enter the system. On the other hand, the customers are indifferent if the reward is equal to all expenses. In addition, in a sense, the customer's decision is immutable, which means that customers who join the system cannot exit, and customers who balked can not retry. So, this system can be regarded as a game between the customers. The server preannounces the price of p in order to know how it affects the customer's behavior. For our analysis to be meaningful, we assume that R > p, (2.1) which ensures that the customers alway join the system if they find that the server is idle upon their arrivals. We can refer to this literature [13] to get the necessary and sufficient stability condition of this system as follows which is assumed throughout the paper.

Steady-state solutions
To study the joining strategies of two kindle of games, we first need to study the performance of the system. If the arriving customer chooses to join the system with probability q when finding the server is unavailable.
Theorem 1. For the M/M/1/MV constant retrial queueing system with N-policy and breakdowns in the steady state, the probabilities that the server is vacation, busy, idle and repair are given by, respectively,
Let M i be the mean orbit sizes when the server in state i (i = 0, 1, 2, 3). From (3.19), (3.26), (3.28) and (3.29), by using M i = d dz P i (z) | z=1 , and after some algebraic manipulations, we have the following Theorem 2.
Theorem 2. For the M/M/1/MV constant retrial queueing system with N-policy and breakdowns in the steady state, the mean orbit sizes when the server is on vacation, busy, idle and repair, respectively, are given by where p(0, 0) is given in (3.5).

Joining strategies in two kinds of games and pricing analysis
If the server is unavailable upon arrival, each customer needs to decide whether to join the system based on the reward-cost structure. If the arriving customer is against the will of the social planner, maximizes the individual's expected net benefit, rather than maximizing the overall benefit from the perspective of the social planner, then the customers are in the non-cooperative case. However, the social planner often wants to encourage customers to cooperate with each other to maximize the social welfare in cooperative case. In this section, we consider the joining strategies of the customers in two kinds of game cases, respectively.

Equilibrium joining strategy in the non-cooperative case
In the non-cooperative case, the arriving customer is based on a reward-cost structure with the goal of maximizing the individual benefit, when an arriving customer finds that the server is unavailable, he needs to decide whether to enter the system or not. Actually, if the expected net benefit is greater than zero, the customers are more willing to join the orbit; the customers prefer to balk if expected net benefit is less than zero; if the customers' expected net benefit equals zero, they are indifferent to join the orbit or balk. Each customer's different decisions have different impacts on other customers, and it also affects the performance measures of the system. Next, our goal is to explore the symmetric equilibrium joining strategy of the non-cooperative game between these customers.
The expected waiting time of a tagged customer who finds the server is unavailable and decides to join the orbit upon his arrival, denoted by T (q). Then we can give the following Theorem 3 about T (q).
Theorem 3. For the M/M/1/MV constant retrial queueing system with N-policy and breakdowns in the steady state, the expected waiting time of a tagged customer in the orbit, given that he finds the server is unavailable and decide to join orbit upon his arrival, T (q) is given by , Proof According to the model description, it is only available when the server is idle upon customers arrivals. Therefore, according to the Poisson arrivals see time average (PASTA) property and Theorem 1, the server unavailable probability P un upon arrival of a customer is given by P un is the probability of the server unavailable upon arrival of a customer. So, the total arrival rate of the customers in the orbit can be determined as follows .
From Theorem 2, the customers' mean number in the orbit, denoted by M, then By using Little' formula, we can get Hence, substituting (4.4) and (4.5) into (4.6), (4.1) can be obtained. Now, we obtain the expected waiting time T (q) of a tagged customer who finds the server is unavailable and decides to join orbit upon his arrival. Based on the reward-cost structure previously mentioned, the expected net benefit of a tagged customer, who finds that the server is unavailable upon arrival and decides to join the orbit, denoted by S e (q), it can be obtained as follows where T (q) is given in (4.1), and the second-order derivative of T (q) in q, given by, Obviously, T (q) is positive under the condition that the system is stable. So T (q) is strictly convex in the interval 0 ≤ q < θµγ λ(λ+θ)(α+γ) . Therefore, there is a unique global minimal point q min ∈ [0, θµγ λ(λ+θ)(α+γ) ), which makes T (q) achieve a global minimum in this interval. It follows from (4.7) that S e (q) has a unique global maximal value in this range of q (q ∈ [0, θµγ λ(λ+θ)(α+γ) ). Remark 2. Because T (q) is strictly convex under the stable condition, i.e., q ∈ [0, θµγ λ(λ+θ)(α+γ) ), and q should satisfy 0 ≤ q ≤ 1. Defined by the set Q as follows,  So in the following theorems, we will only study the range of q ∈ Q.
We are ready to describe the equilibrium joining strategies for the non-cooperative case.
Theorem 4. For the M/M/1/MV constant retrial queueing system with N-policy and breakdowns in the steady state, for any given price p < R, there exists an Nash equilibrium mixed joining strategy, i.e., the arriving customers joining the orbit of the unavailable system with probability q e , where q e have the following cases: Case I: R−p C < T (q min ). In this case, a unique equilibrium strategy q e exists: q e = 0.
Case II: R−p C = T (q min ). In this case, the equilibrium strategy is given by Case II (a): q ∈ Q 1 and q min > 1. Then, a unique equilibrium strategy q e exists: q e = 0.
Case II (b): q ∈ Q 1 and q min ≤ 1. Then, two equilibrium strategies q e exist: q e = 0 and q e = q min .
Case II (c): q ∈ Q 2 . Then, two equilibrium strategies q e exist: q e = 0 and q e = q min .
Case III: R−p C > T (q min ). Let q 1 < q 2 be the roots of S e (q) = 0 (there are two roots because of the strict concavity of S e (q) in q ∈ Q 2 ).
Case III (a): q ∈ Q 1 and q 1 > 1. Then, a unique equilibrium strategy q e exists: q e = 0.
Case III (b): q ∈ Q 1 and q 1 = 1. Then, two equilibrium strategies q e exist: q e = 0 and q e = 1.
Case III (d): q ∈ Q 2 . Then, three equilibrium strategies q e exist: q e = 0, q e = q 1 and q e = q 2 .
Proof According to the model assumption, the arriving customer encounters the idle state, who accepts the service directly, because the customer who arrives at the idle state does not generate waiting time. However, when a customer arrives and finds that the system is not available (vacation or busy or repair), he needs to decide whether to join the system or not. We have proved the strict concavity of S e (q) of q ∈ [0, θµγ λ(λ+θ)(α+γ) ) in the previously, and let q min (q min ∈ [0, θµγ λ(λ+θ)(α+γ) )) be the unique point that globally minimizes T (q) in q ∈ [0, θµγ λ(λ+θ)(α+γ) ), i.e., q min be the unique point that globally maximizes S e (q) in q ∈ [0, θµγ λ(λ+θ)(α+γ) ). Obviously, the strategy q e = 0 of balking is always an equilibrium strategy. The reason is that all customers balk, a tagged customer also prefers to balk; otherwise this tagged customer will never get service. In fact, if q = 0, the model degenerates to a system with a single state of (0, 0), then the system will never be activated. Specifically, we have the following results: (I) When R−p C < T (q min ), i.e., S e (q min ) < 0, which implies S e (q) is negative for every q ∈ Q. In this case, the best response for the tagged customer is balking, i.e., q e = 0. Thus we have the Case I.
(II) When R−p C = T (q min ), i.e., S e (q min ) = 0, which implies S e (q) is negative for every q q min . There are three cases, (a): if q ∈ Q 1 and q min > 1, which implies q min Q, the equilibrium strategy is q e = 0 of balking because of S e (q) < 0 for every q in this subcase. (b): if q ∈ Q 1 and q min ≤ 1, q min is the unique solution of the equation S e (q) = 0 in this subcase, i.e., q min is a proper mixed strategy q ∈ Q. (c): if q ∈ Q 2 , according to the previous assumption, q min must belong to the interval Q 2 , so q min is the unique solution of the equation S e (q) = 0 in this subcase, i.e., q min is a proper mixed strategy q ∈ Q. Thus we have the Case II.
(III) When R−p C > T (q min ), i.e., S e (q min ) > 0. We notice that the two limits lim q→0 + S e (q) = −∞, lim q→(θµγ/λ(λ+θ)(α+γ)) − S e (q) = −∞ and S e (q) is strict concavity in q ∈ [0, θµγ λ(λ+θ)(α+γ) ), so the equation S e (q) = 0 must have two roots q 1 , q 2 (q 1 < q 2 ) ∈ [0, θµγ λ(λ+θ)(α+γ) ). According to the definition of set Q, there are four cases. (a): if q ∈ Q 1 and q 1 > 1, which implies that the equation S e (q) = 0 has no solution in the interval Q 1 , so the equilibrium strategy is q e = 0 of balking. (b): if q ∈ Q 1 and q 1 = 1, q = 1 is the unique solution of the equation S e (q) = 0, so q e = 1 is the equilibrium strategy in this subcase. (c): if q ∈ Q 1 and q 1 < 1, similar to the discussion of Case III (b), q 1 is a mixed equilibrium strategy in this subcase because of S e (q 1 ) = 0. Obviously, if q 2 < 1, q e = q 2 is also a mixed equilibrium strategy in this case; if q 2 ≥ 1, q 2 is not the solution of the equation S e (q) = 0, but q = 1 is a equilibrium strategy in this subcase because of S e (1) > 0. (d): if q ∈ Q 2 , according to the previous description, q 1 and q 2 must belong to Q 2 , so q 1 and q 2 are mixed equilibrium strategies because of S e (q 1 ) = 0 and S e (q 2 ) = 0. Thus we have the Case III.

Socially optimal joining strategy in the cooperative case
The customers in the non-cooperative case gain the individual's best benefit by selfish means. However, the joining strategy of the non-cooperative case does not match the wishes of social planners. The intention of the social planner is to promote mutual cooperation between customers in order to maximize the social benefits, i.e., the cooperative case. In this subsection, we turn our interest to the analysis of the socially optimal joining strategy in the cooperative case, in which, the social planner maximizes the social welfare through adopting the socially optimal joining probability q * .
is positive under the stability condition 0 ≤ q < θµγ λ(λ+θ)(α+γ) , it is difficult to get the maximum value of S W(q) under the stable condition. So in the following theorem, we will only study the range of (λ + θ)R − C > 0, i.e., R C > 1 λ+θ . Theorem 5. For the M/M/1/MV constant retrial queueing system with N-policy and breakdowns in the steady state. For R C > 1 λ+θ and any given price p < R, the number and the type of socially optimal joining strategy for cooperative case depend on the values of q max , and the set Q. Specifically, the customers join the orbit with probability q * upon their arrival by seeing an unavailable server, the joining probability q * maximizes social welfare, where q * is given by: In this case, the socially optimal strategy is q * = 0. Case II: R C = θ λ+θ T (q max ). Case II (a): q ∈ Q 1 and q max > 1. Then, the socially optimal strategy is q * = 0.
Case II (b): q ∈ Q 1 and q max = 1. Then, the socially optimal strategy is q * = 1.
Case II (c): q ∈ Q 1 and q max < 1. Then, the socially optimal strategy is q * = q max .
Case II (d): q ∈ Q 2 . Then, the socially optimal strategy is q * = q max .
(II) When R C = θ λ+θ T (q max ), which implies S W(q max ) = 0, then S W(q) ≤ 0 of q ∈ Q. So, S W(q) is negative for each q q max . There are four cases, (a): if q ∈ Q 1 and q max > 1, which implies S W(q) < 0 for every q ∈ Q because of q max Q, i.e., there is no point such that S W(q) = 0. In this subcase, the socially optimal strategy q * = 0 (balking). (b): if q ∈ Q 1 and q max = 1, since S W(1) = 0, we have that the maximum value of S W(q) in q ∈ Q = Q 1 is 0, so the socially optimal strategy is attained q * = 1. (c): if q ∈ Q 1 and q max < 1, similar to the discussion of Case II (b), the socially optimal strategy is attained q * = q max . (d): if q ∈ Q 2 , since q max must belong to the set Q 2 , and S W(q max ) = 0, so a unique socially optimal strategy is attained at q * = q max , there is no other point such that S W(q) = 0 of q ∈ Q = Q 2 . Thus we have the Case II.
(III) When R C > θ λ+θ T (q max ), which implies S W(q max ) > 0, i.e. the maximum value of S W(q) in q ∈ [0, θµγ λ(λ+θ)(α+γ) )) is attained at some point. Since the strict concavity of S W(q) as a function of q ∈ [0, θµγ λ(λ+θ)(α+γ) )), we can get the maximum value q max is unique. When q ≤ q max , S W(q) is strictly increasing; while S W(q) is strictly decreasing for q ≥ q max . So the maximum value of S W(q) is obtained at q * = q max , if q max ≤ 1, otherwise the maximum value of S W(q) is obtained at q * = 1. Thus we have the Case III.

Optimal pricing of the service provider
The problem of maximizing the profit of the server is also considered in the actual service system. As mentioned before, all customers who join the system are charged an admission fee p (announced price, i.e., service price) by the server. On the other hand, running the server will generate consumption costs. In fact, the profit of the server is dynamic, and the server can maximize the profit by adjusting the admission fee p and the service rate µ.
Assume that the server has no consumption cost in the vacation state and repair state. However, the consumption costs of the server in idle and busy states are C i and C b , respectively. Then, the profit of the service provider per time unit under equilibrium is given by S (µ, p) = (λq e (P 0 (1) + P 1 (1) + P 3 (1)) + λP 2 (1))p − (C b P 1 (1) + C i P 2 (1)), (5.1) where q e is the equilibrium joining probability, which is given in Theorem 4, P 0 (1), P 1 (1), P 2 (1) and P 3 (1) are given in Theorem 1. The expression S (µ, p) of the profit of the service provider per time unit under equilibrium is complex, so it is usually difficult to obtain analytical characterization. Therefore, we can give some numerical analysis by Particle Swarm Optimization (PSO) algorithm to overcome the difficulty of obtaining analytical characterization.
PSO algorithm is a global random search algorithm based on swarm intelligence proposed by [23], inspired by the results of artificial life research, by simulating the migration and swarming behavior of birds swarm foraging. The basic idea of the PSO algorithm comes from mutual cooperation and information sharing between groups to obtain the optimal solution. Because of its simple operation and fast convergence speed, the PSO algorithm has been widely used in many fields such as function optimization, image processing, and geodesy.
The PSO algorithm is first initialized as a group of random particles (random solution), and then the optimal solution is found through multiple iterations. In each iteration, the particles continuously update the optimal values of velocity V id and position X id and finally obtain the global optimum through multiple iterations, where velocity V id represents the speed of movement, position X id represents the direction of movement, the number of particles represents the dimension of the solutions. The position of each particle represents a potential optimal solution. V id and X id are updated by the following formulas, and where i is the number of particles, d is dimension, rand() is a random number in (0, 1), c 1 and c 2 are learning factor and ω is inertia factor.

Numerical examples
In this section, the theoretical knowledge we have obtained based on the previous research contains many parameters, so we explore the impact of these parameters on the two joining strategies (q e and q * ) and social welfare S W(q) through a series of numerical experiments. On the other hand, due to the complexity of the expression S (µ, p) of the profit of the service provider per time unit under equilibrium, we numerically analyze how the service provider sets up the price p and service rate µ to maximize its own benefit. To address these issues, through a large number of numerical experiments on various parameters, regardless of the choice of the parameters, we find that the qualitative results of the numerical experiments are similar. So we present some typical numerical scenarios to illustrate the findings of these numerical experiments. The first set of numerical experiments presents the trends of the two joining strategies (q e and q * ) on the parameters λ, µ, θ, ξ, α, γ and N, respectively, in Figures 2-5, respectively.
6.1. The impact of parameters on the two joining strategies q e and q * Figure 2 (a) shows that q e and q * have a downward trend with arrival rate λ, and q e is always above q * . The reason is that as λ increases, more and more customers join the system, and the orbit becomes more crowded, the waiting cost of the later arriving customers is increasing, which will lead to a gradual decline in the enthusiasm of customers to join the system. However, as the service rate µ increases, q e and q * show an increasing trend as shown in Figure 2 (b). This is because as the service rate µ increases, the customers on the orbit get fast service, and waiting costs will be reduced. Therefore, no matter the cooperation case or non-cooperation case, the arriving customers are more willing to join the unavailable system.  Figure 3 (a) indicates that q e and q * increase as ξ increases, but the growth trend is not very obvious. Since as the vacation time becomes shorter, the number of customers accumulating on the orbit is reduced, so the arriving customers are more likely to join the system when it is unavailable. Figure  3 (b) shows that both q e and q * increase with the retrial rate θ. The reason is that as the retrial rate continues to increase, the customers accumulating in the orbit get fast service, which leads to the newly arriving customers who are more willing to join the unavailable system.  Obviously, the life cycle of the server effectively affects the joining probability of the arriving customers in the cooperation case and non-cooperation case. In Figure 4 (a), q e and q * show a downward trend with the increase of α. This is because the shortened lifetime of the server leads to an increase in the number of server repairs within a certain period, which will increase the waiting cost of customers in the orbit. So the newly arriving customers are more reluctant to join the system when they find it unavailable. However, the shortening of the server maintenance time, i.e., increase γ, it will effectively increase the joining probability of the customers in the two cases, which can be shown in Figure 4 (b). This is exactly the opposite of Figure 4 (a) because the increase in γ reduces the waiting costs of the customers in the orbit.   Figure 5 (a) indicates that q e and q * are inconsistent as functions of the threshold N. This is because as N increases, the enthusiasm of selfish customers for joining the system gradually decreases, i.e., q e decreases with N. However, as N increases, accumulating more customers on the waiting list is completely coincide with the wishes of the social planner. Figure 5 (b) shows that the increase in announcement price p leads to a gradual decline in the enthusiasm of selfish customers, i.e., the customers in non-cooperative case, but p has no effect on the customers in the cooperation case. Obviously, as the service price p increases, the probability q e of the arriving customers (the customers in non-cooperative case) to join the unavailable system must be reduced. However, as discussed in Theorem 5, since the service price p is only a transfer relationship between the customers and the server or the service provider, so q * remains unchanged.

Exploring the impact of system parameters on the maximum social welfare
Social planners are usually more concerned about the social welfare of the service system, especially the maximum social welfare. This multiple vacation retrial queue with N-policy and breakdowns studied in this paper has more parameters, which effectively affect the trend of social welfare. Through a large number of numerical experiments, we find that the qualitative results of the influence of these parameters on social welfare are similar. Figures 6-8 present typical numerical experiments illustrating the respective effects of parameters R, C, λ, µ, θ, N, α, γ and ξ on the maximum social welfare S W(q * ) of this service system. From Figure 6 (a), we can see that the social planner increases the reward R of the customers will promote the growth of maximum social welfare, because as R increases, it will encourage more and more customers to join the unavailable system, which has a positive stimulating effect on the net profit of this service system. Conversely, increasing waiting cost of C per unit time will reduce the enthusiasm of customers to join the unavailable system, which will lead to a decrease in the maximum social welfare as the waiting cost of C per unit time increases, which as shown in Figure 6 (a). Figure 6 (b) shows that the growth of both λ and µ can increase the maximum social welfare. Although the probabilities q e and q * of the two joining cases decrease as the arrival rate λ increases, which can be seen in Figure 2 (a), the maximum social welfare S W(q * ) may not be significantly affected. This is because when the arriving customers find that the system is available, the arriving customers quickly join the system with a probability of 1, which effectively promotes the increase in social welfare. The increase in service rate µ allows the customers in the orbit to get fast service, and the waiting costs of the customers are reduced. As shown in Figure 2 (b), the customers are more willing to join the unavailable system. Therefore, the increase in service rate µ effectively promotes the growth of social welfare. As shown in Figure 4 (a), the increase of α shortens the available time of the server, which leads to a decrease in the probabilities of q e and q * of the two joining cases. As a result, social welfare must decline, which can be seen in Figure 7 (a). On the contrary, as shown in Figure 4 (b), the shortened repair time increases the available time of the server, and the customers under the two joining cases are more willing to join the unavailable system. As a result, Figure 7 (a) shows that the maximum social welfare increases as γ increases. The social planner hopes to reduce the server's vacation time to reduce the number of customers on the waiting list, and the probability q e and q * of the customers also conform to that shown in Figure 3 (a). As shown in Figure 7 (b), this will contribute to the growth of social welfare.      illustrates that the maximum social welfare S W(q * ) is an increasing function of the retrial rate θ. As shown in Figure 3 (b), as the retrial rate θ increases, the retrial frequency of the customers in the orbit is accelerated, and the arriving customers are more willing to join the system when the system is unavailable. Because the waiting cost of the customers is reduced, which encourages more customers to join the unavailable service system, which promotes the growth of maximum social welfare S W(q * ). In Figure 8 (b), the social welfare S W(q * ) decreases with N. This is because, with the increase of N, the more customers accumulate in the vacation state, the customers who later arrive at the system are more reluctant to join the system, which ultimately leads to a decline in the net income of the whole service system.

The profit of service provider
From the discussion in Section 5, we know that the profit of the service provider is dynamic, and the server can obtain the maximum profit by adjusting the entrance fee p and the service rate µ. It is difficult for us to obtain an explicit or closed-form representation of S (µ, p), so we use the PSO algorithm introduced earlier to explore how the server adjusts the price p and service rate µ to obtain maximum profit under equilibrium. We have run a large number of numerical experiments to find that their qualitative results are similar, so we illustrate the results through typical numerical scenarios.
The key procedure of applying the PSO algorithm to find an optimal solution (S (µ, p)) is illustrated in Algorithm 1, where the velocity V id and position X id are given in (5.2) and (5.3), respectively. Specifically, Figure 9 gives an example of finding the optimal solution of S (µ, p) through the improved PSO algorithm. Algorithm 1 A example of searching for the maximum profit S (θ, p) of the server Require: R, C, λ, ξ, N, θ, α, γ, C b , C i ; Ensure: µ , p, S (θ, p); 1: for each particle i 2: Initializing velocity V id and position X id for each particle i 3: Evaluating particle i and setting pBest i = X id 4: end for 5: gBest i =min {pBest i } 6: while not stop 7: for i =1 to M 8: Updating the velocity and position of particle i 9: Evaluating particle i 10: if fit (X id ) < fit (pBest i ) 11: pBest i = X id 12: if fit (pBest i ) < fit (gBest i ) 13: gBest i = pBest i 14: end for 15: end while 16: print gBest i 17: end Now, we apply the PSO algorithm to explore how the server adjusts the service price p and service rate µ to maximize profit under the case of q e 0 and µ 0. On the basis of the service price p and service rate µ as control variables, as shown in Figure 10 (a), the profit S (µ, p) of the service provider decreases with respect to the arrival rate λ. This is because as the arrival rate λ increases, more and more customers accumulate in the orbit. At this time, the server needs to increase the service rate µ to reduce congestion, and the increase in service price p is used to reduce service costs. Ultimately, because of the increase in the arrival rate λ, the congestion of the system, and the increase in waiting costs have led to a decline in the profit S (µ, p) of the server. However, as shown in Figure 10 (b), the profit S (µ, p) of the service provider increases with respect to the retrial rate θ. The reason is that the increase in the retrial rate θ helps reduce the length of the orbit, which promotes the rapid operation of the system, the result is an increase in the profits of the service provider.  Figure 11 (a) illustrates that the profit S (µ, p) of the server decreases with respect to the consumption cost C i of the server per time unit in the idle state. This is because as the increase of C i , the unit time consumption cost of the idle state keeps increasing, and the social planner will shorten the idle time of the server to reduce the consumption cost. The shortening of idle time reduces the number of customers who join the system with probability 1 when the system is available. In the case of increased costs and a decrease in the number of customers who join the system with probability 1, the profit of the service provider is ultimately reduced. Similarly, as shown in Figure 11 (b), with the increase of C b , the unit time consumption of the busy state will continue to increase. In order to reduce costs, the server will shorten the working time of the server, which will cause more and more customers to accumulate in the orbit, the customers who arrive later are more reluctant to join the system, which will eventually lead to a decrease in the effective arrival rate, which will result in a decrease in the server profit S (µ, p).   Figure 11. (a) The profit S (µ, p) of service provider vs. C i when R = 5, C = 1, λ = 2, ξ = 1, N = 5, θ = 3.6, α = 0.3, γ = 0.8, C b = 3. (b) The profit S (µ, p) of service provider vs. C b when R = 5, C = 1, λ = 2, ξ = 1, N = 5, θ = 3.6, α = 0.3, γ = 0.8, C i = 3.

Conclusions and further research
Motivated by the cost control of service and information, a multiple vacations retrial queue with Npolicy and breakdowns is studied in this paper. Two types of customer joining cases apply to this paper, i.e., the non-cooperative customers aim to optimize individual interests, and the social planner in the cooperative case consider the profit of the whole service system. For this service system, we presented the equilibrium joining strategy for the non-cooperative case and the socially optimal joining strategy for the cooperative case.
For the maximum profit of the server, it is difficult for us to obtain an explicit or closed-form representation of S (µ, p), so we use the improved PSO algorithm to explore how the server obtains maximum profit. A large number of numerical experiments show that the qualitative results of the parameters are similar to the system, so we use some typical numerical scenarios to explain the influence of the parameters on the two joining probabilities, and how the parameters affect the changing trend of maximum social welfare. Both the model itself and the numerical experiment have certain guiding significance for the actual service system. Because there is no waiting space in front of the server and the virtuality of the waiting list, this model is suitable for emergency disaster or epidemic control. Changes in the parameters assumed by the model, resulting in changes in the joining strategy are interesting topics for future research.