This paper proposes a mixed game with finitely many leaders and follower populations.In such a game,two types of equilibria are defined.First,a Nash equilibrium is introduced for the scenario in which leaders and foll...This paper proposes a mixed game with finitely many leaders and follower populations.In such a game,two types of equilibria are defined.First,a Nash equilibrium is introduced for the scenario in which leaders and follower populations are in perfect competition,each maximizing its own payoff.Second,a cooperative equilibrium is proposed for the case where leaders and follower populations,respectively,form coalitions and cooperate.Moreover,the existence of both Nash and cooperative equilibria is proved under the condition that the payoff functions are continuous and quasi-concave.Finally,we demonstrate the generic stability of cooperative equilibria in mixed games.More concretely,in the sense of Baire category,the cooperative equilibria in most mixed games are stable under perturbations of the payoff functions.In short,this paper presents two main contributions.On the one hand,we provide a novel mixed-game framework,which differs from both classical leader-follower games and leader-follower population games.On the other hand,the Nash and cooperative equilibria in our mixed games are distinct from those in existing leader-follower population games.The results are further illustrated with examples.展开更多
In this paper, we first introduce the notion and model of generalized minimax regret equilibria with scalar set payoffs. After that, we study its general stability theorem under the conditions that the existence theor...In this paper, we first introduce the notion and model of generalized minimax regret equilibria with scalar set payoffs. After that, we study its general stability theorem under the conditions that the existence theorem of generalized minimax regret equilibrium point with scalar set payoffs holds. In other words, when the scalar set payoffs functions and feasible constraint mappings are slightly disturbed, by using Fort theorem and continuity results of set-valued mapping optimal value functions, we obtain a general stability theorem for generalized minimax regret equilibria with scalar set payoffs. At the same time, an example is given to illustrate our result.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.11271098)the Guizhou Provincial Basic Research Program(Grant No.MS[2025]676)。
文摘This paper proposes a mixed game with finitely many leaders and follower populations.In such a game,two types of equilibria are defined.First,a Nash equilibrium is introduced for the scenario in which leaders and follower populations are in perfect competition,each maximizing its own payoff.Second,a cooperative equilibrium is proposed for the case where leaders and follower populations,respectively,form coalitions and cooperate.Moreover,the existence of both Nash and cooperative equilibria is proved under the condition that the payoff functions are continuous and quasi-concave.Finally,we demonstrate the generic stability of cooperative equilibria in mixed games.More concretely,in the sense of Baire category,the cooperative equilibria in most mixed games are stable under perturbations of the payoff functions.In short,this paper presents two main contributions.On the one hand,we provide a novel mixed-game framework,which differs from both classical leader-follower games and leader-follower population games.On the other hand,the Nash and cooperative equilibria in our mixed games are distinct from those in existing leader-follower population games.The results are further illustrated with examples.
文摘In this paper, we first introduce the notion and model of generalized minimax regret equilibria with scalar set payoffs. After that, we study its general stability theorem under the conditions that the existence theorem of generalized minimax regret equilibrium point with scalar set payoffs holds. In other words, when the scalar set payoffs functions and feasible constraint mappings are slightly disturbed, by using Fort theorem and continuity results of set-valued mapping optimal value functions, we obtain a general stability theorem for generalized minimax regret equilibria with scalar set payoffs. At the same time, an example is given to illustrate our result.
