• 제목/요약/키워드: Cooperative game

검색결과 191건 처리시간 0.023초

A Non-cooperative Game Theoretic Approach to Dust and Sand Storm in North East Asia

  • Song, Yang-Hoon
    • 환경정책연구
    • /
    • 제6권3호
    • /
    • pp.91-114
    • /
    • 2007
  • Song and Nagaki(2007)에 나타나 있는 것과 같은 동북아지역의 황사(먼지모래폭풍: DSS) 저감을 위한 비음부담 공조체제는 참여국의 협정불이행으로 실행가능성에 문제가 제기된다. 만일 비협조적 전략이 각국에게 보다 현실적이 라면, 내쉬균형이 실현가능한 비용분담 게임의 결과를 예측하게 하여줄 수 있다. 본 연구에 따르면, 연속전략게임의 경우, ADB의 황사저감사업의 비용이 각국 투자에 의해 조달된다는 가정하에 무한한 내쉬균형이 발견된다. 또한, 비연속전략은 3각형 평면으로 나타나는 연속전략의 내쉬균형의 꼭짓점으로 나타나게 되며, 공조적 게임의 결과는 무한한 균형 점들을 1개의 점으로 수렴하게 된다.

  • PDF

A Chinese Restaurant Game for Distributed Cooperative Caching in Small Cell Networks

  • Chen, Junliang;Wang, Gang;Wang, Fuxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권1호
    • /
    • pp.222-236
    • /
    • 2019
  • Wireless content caching in small cell networks has recently been considered as a promising way to alleviate the congestion of the backhaul in emerging heterogenous cellular network. However, how to select files which are cached in SBSs and how to make SBSs work together is an important issue for cooperative cache research for the propose of reducing file download time. In this paper, a Cooperative-Greedy strategy (CGS) among cache-enabled small base stations (SBSs) in small cell network is proposed, in order to minimize the download time of files. This problem is formulated as a Chinese restaurant game.Using this game model, we can configure file caching schemes based on file popularity and the spectrum resources allocated to several adjacent SBSs. Both the existence and uniquencess of a Nash equilibrium are proved. In the theoretical analysis section, SBSs cooperate with each other in order to cache popular files as many as possible near UEs. Simulation results show that the CGS scheme outperforms other schemes in terms of the file-download time.

경쟁적 전력시장에서의 입찰 전략에 대한 연구 (A Study on Bidding Strategies in a Competitive Electricity Market)

  • 강동주;박만근;김발호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2001년도 하계학술대회 논문집 A
    • /
    • pp.507-508
    • /
    • 2001
  • Power transactions are considered as noncooperative game in that participants compete each other to win the bidding game, and as cooperative game in that they have to cooperate to apply the result of bidding game to the physically interconnected power system. This paper applies both noncooperative and cooperative game theories in analyzing the entire process of power transaction.

  • PDF

D2D Power Control in the Cellular System: Non Cooperative Game Theoretic Approach

  • Oh, Changyoon
    • 한국컴퓨터정보학회논문지
    • /
    • 제23권3호
    • /
    • pp.25-31
    • /
    • 2018
  • In this paper, we consider the game theoretic approach to investigate the transmit power optimization problem where D2D users share the uplink of the cellular system. Especially, we formulate the transmit power optimization problem as a non cooperative power control game. In the user wide sense, each user may try to select its transmit power level so as to maximize its utility in a selfish way. In the system wide, the transmit power levels of all users eventually converge to the unique point, called Nash Equilibrium. We first formulate the transmit power optimization problem as a non cooperative power control game. Next, we examine the existence of Nash Equilibrium. Finally, we present the numerical example that shows the convergence to the unique transmit power level.

3단계 공급사슬게임을 위한 협조적 게임이론의 적용 (Cooperative Game Theory Application for Three-Echelon Supply Chain)

  • 이동주
    • 산업경영시스템학회지
    • /
    • 제42권3호
    • /
    • pp.15-24
    • /
    • 2019
  • Fair Allocation of profits or costs arising from joint participation by multiple individuals or entities with different purposes is essential for their continuing involvement and for their dissatisfaction reduction. In this research, fair allocation of the profits of forming a grand coalition in Three-Echelon Supply Chain (TESC) game that is composed of manufacturer, distributor and retailer, is studied. In particular, the solutions of the proportional method of profit, the proportional method of marginal profit, and Shapley value based on cooperative game theory are proved to be in the desirable characteristics of the core. The proportional method of profit and the proportional method of marginal profit are often used because of their ease of application. These methods distribute total profit in proportion to profits or marginal profits of each game participant. In addition, Shapley value can be defined as the average marginal profit when one game player is added at a time. Even though the calculation of the average of all possible marginal profits is not simple, Shapley value are often used as a useful method. Experiments have shown that the solution of the incremental method, which calculates the marginal cost of adding game players in the order of manufacturers, distributors and retailers, does not exist in the core.

