1. Introduction
Crisis response refers to the emergency measures implemented in the event of disasters or crisis situations and other urgent circumstances, with the goal of minimizing losses and casualties. In the face of limited financial budgets, relief organizations need to ensure that they can provide prompt and effective rescue in emergencies. It is important to have a plan in place before a crisis occurs. Many scholars have conducted in-depth research in this field [
1,
2,
3,
4].
Coordinating the rescue operations of multiple organizations in crisis relief is a major challenge. Game theory provides a powerful framework for analyzing strategic interactions among multiple decision-makers. In the context of crisis relief operations, Nash equilibrium [
5], where no organization can benefit by unilaterally changing its strategy while others’ strategies remain fixed, offers crucial insights into multi-agent coordination under competition. Deterministic Nash equilibrium models have been extensively applied to resource allocation problems, where all parameters (e.g., demand, transportation costs) are assumed to be known with certainty. These models typically formulate each organization’s optimization problem as follows:
, where
denotes competitors’ decisions,
represents cost functions, and
captures operational constraints.
However, the realistic background of crisis rescue is full of uncertainties. When decision-makers are confronted with unexpected events (such as the scale of disasters, fluctuations in relief supply demands, and the probability of road damage), the traditional deterministic Nash equilibrium fails to capture the defects of demand fluctuations and disaster evolution. So the deterministic Nash Equilibrium needs to be extended to the Stochastic Nash Equilibrium. Let denote a random vector defined on probability space . The strategy set of each rescue organization is . A stochastic Nash equilibrium requires . This extension necessitates advanced analytical tools such as stochastic variational inequalities (SVI) and scenario-based decomposition algorithms, which handle probabilistic constraints and multi-stage decision processes.
Recent decades have witnessed notable developments in the field of game theory and optimization model of humanitarian crisis relief. In 2014, Toyasaki and Wakolbinger [
6] developed a novel game-theoretic framework to study donation competition among humanitarian agencies. Subsequently, in 2016, Anna Nagurney [
7] et al. established a generalized Nash equilibrium network model of non-governmental organizations’ post-disaster humanitarian relief, providing a more comprehensive perspective for the decision-making of humanitarian relief. In 2018, Coles and Zhang [
8] applied non-cooperative game theory to the study of partnership selection in the disaster response and recovery stage, analyzing how different organizations choose appropriate partners in the disaster response and recovery stage to achieve more efficient rescue and recovery work. More recently, in 2020, the two-stage stochastic programming model constructed by Anna Nagurney and Mojtaba Salarpour [
9] revealed the optimization mechanism of resource allocation for humanitarian organizations in the scenario of multi-agency collaborative disaster relief. In 2025, Hassani, Dana and Anna Nagurney [
10] constructed a multi-period and multi-commodity equilibrium model of the international agricultural product trade network, and took the Russia–Ukraine war as an example to quantify the impact mechanism of the war on global agricultural product flows, prices and food security. Furthermore, novel stochastic processes like weird Brownian motion [
11] and scaled fractional Brownian motion [
12] can model non-Gaussian and non-ergodic anomalous diffusion in crisis scenarios (e.g., disaster propagation, sudden changes in resource demand), capturing extreme events or complex spatiotemporal dependencies. This provides novel perspectives for advancement. The theory of random variational inequalities has also achieved remarkable development. Ashok Ganguly and Kamal Wadhwa [
13] strictly demonstrated the existence and uniqueness conditions of understanding by constructing a specific type of stochastic variational inequality model. S. Nanda and S. Pani [
14] studied the existence results and complementarity problems of stochastic variational inequalities in Hilbert Spaces. Gwinner and Raciti [
15] studied the internal relationship between stochastic variational inequalities and some equilibrium problems. Georgia Fargetta and Antonino Maugeri [
16] employed stochastic variational inequality theory to analyze inter-hospital competition for medical resources in emergency disaster scenarios. Significant progress has also been made in multi-stage stochastic variational inequalities. With ongoing research and advances in stochastic variational inequalities, Rockafellar et al. [
17] pioneered the extension of their study from single-stage to multi-stage frameworks in 2017. Chen and Pong [
18] innovatively reconstructed the two-stage stochastic variational inequality problem as a recourse two-stage stochastic optimization problem based on the minimum expected residual criterion. In 2019, in order to solve the monotone multi-stage stochastic variational inequality, Rockafellar and Sun [
19] proposed the asymptotic hedging method. They innovatively constructed a two-parameter asymptotic hedging algorithm, effectively analyzing the Lagrange variational inequality problem [
20]. In 2020, Li and Zhang [
21] converted the conventional convex two-stage stochastic programming model into a two-stage stochastic variational inequality formulation. In 2021, Sun and Chen [
22] explicitly established the theoretical framework of two-stage stochastic variational inequalities. This work was the first to integrate the dual-stage decision-making mechanism into variational inequality models, characterizing optimality conditions for multi-stage optimization and game-theoretic problems under stochastic environments. In 2024, Jiang and Sun [
23] investigated the discrete approximation of two-stage stochastic variational inequalities when the second-stage problem had multiple solutions, and employed the progressive hedging algorithm to validate the effectiveness of the discrete approximation method.
To address the complex interaction of competition, uncertainty and multi-stage planning in crisis rescue, this paper presents a stochastic optimization framework for coordinating relief supply procurement and distribution among multiple organizations during crisis events. The proposed two-stage non-cooperative game model addresses key challenges, including pre-disaster preparedness costs, emergency procurement strategies, penalty mechanisms for unmet demand, and organizations’ operational capacities (budgets and donations). By transforming the problem into a stochastic variational inequality formulation, we establish theoretical guarantees for equilibrium solutions [
24] while accounting for real-world uncertainties. The model provides a systematic approach to prevent resource waste and improve coordination efficiency among relief organizations, offering both theoretical insights and practical decision support for humanitarian operations under uncertainty. We present the first-order optimality conditions of the Lagrange multiplier characterizing this problem [
25,
26,
27]. We established the existence of saddle points for the problem and reformulated the primal problem into its dual counterpart, thus enabling effective solution derivation. We reconstructed the two-stage random variational inequality into a Lagrange multiplier regulation system through existence demonstration [
28]. Lagrange multiplier is the shadow price in aid procurement. By adjusting Lagrange multiplier, the allocation of disaster relief supplies can be better optimized. This means that rescue organizations are able to meet the needs of more rescue points.
This paper makes four key contributions: (1) It develops a novel two-stage stochastic non-cooperative game model integrating procurement, storage, and transportation for multiple relief organizations, bridging game theory and stochastic optimization to advance humanitarian decision-making; (2) under mild assumptions such as convexity and continuous differentiability of the cost functions, the existence of stochastic Nash equilibrium solutions is proven, strengthening the theoretical foundation of crisis rescue research; (3) for general probability distributions, it characterizes second-stage equilibrium through infinite Lagrange duality with economic interpretations of multipliers as shadow prices; (4) numerical experiments using the PHM algorithm validate the model’s effectiveness, demonstrating its practical utility in optimizing relief operations under uncertainty.
The organizational structure of our paper proceeds as follows. In
Section 2, we propose a two-phase stochastic framework for modeling competition in rescue supplies allocation. In
Section 3, we formalize the Stochastic Nash Equilibrium principle underlying our framework and demonstrate the existence and uniqueness of equilibrium solutions. In
Section 4, the existence of saddle points in the Lagrange framework of the second-stage stochastic problem is strictly proved. And we further reformulate the crisis relief problem as a Lagrangian-regulated system. We also apply the progressive hedging algorithm to some numerical examples in
Section 5. Our research outcomes and final deductions are compiled in
Section 6.
2. The Stochastic Nash Equilibrium Model for Crisis Relief
2.1. The Stochastic Model
Crisis events feature inherent unpredictability in terms of time, location, severity and regional impact. To address these uncertainties, relief organizations implement a two-phase operational framework. Pre-Crisis Planning Phase: Organizations proactively strengthen readiness by identifying and preparing storage points, shelters, and logistical networks. These preparatory measures ensure a foundation for rapid deployment when a crisis strikes. Post-Crisis Implementation Phase: Once the disaster scenario materializes—revealing specific demands and conditions—organizations leverage their pre-established infrastructure while dynamically executing additional actions. This phase integrates prior preparedness with real-time adjustments to optimize supply delivery and aid distribution. By structuring operations into these complementary stages, relief agencies balance proactive planning with responsive adaptation, enhancing their capacity to mitigate uncertainties and deliver effective humanitarian assistance.
The basic symbols used in our model are detailed in Abbreviations Section.
In this chapter, we aim to establish a stochastic Nash equilibrium model to characterize the dynamic game mechanism among multiple rescue organizations in allocating and procuring relief supplies during crisis scenarios. We assume there are W rescue centers participating in providing relief materials to D disaster areas. The model includes W rescue centers (relief supply storage nodes) and G procurement points (markets). Large-scale regional disasters often cause supply chain disruptions and transportation route failures, necessitating a multi-market procurement mechanism. Variations in prices and supply capacities across markets drive rescue organizations to dynamically optimize their strategies. Through this multi-market model, organizations select optimal procurement points and transportation modes, prioritizing low-cost markets under budget constraints while relying on multi-market procurement to address supply shortages during crises.
There are
N types of relief supplies, such as water, food, and medical materials. In the pre-disaster preparedness phase, each organization formulates strategic procurement plans based on limited budgets. A rescue center procures quantity (
) of relief supply
n from market
g and transports it to rescue center
w via transportation mode
m for storage. The relief supply flow moves from node
G to node
W. This pre-decision phase balances procurement costs (
), transportation fees (
), and warehouse operating costs (
), while adhering to regional supply caps (
) and budget constraints (
). When a disaster scenario (
) occurs, rescue organizations enter the post-disaster dynamic game phase. Facing uncertain demand, they must urgently deploy stored supplies to disaster areas (
). If pre-stocked supplies are insufficient, emergency premium procurement (
) is triggered, where transportation costs (
,
) may surge due to route damage. Relief supply flows then shift from nodes
W to
D and nodes
G to
D. To balance cost minimization and demand fulfillment, a penalty function (
) is introduced. For example, high penalties incentivize greater pre-disaster stockpiling, while low penalties may reduce emergency procurement. Additionally, social media coverage of the disaster amplifies public awareness, prompting donations from compassionate social groups (
) based on perceived shortages. These donations partially alleviate the burden on rescue organizations. In particular, we rewrite the relevant problems of each disaster response location
d as a two-stage stochastic Nash equilibrium problem:
subject to:
The objective function (1) minimizes the total procurement expenses, transportation fees, and warehousing charges for the initial supply strategy, plus the anticipated value of the phase two outcomes under disaster scenarios,
. Constraints (2), (3) and (8) are non-negative requirements for variables; Constraint (4) is the budget of each rescue organization; Constraint (5) ensures that the volume of relief supplies transported to disaster location
d meets or exceeds the specified demand; Constraint (6) represents the supply capacity limit for each relief supplies category
n; Constraint (7) indicates that the number of different types of relief supplies transported to the relief point cannot exceed the amount of relief supplies purchased. Ensuring the existence of a solution requires that condition
holds. Specifically,
represents the optimum solution to the subsequent stochastic Nash equilibrium problem:
subject to
The objective function (9) reduces the aggregate expenditure and second-phase shortage penalties. Constraint (10) specifies that the phase two provision, plus the shortage quantity, must meet or exceed the second-stage requirement. Constraint (11) defines the supply capacity limit for each category
n of relief supplies. Constraints (12)–(17) enforce the non-negative condition on all decision variables. We postulate that
, namely, unfulfilled demand is capped at a specified fraction of the initial stage demand. To ensure feasibility in the second-stage restrictions, we assume
The two-stage crisis response optimization can be reformulated as the subsequent minimization formulation:
where the constraint is (2)–(8) and (9)–(17).
2.2. Stochastic Nash Equilibrium Problem
We assume that a.e in the probability measure space are continuously differentiable and convex for all w, g, m. And if , and hold, where represents the Jacobian matrix of the vector-valued function A with respect to x. a.e in the probability measure space , are continuously differentiable and convex for all w, d, m. And when we have , we have and ; a.e in the probability measure space , are continuously differentiable and convex for all w, d, m. And for any given , if there is , then there is and ; a.e in are continuously differentiable and convex for all g, d, m. And for any given , if , then and ; a.e in , are continuously differentiable and convex for all d, n. And for any given , if , then and ; a.e in are continuously differentiable and convex for all d, n. And for any given , if , then , and .
As the Nash equilibrium is central to our analysis, we specify the fundamental constraint sets. We define
where
represents the feasible strategy set for each relief organization in the first stage. And we let
.
represents the joint feasible strategy set of all relief organizations in the first stage. The collective feasible region
is defined by
.
represents the joint feasible strategy set of all relief organizations in the second stage (under disaster scenario
). The feasible set
.
represents the joint feasible region encompassing the strategies of all rescue organizations across both the first and second stages. Additionally, let us make
.
We rewrite the objective function (18) as
, namely
We require, for , the gradient function of the decision variable to satisfy the local Lipschitz continuity:
For each
, there exists
, such that
Analogous Lipschitz constants exist for .
For each
, there exists
, such that
Analogous Lipschitz stochastic processes , , exist for , , and , respectively.
Additionally, the gradients are Carathéodory functions (measurable in , continuous in decision variables).
Below, we present the definition of stochastic Nash equilibrium.
Definition 1. A vector of rescue supplies is a stochastic Nash equilibrium if, for each ,for all , P-a.s., where represents the quantity of relief supplies and the unsatisfied requirements across all relief points excluding d. We now recast the stochastic Nash equilibrium problem as a stochastic variational inequality within the variational analysis framework.
Theorem 1. Under the assumption that the overall cost functions are convex and continuously differentiable, a vector is an equilibrium solution of the relief supply problem if and only if it satisfies the following variational inequality: Notably, our analysis of the stochastic Nash equilibrium hinges on the convexity of cost functions and constraints. Theorem 1’s variational inequality formulation is derived from the first-order optimality conditions of the convex optimization problems faced by each rescue organization.
Remark 1. forms the first-stage gradient term together with the transportation cost gradient and storage cost ensures the Jacobian matrix . remains positive semidefinite, reinforcing the convexity of the first-stage cost functions. Excessive prompts rescue organizations to reduce procurement volume in Market g. interacts with to influence the gradient term of emergency procurement , enhancing the diagonal dominance of matrix and guaranteeing monotonicity. increases marginal transportation costs, reflecting the premium on relief supplies during the second stage. Storage cost ensures the non-negativity of the gradient term in Jacobian matrix E, further strengthening operator monotonicity. Higher increases inventory holding costs at rescue centers, prompting implementation of lean inventory management strategies.
3. Analysis of the Existence and Convergence
In this chapter, we will systematically investigate the well-posedness of the stochastic Nash equilibrium problem under a two-stage stochastic variational inequality framework. Now, we present the relevant concepts required.
Suppose for any given
, when
, the matrix
if the Jacobian matrix with respect to
is a semi-definite matrix.
Under the framework of existence demonstration, our objective function (1) can be reconstructed into the following functional form:
where
,
,
,
.
Lemma 1 ([
29])
. Let the set be a closed convex set while the functionis continuous. If is pseudo-monotone on , then the solution set of is non-empty and bounded if and only if Remark 2. The criterion ensures that the solution set is non-empty and bounded by excluding non-trivial directions in the recession cone that align with the dual cone of . If contains nonzero vectors, the condition may fail, implying potential unboundedness or non-existence of solutions. To preserve solution existence, additional constraints (e.g., strict monotonicity or compactness of ) must be imposed to ensure that no nonzero recession direction satisfies .
Lemma 2. For any partitioned vector , if the block matrix satisfieswith , then: From Lemma 2, it follows that the antisymmetry of the skew-symmetric coupling terms and ensures that the mutual cancellation of cross-derivative terms eliminates disturbances from off-diagonal elements to the non-negativity of the quadratic form. Consequently, when the matrix blocks and are positive semi-definite, the symmetric component of matrix predominates in governing its positive semi-definiteness.
Theorem 2. If the previous hypotheses hold and there exists at least one set of such that , then the solution set of the function is non-empty and bounded.
Proof of Theorem 2. The first-order conditions of the variational inequality can be expressed as the monotonicity of the gradient mapping. To formalize this, we construct a block-structured Jacobian matrix:
where
,
,
,
,
+
, ,
, .
For any , and are mutually symmetric. is a positive semidefinite matrix, is also a positive semidefinite matrix. So is a semidefinite matrix, i.e.,
Since the cost function is continuously differentiable and convex, the function is continuous and convex. First-stage constraints (linear inequalities, convex costs) define a polyhedral convex . Since both and are closed convex sets, is likewise a closed convex set. Second-stage constraints are affine and convex P-a.s., making closed and convex under the probability measure. Since and are subject to the constraints of the financial budget, supply upper bounds, and demand lower bounds, they are bounded. Consequently, is bounded. Therefore, the feasible region forms a compact set. So is monotonic on .
There is only one condition for vector and at least one element , such that .
From Theorem 2, we know that for any given point , there exists point , such that . Then, for any non-zero , there holds
When
, we have
, hence
. So we get
. From the monotonicity of
and the definition of the variational inequality, we have
Letting
, when
holds, we have
. Then,
Therefore, . Because the gradient of aligns with the direction of , this leads to a contradiction with .
If , then is pointed. To address the case where contains nonzero vectors, we note that monotonicity of implies . Hence, if , then for any nonzero , , which contradicts . Therefore, holds, ensuring solution existence and boundedness.
From Lemma 1, it follows that the solution set of is non-empty and bounded. □
Above, we have proven the existence of the equilibrium solution; next, we will proceed to prove its uniqueness.
Theorem 3. If the following strengthened Lipschitz conditions holdwith , , , , and P-a.s., then the composite operator is strongly monotone: Theorem 4 (Uniqueness under Strong Monotonicity)
. Suppose the Jacobian matrix in variational inequality (19) is strongly monotone, i.e., there exists such that for all feasible strategies :Then the stochastic Nash equilibrium is unique.
Proof of Theorem 4. The variational inequality (19) in the paper is defined as follows:
And
representing the Jacobian of the gradient terms. By strengthened Lipschitz conditions,
is strongly monotone with modulus
. Then,
Suppose there exist two distinct equilibria
,
. Since both
and
satisfy the variational inequality (19), we have
By the strong monotonicity
□
Here, we need to pay special attention. Under the assumptions that is convex and is concave for all d, n, , the penalty/incentive terms ensure the positive semi-definiteness of . Specifically, Convexity of : Since is convex in , . Concavity of : Since is concave in , .
Thus, the combined term contributes a non-negative diagonal entry to , reinforcing its positive semi-definiteness. This property is critical for guaranteeing the monotonicity of the variational inequality (19) and the existence of equilibrium solutions.
4. Lagrange Multiplier Regulation System
In this section, we will construct the Lagrangian multiplier adjustment system for the stochastic Nash equilibrium problem in crisis rescue.
Theorem 5. The vector , for all , is an optimal solution of the second-stage problem (8)–(11) if and only if solves the variational inequality Theorem 6. Let be a solution to (20) a.e. in Ω. Let us say two functions , , , , , , and , . We draw the following conclusions: In other words, if there are three functions , , , such that (a)–(c) hold, then is the solution to problem (20).
The proof of Theorem 6 is provided in the
Appendix A.
Here, we need to make a special statement: the term represents the net marginal penalty for unmet demand. When takes the minimum value, the rescue organization prioritizes pursuing the minimum rescue cost rather than fully meeting the rescue material demands of the disaster-stricken area. The rescue organization is in a cost-optimal state, meaning that marginal cost of further reducing unmet demand (emergency procurement or transportation costs) would surpass the marginal benefits gained from such reductions (penalty mitigation or donation incentives). So there is . When is greater than the minimum value, it means that our marginal penalty cost surges or the existing relief supplies are sufficient. The rescue organization must redistribute the relief supplies to meet the relief supply demands in the disaster-stricken area as much as possible. Rescue organizations must prioritize fully meeting demands because the marginal penalty of unmet needs or the cost of reduced donations now exceeds the marginal cost of stockpiling or procurement. This forces organizations to adjust strategies (such as activating emergency procurement or reallocating resources) to avoid higher costs. So we have .
We recalled the definition of the tangent cone. Suppose
A represents a real normed space and, given an element
the set:
is formally defined as the tangent cone to
C at
a.
Theorem 7. If is a stochastic Nash equilibrium to problem (20), then satisfies .
The proof of Theorem 7 can be found in the
Appendix A.
Theorem 8. is a stochastic Nash equilibrium to problem (20) if and only if there exists , , , , , such that , , , , , is a saddle point of the Lagrange functional.
Proof of Theorem 8. Assuming that
is a solution to (20). We set
We consider the Lagrange function:
Since
is already proven, it exists
,
,
,
,
,
such that
,
,
,
,
,
is a saddle point of Lagrange functional
Setting
,
and
where
, then
that we get
Analogously, we can obtain
and
□
We transform the variational inequality (20) into a Lagrange multiplier regulated system:
This analysis examines the key control variables governing relief operations:
,
,
,
,
,
regulates procurement quantities, while
and
control demand and supply availability across stages. Variables
and
manage distribution flows from warehouses and direct purchases to disaster areas, respectively, with
and
tracking unmet demand. We have
If , then , and . The marginal cost of transporting relief items from the warehouse to the disaster area equals the algebraic difference between the fluctuation coefficient of disaster demand and the elasticity coefficient of material supply. Moreover, if , , we get , and the marginal transportation cost exhibits a decreasing trend. If , we get and the system’s marginal cost exhibits an upward trajectory.
We have . If , then , and namely, the marginal transportation cost for relief commodities between procurement centers and disaster zones equilibrates with the differential between demand regulation parameters and supply availability indicators in the marketplace. Moreover, if , , we get , and the marginal cost decreases. If , , we get and the marginal cost increases.
We have , If , and , we find that the marginal penalty is determined by the dynamic difference of the supply and demand regulation parameters. If , then , and , namely, the equilibrium state falls within the cost-minimizing tolerance range, resulting in null marginal penalties. If , then This corresponds to the ideal scenario of perfect demand fulfillment. If , then , and , namely, a diminishing-returns-to-penalty property emerges in the system.
When , the optimality conditions require , at which point the system is in an equilibrium state where marginal penalty and supply cost are balanced. The system allows for some unmet requirements. When , the system needs to weigh the local and global costs to force the rescue team to fully meet the rescue requirements.
Remark 3. The monotonicity condition remains preserved under coefficient scaling because , ensuring the positive semi-definiteness of matrix.
5. Stochastic Equilibrium Numerical Example
In this section, we provide a numerical example for demonstrative purposes. We consider purchase locations (g = 2), two relief centers (w = 2), two relief points (d = 2), two different relief supplies (n = 2), one mode of transportation (m = 1), and four scenarios. Penalty costs, which involve unmet demand, depend on the number of supplies not delivered in a day. Computational experiments were conducted via the progressive hedging algorithm (PHM) [
30,
31], a scenario-based decomposition technique for stochastic optimization. A seminal algorithm has adapted for multistage stochastic variational inequalities (SVI) and their stochastic Lagrange formulations. PHM decomposes complex problems into independent subproblems across different scenarios, coordinating decisions at each stage step by step, making it particularly suitable for multi-stage dynamic decision-making in crisis rescue operations. Uncertainties such as fluctuating demand and supply disruptions in crisis rescue are modeled using scenario trees. PHM allows for independent optimization under different scenarios, then coordinates a global solution through multipliers. These multipliers can be interpreted as “shadow prices”, reflecting the marginal cost of resource shortages. This provides decision-makers with real-time guidance for adjustments (e.g., prioritizing resource allocation to high-shortage areas), which is closely aligned with the Lagrangian regulation system proposed in this paper. The cost functions is given by
Initially, we concentrates on the flows
of the primary phase. The analysis reveals
From observing the flows
in the second stage, we find
During the subsequent phase, under crisis scenarios, demand fulfillment becomes non-negotiable through resource allocation optimization. Where the needs of the rescue site cannot be met, the rescue center will do its best to meet the needs to minimize penalties. We find that a high penalty coefficient forces rescue organizations to meet the needs of the disaster-stricken areas as much as possible.
Table 1 enumerates the computational findings.
Next, we consider a low penalty function or sufficient social donations (failure to meet the demand for a certain type of relief supplies would not lead to severe consequences). The cost function is as follows:
We obtain the flows
for the first stage as follows:
We get the flows
for the second stage:
We find that when the penalty coefficient is set too low or the social donation of materials is sufficient, rescue organizations do not tend to purchase additional rescue materials in the market to meet the needs of the disaster-stricken areas. We know that a low penalty function or adequate donations can reduce the emergency procurement motivation of rescue organizations. The results are shown in
Table 2.
For the above results, a high penalty coefficient () will force rescue organizations to prioritize the supply of urgently needed relief materials, while a low penalty coefficient will allow rescue organizations to pursue the minimization of rescue costs; that is, to tolerate strategic shortages within a certain range. Therefore, can be used as an effective tool for top decision-makers to regulate the efficiency of the rescue area. Sufficient social donations () will reduce emergency procurement behavior in the second stage, but excessive social donations will lead to the accumulation of relief materials. The top decision-makers can classify the penalty coefficients based on the severity of the disaster-stricken areas to accelerate the rescue response. The Lagrange multiplier () can be used as a real-time shortage indicator. When the rescue organization detects B, it should immediately adjust the distribution strategy of relief supplies. The top decision-makers can monitor the priority of relief supplies in real time through Lagrange multipliers, and social organizations can adjust their donation strategies based on “shadow prices” to reduce the waste of rescue resources caused by game conflicts.