• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.403-405
• /
• 2000

This paper presents a N-player game theory application for analyzing power transactions in a deregulated energy marketplace such as PoolCo, where, participants, especially, generating entities, maximize their net profits through optimal bidding strategies (i.e., bidding prices and bidding generations). In this paper, the electricity market for power transactions is modeled as a non-cooperative. N-player game with complete information, where the solution is determined in a continuous strategy domain having recourse to the Nash equilibrium idea.

• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.361-362
• /
• 2006

This paper presents the result of survey and analysis on a theoretical approach to the application of incomplete information game in deregulated Power Pools. The deregulation power market arc modeled by the incomplete information game. The case where participants have incomplete information about the operation costs of other participants are highlighted. Pool participants define transactions to maximize their benefit in non-cooperative situation, the ISO defines transactions among participants by looking for minimum price that satisfies the demand in the Pool. The incomplete information game determines Nash equilibrium satisfied Pool participants and the ISO.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.713-715
• /
• 2004

In an electricity market with an imperfect competition, participants make plans of biddings and transaction strategies to maximize their own profits. The market price and the quantity are concerned with the operation reserve as well as the bidding system and demand curves in an electricity market. This paper presents a model of the combined market , energy market and operating teserve market. The Nash equilibrium is analyzed by using a hi-level optimization , maximization of Social welfare (SW) and maximization of the producers' profits.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.240-242
• /
• 2007

The game theoretic analysis in wireless networks can be classified into the jamming game of the physical layer, the multiple access game of the medium access layer, the forwarder's dilemma and joint packet forwarding game of the network layer, and etc. In this paper, the game theoretic analysis about the multiple access game that selfish nodes exist in the IEEE 802.11 DCF(Distributed Coordination Function) wireless networks is addressed. In this' wireless networks, the modeling of the CSMA/CA protocol based DCF, the utility or payoff function calculation of the game, the system optimization (using optimization theory or convex optimization), and selection of Pareto-optimality and Nash Equilibrium in game strategies are the important elements for analyzing how nodes are operated in the steady state of system. Finally, the main issues about the game theory in the wireless network are introduced.

• Journal of the Korean Mathematical Society
• /
• v.45 no.1
• /
• pp.1-27
• /
• 2008

We introduce a new concept of convex spaces and a multimap class K having certain KKM property. From a basic KKM type theorem for a K-map defined on an convex space without any topology, we deduce ten equivalent formulations of the theorem. As applications of the equivalents, in the frame of convex topological spaces, we obtain Fan-Browder type fixed point theorems, almost fixed point theorems for multimaps, mutual relations between the map classes K and B, variational inequalities, the von Neumann type minimax theorems, and the Nash equilibrium theorems.

• Journal of Distribution Science
• /
• v.13 no.10
• /
• pp.15-21
• /
• 2015

Purpose - This study examines a bundling effect on production and distribution in a patent-protected industry. Despite the heavy use of bundling strategies in the information and technology industry, literature has paid scant attention to bundling of intellectual property rights. This study examines a theoretical exploration of the bundling effect on licensing behavior. Research design, data, and methodology - To address this behavior, we build a simplified model consisting of three stages: 1) bundling decision, 2) licensing agreement, and 3) competition. The subgame perfect Nash equilibrium is applied to the model. Results - A single-patent holder with superior technology grants its own license to the multiple-patent firm, thereby leaving the market. Anticipating the single right holder's licensing strategy, the multiple-patent firm offers a bundle, making the single-right holder's bargaining position weaker. Conclusions - Bundling is an effective business strategy, resulting in multiple products for a firm as it faces other firms with single-product lines in each market. Taking advantage of the multi-patent or multi-product lines, the firm utilizes the bundling strategy obtaining better technology from the standalone single-patent firms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3135-3148
• /
• 2013

The popularization of streaming networks and mobile devices brings a new kind of network called mobile peer-assisted streaming network. In this network, service provider not only offers downloading services, but also pre-pushes resources to users for caching. Users can download their demanded resources while working as servers for uploading the cached data. Also the mobile characteristic makes high package losing probability in this network. So we study how the service provider pre-pushes or the user downloads resources efficiently and effectively while considering the package losing in this paper. We build utility models for service provider and user, and solve the models using Bellman's theory to achieve Nash Equilibrium which shows the service provider's optimal pre-pushing speed and user's optimal downloading speed. The numerical simulation demonstrates the efficiency and effectiveness of our proposed pre-pushing and downloading scheme by comparing to the traditional scheme.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.195-196
• /
• 2007

The purpose of this paper is to analyze the resource allocation problem in a self organizing network from the viewpoint of game theory. The main focus is to suggest the model and analyze a power control algorithm in wireless ad-hoc networks using non cooperative games. Our approach is based on a model for the level of satisfaction and utility a wireless user in a self organizing network derives from using the system. Using this model, we show a distributed power control scheme that maximizes utility of each user in the network. Formulating this as a non-cooperative game we will show the feasibility of such power control as well as existence of the Nash Equilibrium achieved by the non-cooperative game.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.2
• /
• pp.108-119
• /
• 2015

This study intends to propose a non-oriented DEA based game cross-efficiency approach for supplier selection. With a discussion on the choice of DEA models and approaches that are most appropriate for supplier selection, we propose a game cross efficiency model based upon the non-oriented variable returns-to-scale RAM DEA by adapting the existing game cross efficiency model based upon the oriented constant returns-to-scale CCR DEA. We develop the RAM game cross efficiency model and a convergent iterative solution procedure to find the best game cross efficiency scores that constitute a Nash equilibrium. We illustrate the proposed model with two data sets of supplier selection, and demonstrate that significantly different results are obtained when compared with the existing approaches.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.395-398
• /
• 2002

본 논문에서는 ‘다목적 함수 최적화 문제(Multi-objective Optimization Problem MOP)’를 풀기 위하여 유전자 알고리즘을 진화적 게임 이론 적용시킨 ‘내쉬 유전자 알고리즘(Nash GA)’과 본 논문에서 새로이 제안하는 공진화 알고리즘의 구조를 설명하고 이 두 알고리즘의 결과를 시뮬레이션을 통하여 비교 검토함으로써 ‘진화적 게임 이론(Evolutionary Game Theory : EGT)’의 두 가지 아이디어 -‘내쉬의 균형(Equilibrium)’과 ‘진화적 안정전략(Evolutionary Stable Strategy . ESS)’-에 기반한 최적화 알고리즘들이 다목적 함수 문제의 최적해를 탐색할 수 있음을 확인한다.