# Quantum Game Application to Recovery Problem in Mobile Database
## 3 Quantum Game-Based Recovery Model
### Recovery Modeling Using Quantum Game  
The suggested method differs from prior MDS recovery attempts in that it takes into account a variety of important variables in the mobile environment during handoffs or service failures, which change depending on the situation, while conventional recovery algorithms are predicated on specific assumptions about the environment and operate accordingly. The primary reasons for extending our prior work's two-player game to three players in this article are as follows: (1) reliance on a limited number of algorithms lowers the possibility of making good decisions, since it is possible for one of the algorithms to permanently dominate decision-making; (2) Allowing a greater number of algorithms to join the competition increases the efficacy of decision-making under a variety of environmental circumstances; (3) With a rise in the number of players, different degrees of complexity and mathematical calculations were used to address the recovery issue, resulting in enhanced capabilities for the proposed task; and (4) Several algorithms performed poorly in the present study, despite their success in earlier work. Thus, when the performance of certain algorithms deteriorated, they were eliminated from the competition; nevertheless, the entrance of others with superior results resulted in a substantial increase in performance, which is the purpose of presenting this study. The suggested model's architecture is shown in Figure 3. The following table (Table 1) summarizes the game assumptions utilized in the recovery modeling process. Cooperative game theory (CGT) and non-cooperative game theory (NCGT) are two subfields of game theory. CGT elucidates how agents compete and cooperate to generate and capture value in unstructured interactions. NCGT simulates agents' activities, maximizing their usefulness based on a comprehensive description of each agent's motions and information. Cooperative games are ones in which players are convinced to follow a certain strategy via player dialogue and agreement. A strategy is a detailed plan of action that a player will follow in response to a variety of situations that may occur over the course of the game. On the other hand, non-cooperative games are ones in which participants select their own strategy of profit maximization. The main distinguishing feature is the absence of external authority to establish norms guaranteeing cooperative behavior. Without external authority (such as contract law), participants are unable to form coalitions and must compete alone [14; 15]. \begin{table}
\begin{tabular}{l c} \hline \hline
**Game** & **Parameter** \\ \hline Number of Players & Three Players \\ Game Type & Non Cooperative (No interaction between players) \\ Game Form & Strategic form \\ Evolutionary Game Theory & No \\ Strategy type & Pure not Mixed \\ Payoff Functions & TIME, Memory, Recovery Done Probability \\ The Winning Algorithm & The highest NE(Quantum Nash) in the reward matrix \\ \hline \hline \end{tabular}
\end{table} 
Table 1: Game Assumptions. Figure 2: Mobile System Architecture. Figure 3: The Proposed MDS Recovery Model. Non-cooperative games are often studied by trying to predict players' tactics and payoffs, as well as by finding Nash equilibria. Each player in NE is assumed to be aware of the other players' equilibrium tactics, and no one benefits from merely changing their strategy. If each player has chosen a strategy-a collection of actions based on previous game events--and no person can increase their expected payoff by changing their strategy while the other players retain theirs, then the current set of strategy choices characterizes NE. The suggested game is modeled by static games with complete information, in which players simultaneously choose strategies and get rewards depending on the combination of actions taken. These types of games may be formalized using a normal-form representation [14].