협조적 게임이론을 이용한 국가 간 수산자원관리에 관한 연구 (A Study on the Management of International Fishery Resources using Cooperative Game Theory)

  • 최종두;조정희
    • Ocean and Polar Research
    • /
    • 제30권2호
    • /
    • pp.173-180
    • /
    • 2008
  • This study demonstrates that cooperative management can provide more benefits than noncooperative management for Korea and Japan fishery. We have studied one management strategy, namely, fishing under joint maximization of net benefits in coastal waters of two countries, using a cooperative game theory. The present net return under non-cooperation amounts to 420,255 million won. However, if two countries cooperate one with another, this figure can get to 2,636,565 million won. We consider this to be an important conclusion as close management relationships have developed between the two countries since the establishment of the EEZ in 1996. The results of the study can also help balance resource conservation and the appropriate catch quota in each country.

Resource Allocation in Wireless Ad Hoc Networks Using Game Theory

  • Lee, Ki-Hwan;Halder, Nilimesh;Song, Ju-Bin
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2007년도 하계종합학술대회 논문집
    • /
    • 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.

  • PDF

D2D Utility Maximization in the Cellular System: Non Cooperative Game Theoretic Approach

  • Oh, Changyoon
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권7호
    • /
    • pp.79-85
    • /
    • 2019
  • We investigate the D2D utility maximization in the cellular system. We focus on the non cooperative game theoretic approach to maximize the individual utility. Cellular system's perspective, interference from the D2D links must be limited to protect the cellular users. To accommodate this interference issue, utility function is first defined to control the individual D2D user's transmit power. More specifically, utility function includes the pricing which limits the individual D2D user's transmit power. Then, non cooperative power game is formulated to maximize the individual utility. Distributed algorithm is proposed to maximize the individual utility, while limiting the interference. Convergence of the proposed distributed algorithm is verified through computer simulation. Also the effect of pricing factor to SIR and interference is provided to show the performance of the proposed distributed algorithm.

A Game Theoretic Study of Energy Efficient Cooperative Wireless Networks

  • Brown, Donald Richard III;Fazel, Fatemeh
    • Journal of Communications and Networks
    • /
    • 제13권3호
    • /
    • pp.266-276
    • /
    • 2011
  • In wireless networks, it is well-known that intermediate nodes can be used as cooperative relays to reduce the transmission energy required to reliably deliver a message to an intended destination. When the network is under a central authority, energy allocations and cooperative pairings can be assigned to optimize the overall energy efficiency of the network. In networks with autonomous selfish nodes, however, nodes may not be willing to expend energy to relay messages for others. This problem has been previously addressed through the development of extrinsic incentive mechanisms, e.g., virtual currency, or the insertion of altruistic nodes in the network to enforce cooperative behavior. This paper considers the problem of how selfish nodes can decide on an efficient energy allocation and endogenously form cooperative partnerships in wireless networks without extrinsic incentive mechanisms or altruistic nodes. Using tools from both cooperative and non-cooperative game theory, the three main contributions of this paper are (i) the development of Pareto-efficient cooperative energy allocations that can be agreed upon by selfish nodes, based on axiomatic bargaining techniques, (ii) the development of necessary and sufficient conditions under which "natural" cooperation is possible in systems with fading and non-fading channels without extrinsic incentive mechanisms or altruistic nodes, and (iii) the development of techniques to endogenously form cooperative partnerships without central control. Numerical results with orthogonal amplify-and-forward cooperation are also provided to quantify the energy efficiency of a wireless network with sources selfishly allocating transmission/relaying energy and endogenously forming cooperative partnerships with respect to a network with centrally optimized energy allocations and pairing assignments.

LINEAR PROGRAMMING APPROACH IN COOPERATIVE GAMES

  • Victor V.Zakharov;Kwon, O-Hun
    • 대한수학회지
    • /
    • 제34권2호
    • /
    • pp.469-481
    • /
    • 1997
  • In this paper we consider TU-cooperative games in the form of characteristic function. We notice that if one uses the necessary and sufficient condition for the core to be not empty in a dual form, it may be used for selecting the final outcome in the core. Using the linear programming approach for constructing the subcore, which is a subset of the core, we represent it in a simple form. We consider reduced games due to Davis-Mashler, Moulin and Funaki and formulate the sufficient conditions for the subcore to be S-consistent.

  • PDF