• 대한수학회보
• /
• 제49권6호
• /
• pp.1251-1254
• /
• 2012

Pure-strategy Nash Equilibrium (NE) is one of the most important concepts in game theory. Tae-Hwan Yoon and O-Hun Kwon gave a "sufficient condition" for the existence of pure-strategy NEs in matrix games [5]. They also claimed that the condition was necessary for the existence of pure-strategy NEs in undominated matrix games. In this short note, we show that these claims are not true by giving two examples.

• 한국경영과학회지
• /
• 제14권2호
• /
• pp.97-104
• /
• 1989

This paper extends the existence proofs of a Nash equilibrium to a more general class of differentila game models with constraints on the control spaces. With the assumptions of continuity, convexity, and compactness, the existence is proved using Kakutani Theorem and via a path-following approach. Furthermore, the proof for a period-by-period optimization of multi-period problems provides an insight to a numerical solution algorithm to differential game models with constraints.

• 대한수학회지
• /
• 제36권4호
• /
• pp.813-828
• /
• 1999

In this paper, we give a Peleg type KKM theorem on G-convex spaces and using this, we obtain a coincidence theorem. First, these results are applied to a whole intersection property, a section property, and an analytic alternative for multimaps. Secondly, these are used to proved existence theorems of equilibrium points in qualitative games with preference correspondences and in n-person games with constraint and preference correspondences for non-paracompact wetting of commodity spaces.

• 대한수학회지
• /
• 제36권4호
• /
• pp.823-823
• /
• 1999

• 대한수학회지
• /
• 제45권5호
• /
• pp.1297-1310
• /
• 2008

Main purpose of this paper is to combine the optimal form of Fan's best approximation theorem and Nash's equilibrium existence theorem into a single existence theorem simultaneously. For this, we first prove a general best proximity pair theorem which includes a number of known best proximity theorems. Next, we will introduce a new equilibrium concept for a generalized Nash game with normal form, and as applications, we will prove new existence theorems of Nash equilibrium pairs for generalized Nash games with normal form.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2286-2309
• /
• 2016

Overlay networks have been widely deployed upon the Internet by Service Providers (SPs) to provide improved network services. However, the interaction between each overlay and traffic engineering (TE) as well as the interaction among co-existing overlays may occur. In this paper, we adopt both non-cooperative and cooperative game theory to analyze these interactions, which are collectively called hybrid interaction. Firstly, we model a situation of the hybrid interaction as an n+1-player non-cooperative game, in which overlays and TE are of equal status, and prove the existence of Nash equilibrium (NE) for this game. Secondly, we model another situation of the hybrid interaction as a 1-leader-n-follower Stackelberg-Nash game, in which TE is the leader and co-existing overlays are followers, and prove that the cost at Stackelberg-Nash equilibrium (SNE) is at least as good as that at NE for TE. Thirdly, we propose a cooperative coalition mechanism based on Shapley value to overcome the inherent inefficiency of NE and SNE, in which players can improve their performance and form stable coalitions. Finally, we apply distinct genetic algorithms (GA) to calculate the values for NE, SNE and the assigned cost for each player in each coalition, respectively. Analytical results are confirmed by the simulation on complex network topologies.

• 대한수학회보
• /
• 제43권3호
• /
• pp.599-610
• /
• 2006

The aim of this paper is to give an existence theorem for a strong solution of generalized vector quasi-equilibrium problems of the weak type II due to Hou et al. using the equilibrium existence theorem for 1-person game, and as an application, we shall give a generalized quasivariational inequality.

• Nonlinear Functional Analysis and Applications
• /
• 제27권1호
• /
• pp.83-97
• /
• 2022

In this paper, we introduce and study generalized mixed operator quasi-equilibrium problems(GMQOEP) in Hausdorff topological vector spaces and prove the existence results for the solution of (GMQOEP) in compact and noncompact settings by employing 1-person game theorems. Moreover, using coercive condition, hemicontinuity of the functions and KKM theorem, we prove new results on the existence of solution for the particular case of (GMQOEP), that is, generalized mixed operator equilibrium problem (GMOEP).

• 대한전기학회논문지:전력기술부문A
• /
• 제53권5호
• /
• pp.302-307
• /
• 2004

As deregulation of power industry is becoming a reality, there has been an intense interest in the strategic bidding for suppliers to maximize their profits. The profit gained by a supplier is related not only to its energy-price bid curve but also to its submitted operational parameters such as generation capacity, etc. So suppliers are willing to use those strategic parameters that can be manipulated by themselves and are effective to their profit. This paper deals with the competition model with compound strategies: generation capacity and bidding curve. The parameter space is modeled by dividing into the two strategies, so the problem is made up of the four types of sub-game in a two player game. This paper analyzes the global Nash Equilibrium (NE) over the whole divisions by computing the sub-game NEs in some divisions and by deriving the best response curves which have discontinuities in other divisions. The global NE is shown to correspond to the Cournot NE where the quantity variable is realized by a constraints of a generation capacity.

• Journal of Communications and Networks
• /
• 제18권3호
• /
• pp.411-419
• /
• 2016

This article investigates the problem of distributed channel selection in opportunistic spectrum access networks from a perspective of interference minimization. The traditional physical (PHY)-layer interference model is for information theoretic analysis. When practical multiple access mechanisms are considered, the recently developed binary medium access control (MAC)-layer interference model in the previous work is more useful, in which the experienced interference of a user is defined as the number of competing users. However, the binary model is not accurate in mathematics analysis with poor achievable performance. Therefore, we propose a real-valued one called stochastic MAC-layer interference model, where the utility of a player is defined as a function of the aggregate weight of the stochastic interference of competing neighbors. Then, the distributed channel selection problem in the stochastic MAC-layer interference model is formulated as a weighted stochastic MAC-layer interference minimization game and we proved that the game is an exact potential game which exists one pure strategy Nash equilibrium point at least. By using the proposed stochastic learning-automata based uncoupled algorithm with heterogeneous learning parameter (SLA-H), we can achieve suboptimal convergence averagely and this result can be verified in the simulation. Moreover, the simulated results also prove that the proposed stochastic model can achieve higher throughput performance and faster convergence behavior than the binary one.