• Journal of Korean Society of Transportation
• /
• v.23 no.4 s.82
• /
• pp.37-45
• /
• 2005

This paper presents a relationship between Nash bargaining game and Wardrop user equilibrium, which has been widely used in transportation modeling for route choice problem. Wardrop user equilibrium assumes that drivers in road network have perfect information on the traffic conditions and they choose their optimal paths without cooperation each other. In this regards, if the bargaining game process is introduced in route choice modeling, we may avoid the strong assumptions to some extent. For such purpose, this paper derives a theorem that Nash bargaining solution is equivalent to Wardrop user equilibrium as the barging process continues and prove it with some numerical examples. The model is formulated based on two-person bargaining game. and n-person game is remained for next work.

• Journal of the Korean Mathematical Society
• /
• v.36 no.4
• /
• pp.823-823
• /
• 1999

• Journal of the Korean Mathematical Society
• /
• v.36 no.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.

• Korean System Dynamics Review
• /
• v.1 no.2
• /
• pp.61-89
• /
• 2000

The purpose of this study is first, to find out what factors affect the cooperation and trust within the functions in the policy implementation network and in what mechanism these factors interact, second to investigate the whys to manage trust and cooperation successfully in the dynamic situation such as the network setting. For these purpose, this study reviews the concept and characteristics of policy implementation organizations, second, extracts the various factors affecting trust and cooperation in the network situation, third applies and analyzes the relationship among factors to system dynamics model based on the game theory. The results of this study could be summarized as follows: It was found that the utility change within the participants by persuasion ＆ mutual understanding and change of rule would be leading to success in policy implementation network. Also bureaucratic management such as power enforcement does not have any good impact in the managing network. In this study, system simulation method tried to analyze the hypothesis. Quantitative and case analyses were not accompanied and analysis was limited to two-person game theory. So there is some doubt this results could be generalized to actual situation which is N-person game.

• KIISE Transactions on Computing Practices
• /
• v.21 no.5
• /
• pp.343-350
• /
• 2015

While many games have been published that are used with input-devices such as a mouse and keyboard, the number of games that can recognize the behavior of a human utilizing devices such as Kinect and Wii has increased. In this paper, we present the development of a baseball game that utilizes a Leap Motion Controller. A Leap Motion Controller recognizes accurately the movement of a user's fingers. Our implemented game consists of characters, a background and animation. It is a moving animated game in which the users play a game in point of view of a third person. The major feature of our game is that the game players can enjoy the game using a Leap Motion Controller.

• Journal of KIISE:Software and Applications
• /
• v.27 no.3
• /
• pp.257-265
• /
• 2000

There is much selective confliction in nature where selfish and rational individuals exists. Iterated Prisoner's Dilemma (IPD) game deals with this problem, and has been used to study on the evolution of cooperation in social, economic and biological systems. So far, there has been much work about the relationship of the number of players and cooperation, strategy learning as a machine learning and the effect of payoff functions to cooperation. In this paper, We attempt to investigate the cooperative coalition size according to payoff functions, and observe the relationship of localization and the evolution of cooperation in NIPD (N-player IPD) game. Experimental results indicate that cooperative coalition size increases as the gradient of the payoff function for cooperation becomes steeper than that of defector's payoff function, or as the minimum coalition size gets smaller, Moreover, the smaller the neighborhood of interaction is, the higher the cooperative coalition emerges through the evolution of population.

• Journal of Internet Computing and Services
• /
• v.11 no.5
• /
• pp.105-117
• /
• 2010

In recent years, dynamic collaboration (DC) among cloud providers (CPs) is becoming an inevitable approach for the widely use of cloud computing and to realize the greatest value of it. In our previous paper, we proposed a combinatorial auction (CA) based cloud market model called CACM that enables a DC platform among different CPs. The CACM model allows any CP to dynamically collaborate with suitable partner CPs to form a group before joining an auction and thus addresses the issue of conflicts minimization that may occur when negotiating among providers. But how to determine optimal group bidding prices, how to obtain the stability condition of the group and how to distribute the winning prices/profits among the group members in the CACM model have not been studied thoroughly. In this paper, we propose to formulate the above problems of cooperative negotiation in the CACM model as a bankruptcy game which is a special type of N-person cooperative game. The stability of the group is analyzed by using the concept of the core and the amount of allocationsto each member of the group is obtained by using Shapley value. Numerical results are presented to demonstrate the behaviors of the proposed approaches.