• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.3
• /
• pp.253-261
• /
• 2004

Game theory is mathematical analysis developed to study involved in making decisions. In 1928, Von Neumann proved that every two-person, zero-sum game with finitely many pure strategies for each player is deterministic. As well, in the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann's theorem. Another central achievement of game theory is the introduction of evolutionary game theory, by which agents can play optimal strategies in the absence of rationality. Not the rationality but through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) introduced by Maynard Smith. Keeping pace with these game theoretical studies, the first computer simulation of co-evolution was tried out by Hillis in 1991. Moreover, Kauffman proposed NK model to analyze co-evolutionary dynamics between different species. He showed how co-evolutionary phenomenon reaches static states and that these states are Nash equilibrium or ESS introduced in game theory. Since the studies about co-evolutionary phenomenon were started, however many other researchers have developed co-evolutionary algorithms, in this paper we propose Game theory based Co-Evolutionary Algorithm (GCEA) and confirm that this algorithm can be a solution of evolutionary problems by searching the ESS.To evaluate newly designed GCEA approach, we solve several test Multi-objective Optimization Problems (MOPs). From the results of these evaluations, we confirm that evolutionary game can be embodied by co-evolutionary algorithm and analyze optimization performance of GCEA by comparing experimental results using GCEA with the results using other evolutionary optimization algorithms.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.4
• /
• pp.463-474
• /
• 2004

Game theory is a method of mathematical analysis developed to study the decision making process. In 1928, Von Neumann mathematically proved that every two-person, zero-sum game with many pure finite strategies for each player is deterministic. In the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann's theorem. Another central achievement of game theory is the introduction of evolutionary game theory, by which agents can play optimal strategies in the absence of rationality. Through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) as introduced by Maynard Smith in 1982. Keeping pace with these game theoretical studies, the first computer simulation of coevolution was tried out by Hillis. Moreover, Kauffman proposed the NK model to analyze coevolutionary dynamics between different species. He showed how coevolutionary phenomenon reaches static states and that these states are either Nash equilibrium or ESS in game theory. Since studies concerning coevolutionary phenomenon were initiated, there have been numerous other researchers who have developed coevolutionary algorithms. In this paper we propose a new coevolutionary algorithm named Game theory based Coevolutionary Algorithm (GCEA) and we confirm that this algorithm can be a solution of evolutionary problems by searching the ESS. To evaluate this newly designed approach, we solve several test Multiobjective Optimization Problems (MOPs). From the results of these evaluations, we confirm that evolutionary game can be embodied by the coevolutionary algorithm and analyze the optimization performance of our algorithm by comparing the performance of our algorithm with that of other evolutionary optimization algorithms.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.2
• /
• pp.247-255
• /
• 2004

The majority of real-world problems encountered by engineers involve simultaneous optimization of competing objectives. In this case instead of single optima, there is a set of alternative trade-offs, generally known as Pareto-optimal solutions. The use of evolutionary algorithms Pareto GA, which was first introduced by Goldberg in 1989, has now become a sort of standard in solving Multiobjective Optimization Problems (MOPs). Though this approach was further developed leading to numerous applications, these applications are based on Pareto ranking and employ the use of the fitness sharing function to maintain diversity. Another scheme for solving MOPs has been presented by J. Nash to solve MOPs originated from Game Theory and Economics. Sefrioui introduced the Nash Genetic Algorithm in 1998. This approach combines genetic algorithms with Nash's idea. Another central achievement of Game Theory is the introduction of an Evolutionary Stable Strategy, introduced by Maynard Smith in 1982. In this paper, we will try to find ESS as a solution of MOPs using our game model based co-evolutionary algorithm. First, we will investigate the validity of our co-evolutionary approach to solve MOPs. That is, we will demonstrate how the evolutionary game can be embodied using co-evolutionary algorithms and also confirm whether it can reach the optimal equilibrium point of a MOP. Second, we will evaluate the effectiveness of our approach, comparing it with other methods through rigorous experiments on several MOPs.

• Journal of Korea Game Society
• /
• v.11 no.2
• /
• pp.57-68
• /
• 2011

This study approaches how newly emerged game companies has implemented strategies for product diversification according to market growth cycle(beginninggrowing-mature) by empirical case study through evolutionary theory and resource based theory approach. At the beginning, online game companies had grown with different strategies(technology based, service based) by initial condition(genre, technological level, user attribute). After market growth, for product diversification, these companies carried out path-dependent alliance strategy(complementary, competitive) depending on resource base(technology capacity, service capacity based). As online game market getting mature, these companies has adapted flexibly in responding to market growth cycle by integrated strategy(naturally selected to mobilize every possible resource capability). By analyzing the alliance strategies pattern of online game companies in newly emerged game industry according to market growth cycle through combination of resource based theory and evolutionary theory, these results suggest that new industrial, theoretical, policy model is required.

• Industrial Engineering and Management Systems
• /
• v.14 no.1
• /
• pp.44-57
• /
• 2015

