Fuzzy Stackelberg game strategy generation method based on lexicographical order
Through the fuzzy Starkberg game strategy generation method based on dictionary order, the problem of subjective judgment integration of decision makers in complex network games is solved, and the strategy optimization of key node attacks and protection problems in infrastructure networks is realized, providing more effective The processing of ambiguity and uncertainty broadens the practical application of complex network games.
Patent Information
- Application Number
- CN202410933086.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-12
- Publication Date
- 2024-11-08
- Estimated Expiration
- 2044-07-12
AI Technical Summary
The existing technology is difficult to integrate the subjective judgments of decision makers in complex network games, and cannot effectively express the ambiguity and uncertainty of actual game problems. Especially in the attacks and protection problems of key nodes of infrastructure networks, existing methods cannot provide effective strategy optimization results.
The fuzzy Starkberg game strategy generation method based on dictionary order is adopted, and the fuzzy Starkberg game model is converted into multiple rounds of multi-objective planning problems, and the dictionary order method is used to convert it into multiple rounds of double-stage single-objective planning problems. , obtain the Nash equilibrium solution of the hybrid strategy, generate the fuzzy return matrix and optimization strategy of the pioneers and followers.
This method can effectively integrate the subjective judgments of decision makers, express the ambiguity and uncertainty in complex network games, provide optimization strategy results, and broaden the scope of application of complex network games in practical applications.
Smart Images