In recent years, for the purpose of solving the problem regarding environment protection and resource saving, certain measures and policies have been promoted to establish a reverse supply chains (RSCs) with material flows from collection of used products to reuse the recycled parts in production of products. It is necessary to analyze behaviors of RSC members to determine the optimal operation. This paper discusses a RSC with a retailer and a manufacturer and verifies the behavior strategies of RSC members which may change over time in response to changes parameters related to the recycling promotion activity in RSC. A retailer takes two behaviors: cooperation/non-cooperation in recycling promotion activity. A manufacturer takes two behaviors: monitoring/non-monitoring of behaviors of the retailer. Evolutionary game theory combining the evolutionary theory of Darwin with game theory is adopted to clarify analytically evolutionary outcomes driven by a change in each behavior of RSC members over time. The evolutionary stable strategies (ESSs) for RSC members' behaviors are derived by using the replicator dynamics. The analysis numerically demonstrates how parameters of the recycling promotion activity: (i) sale promotion cost, (ii) monitoring cost, (iii) compensation and (iv) penalty cost affect the judgment of ESSs of behaviors of RSC members.

• Journal of Korean Society of Transportation
• /
• v.32 no.5
• /
• pp.554-566
• /
• 2014

An objective of VMS(Variable Message Signs) is to make transportation system effective specifically for driver's path selection. The traffic solutions including a VMS problem can be modeled through Game Theory, however, the majority of the studies can not model various driver's response according to VMS information in game theory. So, this paper tries to analyze a driver's response according to VMS traffic informations through evolutionary game theory. We apply a behavior characteristics of driver to evolutionary game theory, then finds drivers are only accepting in case of the biggest pay-off, and if a traffic flow finds a balance over time, ratio of accepting information is converged as an evolutionary stable state gradually. Consequently, the strategy of the other drivers such as traffic problems can not be predicted accurately. In case, drivers repeat between groups and reasonable judgment by the experience, we expect that VMS can provide strategic information through evolutionary game theory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2697-2710
• /
• 2018

Owing to the development of Internet of Things (IoT), the fifth-generation (5G) wireless communication is going to foresee a substantial increase of mobile traffic demand. Energy efficiency and spectral efficiency are the challenges in a 5G network. Non-orthogonal multiple access (NOMA) is a promising technique to increase the system efficiency by adaptive power control (PC) in a 5G network. This paper proposes an efficient PC scheme based on evolutionary game theory (EGT) model for uplink power-domain NOMA system. The proposed PC scheme allows users to adaptively adjusts their transmit power level in order to improve their payoffs or throughput which results in an increase of the system efficiency. In order to separate the user signals, a successive interference cancellation (SIC) receiver installed at the base station (BS) site. The simulation results demonstrate that the proposed EGT-based PC scheme outperforms the traditional game theory-based PC schemes and orthogonal multiple access (OMA) in terms of energy efficiency and spectral efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3133-3151
• /
• 2012

The optimal price strategy selection of two bounded rational cognitive mobile virtual network operators (MVNOs) in a duopoly spectrum sharing market is investigated. The bounded rational operators dynamically compete to sell the leased spectrum to secondary users in order to maximize their profits. Meanwhile, the secondary users' heterogeneous preferences to rate and price are taken into consideration. The evolutionary game theory (EGT) is employed to model the dynamic price strategy selection of the MVNOs taking into account the response of the secondary users. The behavior dynamics and the evolutionary stable strategy (ESS) of the operators are derived via replicated dynamics. Furthermore, a reward and punishment mechanism is developed to optimize the performance of the operators. Numerical results show that the proposed evolutionary algorithm is convergent to the ESS, and the incentive mechanism increases the profits of the operators. It may provide some insight about the optimal price strategy selection for MVNOs in the next generation cognitive wireless networks.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.6
• /
• pp.491-496
• /
• 2002

Multi-objective Optimization Problems(MOPs) are occur more frequently than generally thought when we try to solve engineering problems. In the real world, the majority cases of optimization problems are the problems composed of several competitive objective functions. In this paper, we introduce the definition of MOPs and several approaches to solve these problems. In the introduction, established optimization algorithms based on the concept of Pareto optimal solution are introduced. And contrary these algorithms, we introduce theoretical backgrounds of Nash Genetic Algorithm(Nash GA) and Evolutionary Stable Strategy(ESS), which is the basis of Co-evolutionary algorithm proposed in this paper. In the next chapter, we introduce the definitions of MOPs and Pareto optimal solution. And the architecture of Nash GA and Co-evolutionary algorithm for solving MOPs are following. Finally from the experimental results we confirm that two algorithms based on Evolutionary Game Theory(EGT) which are Nash GA and Co-evolutionary algorithm can search optimal solutions of MOPs.

• Journal of KIISE:Information Networking
• /
• v.37 no.3
• /
• pp.228-233
• /
• 2010

During wireless network operations, adaptive power control is an effective way to enhance the network performance. In this paper, a new online power control scheme is proposed based on the evolutionary game theory. To converge a desirable network equilibrium, the proposed scheme adaptively adjusts a transmit power level in a distributed online manner. With a simulation study, we demonstrate that the proposed scheme improves network performance under widely diverse network environments.