Figure CN118917057A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of complex network games in system engineering, and in particular to a fuzzy Stackelberg game strategy generation method based on lexicographic order. Background Art
[0002] In the current research field of game theory, there is a special type of network game, in which the network is not an actual network such as a computer system, but a key infrastructure such as train stations and airports abstracted into nodes in the network topology, and the connections between different sites abstracted into edges to establish a complex network of infrastructure. In the field of security, the key nodes of infrastructure are vulnerable to attacks, which will affect public security management and normal social life, and the security department needs to protect these nodes. Complex network games can be used to study the attack and protection issues of key nodes in infrastructure networks, which will help to formulate the best protection strategy and explore the importance of nodes.
[0003] There have been studies on this kind of problem, but the existing studies only provide objective evaluation methods based on network topology. For example, in a static or dynamic game framework with complete information, the network connectivity performance indicator, the maximum connected piece size, is used to calculate the payoff matrix of the pioneer and defender, and the corresponding Nash equilibrium strategy. However, in such actual game problems, the understanding of the problem by both parties involved in the game is uncertain, the information obtained is insufficient, and the decision-making environment is unpredictable. The existing methods cannot well integrate the subjective judgment of the decision maker and cannot express the ambiguity and uncertainty of the actual game problem.
[0004] In today's networked society, Stackelberg games on complex networks are an important research direction in the field of game theory. Its research mainly involves the construction of game models, strategy analysis and solution, and the expansion of application fields. Current research focuses on how to design efficient algorithms and tools for analysis and solution, promote its application in different fields, and further expand its theoretical research in order to better cope with the challenges of complex systems in reality. In recent years, research in this field has made many important progress and provided new ideas and methods for the research and application of game theory. In the field of fuzzy mathematics, Professor Zadeh proposed fuzzy theory, which provides a reasonable way to solve such problems. The introduction of this theory provides inspiration for solving more complex game problems. At present, there are few studies on the introduction of fuzzy number theory into Stackelberg games, and this research is of great significance. Summary of the invention
[0005] The present invention aims to solve at least one of the technical problems existing in the prior art. To this end, the present invention discloses a fuzzy Stackelberg game strategy generation method based on lexicographic order. The method is based on a fuzzy Stackelberg game model, obtains the fuzzy payoff matrix of the forerunner and the follower, converts the solution of the fuzzy Stackelberg game model into the solution of a multi-round multi-objective programming problem, and uses the lexicographic order method to convert the multi-round multi-objective programming problem into a multi-round two-stage single-objective programming problem, thereby obtaining a mixed strategy Nash equilibrium solution.
[0006] The object of the present invention is to achieve the following technical solution, a method for generating a fuzzy Stackelberg game strategy based on a lexicographic order, the method comprising:
[0007] Step 1: Determine the players in the game, and make the party that makes the first move the pioneer, and the party that makes the later move the follower;
[0008] Step 2, obtain the topological structure of the infrastructure network, determine the strategy set of the pioneer and the follower, and construct the fuzzy Stackelberg game model;
[0009] Step 3, through expert decision-making or empirical judgment, determine the fuzzy benefits of the pioneer and the follower under each strategy profile in the fuzzy Stackelberg game model, thereby obtaining the fuzzy benefit matrix of the pioneer and the follower;
[0010] Step 4, using the solution concept of strong Stackelberg equilibrium, the solution of the fuzzy Stackelberg game model is converted into the solution of a multi-round multi-objective programming problem;
[0011] Step 5: Using the lexicographic order method, the multi-round multi-objective programming problem is transformed into a multi-round two-stage single-objective programming problem, and then the mixed strategy Nash equilibrium solution is obtained, that is, the optimization results of the pioneer and follower strategies are obtained;
[0012] The fuzzy profit matrix can be expressed as in It is expressed as a triangular fuzzy number, where m represents the number of strategies of the forerunner, n represents the number of strategies of the follower, i represents the i-th strategy of the forerunner, and j represents the j-th strategy of the follower. represents the lower bound of the fuzzy number, represents the upper bound of the fuzzy number, Represents the median of the fuzzy number.
[0013] Specifically, the pioneer is the party that acts first and has a selection probability for each of its own strategies. The follower is the party that acts later and knows the probability distribution of the pioneer's commitment to all strategies. Usually, the number of optional strategies for the pioneer is m, and i represents the i-th strategy among all strategies. The number of optional strategies for the follower is n, and j represents the j-th strategy among all strategies.
[0014] Specifically, the fuzzy profit matrix is divided into the fuzzy profit matrix of the forerunner and the fuzzy profit matrix of the follower. The gain of the forerunner when he chooses strategy i and the follower chooses strategy j is a fuzzy number The follower's gain when the predecessor chooses strategy i and he chooses strategy j is a fuzzy number. Therefore, the fuzzy profit matrix of the first mover under different pure strategy situations is expressed as:
[0015]
[0016] Where m represents the total number of pioneer strategies, n represents the total number of follower strategies, and each element in the payoff matrix is represents the lower bound of the fuzzy number, represents the upper bound of the fuzzy number, represents the median of the fuzzy number;
[0017] The fuzzy payoff matrix of followers in different pure strategy situations is expressed as:
[0018]
[0019] Where m represents the total number of pioneer strategies, n represents the total number of follower strategies, and each element in the payoff matrix is represents the lower bound of the fuzzy number, represents the upper bound of the fuzzy number, Represents the median of the fuzzy number.
[0020] Furthermore, from the fuzzy payoff matrix of the forerunner and the follower, for each pure strategy t of the follower, we can get the optimal mixed strategy of the forerunner: By solving the following multi-objective programming problem:
[0021]
[0022] in, represents the probability distribution of any first mover mixed strategy; represents the probability distribution of the mixed strategy of the top priority mover; represents the lower bound of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t, It represents the upper bound of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t. represents the median of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t; represents the lower bound of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t, represents the upper bound of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t, It represents the median of the follower's fuzzy payoff when the forerunner chooses strategy i and the follower chooses strategy t. The optimal hybrid strategy of the forerunner corresponding to the pure strategy t of each follower is calculated. After that, we can calculate the pioneer payoff for each follower under pure strategy t Take the maximum value is the optimal benefit of the first mover, and is the global optimal hybrid strategy of the pioneer, The best response strategy for followers.
[0023] Furthermore, using the lexicographic method, the multi-objective programming problem is transformed into a two-stage single-objective programming problem. In the first stage:
[0024]
[0025] The optimal strategy of the first stage is Phase 2:
[0026]
[0027] The global optimal hybrid strategy of the forerunner can be obtained through the second stage planning problem in, represents the probability distribution of any first mover mixed strategy; represents the probability distribution of the mixed strategy of the top priority mover in the first stage;
[0028] represents the probability distribution of the mixed strategy of the top priority mover after two stages; represents the lower bound of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t, It represents the upper bound of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t. represents the median of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t; represents the lower bound of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t, represents the upper bound of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t, represents the median of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t;
[0029] The payoff of the first mover under each follower pure strategy t is pass Get the optimal benefit of the first mover, and is the global optimal hybrid strategy of the pioneer, is the best response strategy for the follower, where It means that among all t, first satisfy Maximum, followed by satisfaction maximum;
[0030] Finally, from the above multi-round two-stage single-objective planning problem, the global optimal hybrid strategy of the forerunner can be obtained: The best response strategy for followers
[0031] Compared with the existing methods, the advantages of the method of the present invention are: the existing research cannot reflect the fuzziness of decision makers' understanding of game problems. The method of the present invention combines fuzzy mathematics theory, proposes a fuzzy Stackelberg game strategy generation method based on lexicographic order, obtains the strategy optimization results of the forerunner and follower, and analyzes the results. Explaining the uncertainty of strong Stackelberg games with intuitive fuzzy theory can greatly broaden the application of complex network game research in practice. BRIEF DESCRIPTION OF THE DRAWINGS
[0032] Figure 1 A schematic diagram of a process flow of an embodiment of the present invention is shown;
[0033] Figure 2 A schematic diagram of an infrastructure network in an embodiment of the present invention is shown. DETAILED DESCRIPTION
[0034] In order to make the purpose, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0035] It should be understood that the specific embodiments described herein are only used to explain the present invention, and are not used to limit the present invention.
[0036] In this embodiment, only one pioneer and one follower are considered, and both parties fully understand the topological structure information of the existing network. A key infrastructure, such as a railway network, can be abstracted as a simple undirected graph G(V,E), where V = {v1,v2,...,v N} represents the set of all nodes in the network, i.e., the stations in the railway network, where N = |V| represents the number of nodes in the network. is the set of all edges in the network, i.e., the railway lines in the railway network.
[0037] Only one pioneer and one follower are considered, and both parties fully understand the topological structure information of the existing network. All targets of attack and defense are nodes in the network. The criterion for judging whether a node is successfully attacked is: the node is attacked by the pioneer and not protected by the follower. In a two-person zero-sum game, the more important the node, the higher the cost of attack or defense.
[0038] like Figure 1 As shown, a strong Stackelberg game strategy generation method based on intuitionistic fuzzy sets includes:
[0039] Step 1: Determine the players in the game, and make the party that makes the first move the pioneer, and the party that makes the later move the follower;
[0040] Step 2, obtain the topological structure of the infrastructure network, determine the strategy set of the pioneer and the follower, and construct the fuzzy Stackelberg game model;
[0041] Step 3, through expert decision-making or empirical judgment, determine the fuzzy benefits of the pioneer and the follower under each strategy profile in the fuzzy Stackelberg game model, thereby obtaining the fuzzy benefit matrix of the pioneer and the follower;
[0042] Step 4, using the solution concept of strong Stackelberg equilibrium, the solution of the fuzzy Stackelberg game model is converted into the solution of a multi-round multi-objective programming problem;
[0043] Step 5: Using the lexicographic order method, the multi-round multi-objective programming problem is transformed into a multi-round two-stage single-objective programming problem, and then the mixed strategy Nash equilibrium solution is obtained, that is, the optimization results of the pioneer and follower strategies are obtained;
[0044] The fuzzy profit matrix can be expressed as in It is expressed as a triangular fuzzy number, where m represents the number of strategies of the forerunner, n represents the number of strategies of the follower, i represents the i-th strategy of the forerunner, and j represents the j-th strategy of the follower. represents the lower bound of the fuzzy number, represents the upper bound of the fuzzy number, Represents the median of the fuzzy number.
[0045] Specifically, the pioneer is the party that acts first and has a selection probability for each of its own strategies. The follower is the party that acts later and knows the probability distribution of the pioneer's commitment to all strategies. Usually, the number of optional strategies for the pioneer is m, and i represents the i-th strategy among all strategies. The number of optional strategies for the follower is n, and j represents the j-th strategy among all strategies.
[0046] Specifically, the fuzzy profit matrix is divided into the fuzzy profit matrix of the forerunner and the fuzzy profit matrix of the follower. The gain of the forerunner when he chooses strategy i and the follower chooses strategy j is a fuzzy number The follower's gain when the predecessor chooses strategy i and he chooses strategy j is a fuzzy number. Therefore, the fuzzy profit matrix of the first mover under different pure strategy situations is expressed as:
[0047]
[0048] Where m represents the total number of pioneer strategies, n represents the total number of follower strategies, and each element in the payoff matrix is represents the lower bound of the fuzzy number, represents the upper bound of the fuzzy number, represents the median of the fuzzy number;
[0049] The fuzzy payoff matrix of followers in different pure strategy situations is expressed as:
[0050]
[0051] Where m represents the total number of pioneer strategies, n represents the total number of follower strategies, and each element in the payoff matrix is represents the lower bound of the fuzzy number, represents the upper bound of the fuzzy number, Represents the median of the fuzzy number.
[0052] Furthermore, from the fuzzy payoff matrix of the forerunner and the follower, for each pure strategy t of the follower, we can get the optimal mixed strategy of the forerunner: By solving the following multi-objective programming problem:
[0053]
[0054] in, represents the probability distribution of any first mover mixed strategy; represents the probability distribution of the mixed strategy of the top priority mover; represents the lower bound of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t, It represents the upper bound of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t. represents the median of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t; represents the lower bound of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t, represents the upper bound of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t, It represents the median of the follower's fuzzy payoff when the forerunner chooses strategy i and the follower chooses strategy t. The optimal hybrid strategy of the forerunner corresponding to the pure strategy t of each follower is calculated. After that, we can calculate the pioneer payoff for each follower under pure strategy t Take the maximum value is the optimal benefit of the first mover, and is the global optimal hybrid strategy of the pioneer, The best response strategy for followers.
[0055] Furthermore, the method for solving the multi-round multi-objective programming problem uses a lexicographic order method to transform the multi-objective programming problem into a two-stage single-objective programming problem. In the first stage:
[0056]
[0057] The optimal strategy of the first stage is Phase 2:
[0058]
[0059] The global optimal hybrid strategy of the forerunner can be obtained through the second stage planning problem in, represents the probability distribution of any first mover mixed strategy; represents the probability distribution of the mixed strategy of the top priority mover in the first stage;
[0060] represents the probability distribution of the mixed strategy of the top priority mover after two stages; represents the lower bound of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t, It represents the upper bound of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t. represents the median of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t; represents the lower bound of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t, represents the upper bound of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t, represents the median of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t;
[0061] The payoff of the first mover under each follower pure strategy t is pass Get the optimal benefit of the first mover, and is the global optimal hybrid strategy of the pioneer, is the best response strategy for the follower, where It means that among all t, first satisfy Maximum, followed by satisfaction maximum;
[0062] Finally, from the above multi-round two-stage single-objective planning problem, the global optimal hybrid strategy of the forerunner can be obtained: The best response strategy for followers
[0063] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.
Claims
1. A fuzzy Stackelberg game strategy generation method based on lexicographic order, characterized in that: The method comprises: Step 1: Determine the players in the game, and make the party that makes the first move the pioneer, and the party that makes the later move the follower; Step 2, obtain the topological structure of the infrastructure network, determine the strategy set of the pioneer and the follower, and construct the fuzzy Stackelberg game model; Step 3, through expert decision-making or empirical judgment, determine the fuzzy benefits of the pioneer and the follower under each strategy profile in the fuzzy Stackelberg game model, thereby obtaining the fuzzy benefit matrix of the pioneer and the follower; Step 4, using the solution concept of strong Stackelberg equilibrium, the solution of the fuzzy Stackelberg game model is converted into the solution of a multi-round multi-objective programming problem; Step 5: Using the lexicographic order method, the multi-round multi-objective programming problem is transformed into a multi-round two-stage single-objective programming problem, and then the mixed strategy Nash equilibrium solution is obtained, that is, the optimization results of the pioneer and follower strategies are obtained; The fuzzy profit matrix is expressed as in It is expressed as a triangular fuzzy number, where m represents the number of strategies of the forerunner, n represents the number of strategies of the follower, i represents the i-th strategy of the forerunner, and j represents the j-th strategy of the follower. represents the lower bound of triangular fuzzy numbers, represents the upper bound of triangular fuzzy numbers, Represents the median of a triangular fuzzy number.
2. The method for generating fuzzy Stackelberg game strategies based on lexicographic order according to claim 1, characterized in that: The fuzzy profit matrix is divided into the fuzzy profit matrix of the pioneer and the fuzzy profit matrix of the follower. The gain of the pioneer when it chooses strategy i and the follower chooses strategy j is a fuzzy number The follower's gain when the predecessor chooses strategy i and he chooses strategy j is a fuzzy number. Therefore, the fuzzy profit matrix of the first mover under different pure strategy situations is expressed as: Among them, each element in the profit matrix is represents the lower bound of the fuzzy number, represents the upper bound of the fuzzy number, represents the median of the fuzzy number; The fuzzy payoff matrix of followers in different pure strategy situations is expressed as: Among them, each element in the profit matrix is represents the lower bound of the fuzzy number, represents the upper bound of the fuzzy number, Represents the median of the fuzzy number.
3. The method for generating fuzzy Stackelberg game strategies based on lexicographic order according to claim 1, characterized in that: According to the fuzzy payoff matrix of the pioneer and the follower described in step 3, for each pure strategy t of the follower, the optimal mixed strategy of the pioneer is obtained By solving the following multi-objective programming problem: in, represents the probability distribution of any first mover mixed strategy; represents the probability distribution of the mixed strategy of the top priority mover; represents the lower bound of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t, It represents the upper bound of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t. represents the median of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t; represents the lower bound of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t, represents the upper bound of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t, It represents the median of the follower's fuzzy payoff when the forerunner chooses strategy i and the follower chooses strategy t. The optimal hybrid strategy of the forerunner corresponding to the pure strategy t of each follower is calculated. Then, calculate the pioneer payoff under each follower's pure strategy t Take the maximum value is the optimal benefit of the first mover, and is the global optimal hybrid strategy of the pioneer, The best response strategy for followers.
4. The method for generating fuzzy Stackelberg game strategies based on lexicographic order according to claim 1, characterized in that: Using the lexicographic method, the multi-objective programming problem is transformed into a two-stage single-objective programming problem. In the first stage: The optimal strategy of the first stage is Phase 2: The global optimal hybrid strategy of the forerunner is obtained through the second stage planning problem in, represents the probability distribution of any first mover mixed strategy; represents the probability distribution of the mixed strategy of the top priority mover in the first stage; represents the probability distribution of the mixed strategy of the top priority mover after two stages; represents the lower bound of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t, It represents the upper bound of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t. represents the median of the fuzzy payoff of the pioneer when the pioneer chooses strategy i and the follower chooses strategy t; represents the lower bound of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t, represents the upper bound of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t, represents the median of the follower’s fuzzy payoff when the pioneer chooses strategy i and the follower chooses strategy t; The optimal payoff of the first mover under each follower's pure strategy t pass Get, and is the global optimal hybrid strategy of the pioneer, is the best response strategy for the follower, where It means that among all t, first satisfy Maximum, followed by satisfaction maximum; Finally, the global optimal mixed strategy of the pioneer is obtained The best response strategy for followers
Citation Information
Patent Citations
Path selection method based on Stackelberg game
CN108444494A
Mobile crowd sensing multi-task pricing method based on Stackelberg game
CN110390560A
Complex network game defense party strategy optimization method based on hyperbolic membership function
CN116455626A
Strong Stackelberg game strategy generation method based on intuitionistic fuzzy set
CN116822169A
Device scheduling method based on Stackelberg game
CN116822335A
