• 제목/요약/키워드: repeated game model

검색결과 16건 처리시간 0.025초

Game Theory-based Bi-Level Pricing Scheme for Smart Grid Scheduling Control Algorithm

  • Park, Youngjae;Kim, Sungwook
    • Journal of Communications and Networks
    • /
    • 제18권3호
    • /
    • pp.484-492
    • /
    • 2016
  • Smart grid (SG) technology is now elevating the conventional power grid system to one that functions more cooperatively, responsively, and economically. When applied in an SG the demand side management (DSM) technique can improve its reliability by dynamically changing electricity consumption or rescheduling it. In this paper, we propose a new SG scheduling scheme that uses the DSM technique. To achieve effective SG management, we adopt a mixed pricing strategy based on the Rubinstein-Stahl bargaining game and a repeated game model. The proposed game-based pricing strategy provides energy routing for effective energy sharing and allows consumers to make informed decisions regarding their power consumption. Our approach can encourage consumers to schedule their power consumption profiles independently while minimizing their payment and the peak-to-average ratio (PAR). Through a simulation study, it is demonstrated that the proposed scheme can obtain a better performance than other existing schemes in terms of power consumption, price, average payment, etc.

동적게임이론을 이용한 최적입찰전략수립 (An Optimal Bidding Strategy Solution using Dynamic Game Theory)

  • 강동주;문영환;김발호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제51권4호
    • /
    • pp.202-208
    • /
    • 2002
  • In a dynamic game where the players move in a periodical sequence, each player observes the strategy of the others. So the players who move later in a game get to know the moves of others having made before them. Those who move earlier must take this into account in devising their optimal strategy. In the Poolco model, the bidding game is executed periodically. The player participating in the bidding game accumulates the information of its own and others'strategies, and payoffs through the repeated bidding process. Thereby, the players in this game would be able to map out how get the maximum profit, and get closer to the optimal strategy. This paper presents a mathematical modeling for a player to determine his or her optimal strategy at period T, based on the information acquired from the previous rounds for the periods, T-1, T-2, and so on. The proposed modeling is demonstrated with a dynamic fame theory.

군단급 워${\cdot}$게임모델 (Corps-Level War-Game Model)

  • 오형재
    • 한국국방경영분석학회지
    • /
    • 제3권1호
    • /
    • pp.51-82
    • /
    • 1977
  • Decision making is a function of many variables, but among these, human burden (soft-ware) and machine burden (hard-ware) are critical. Decision Maker is rather concerned with the soft-ware and just wants to have machine calculate the quantitative arithmetic involved in the decision-making study, because he is responsible for that decision whether or not he knows details about the techniques used by his staffs. From the point of these considerations, computer-assisted war game model has its significance in military decision making. The major outcome of this model is time-phased FEBA movement. FEBA is moved mainly by the ratio of the Index of Combat Effectiveness (ICE). To calculate ICE, Ground Forces are concerning the Index of Firepower (IFP) of individual weapons and in the case of Air Force, sorties are allocated into each sector, and added to the Ground Force IFP. With the ratio of total ICE, FEBA is moved according to the War Game Tables and process is repeated after consideration of casualties. This model is used by IBM-370/135 in MND computer room and also tested by IBM-3741/3717 established at ROKA HQ.

  • PDF

Stability of Slotted Aloha with Selfish Users under Delay Constraint

  • Chin, Chang-Ho;Kim, Jeong-Geun;Lee, Deok-Joo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권3호
    • /
    • pp.542-559
    • /
    • 2011
  • Most game-theoretic works of Aloha have emphasized investigating Nash equilibria according to the system state represented by the number of network users and their decisions. In contrast, we focus on the possible change of nodes' utility state represented by delay constraint and decreasing utility over time. These foregone changes of nodes' state are more likely to instigate selfish behaviors in networking environments. For such environment, in this paper, we propose a repeated Bayesian slotted Aloha game model to analyze the selfish behavior of impatient users. We prove the existence of Nash equilibrium mathematically and empirically. The proposed model enables any type of transmission probability sequence to achieve Nash equilibrium without degrading its optimal throughput. Those Nash equilibria can be used as a solution concept to thwart the selfish behaviors of nodes and ensure the system stability.

동적게임을 이용한 입찰전략수립 (Building a Bidding Strategy using Dynamic Game Theory)

  • 강동주;문영환;오태규;김발호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2001년도 추계학술대회 논문집 전력기술부문
    • /
    • pp.63-66
    • /
    • 2001
  • In the Poolco model, the bidding game is executed periodically. The player participating to the bidding game accumulates the information of others' strategies and payoffs through the repeated process. Thereby, he is able to map out how he gets his maximum profit, and proceed to the optimal strategy region. This paper shows the algorithm for a player to determine his strategy in t period based the information of the game results of t-1, t-2 period. And this algorithm can be formulated by using Dynamic game theory.

  • PDF

Repeated Overlapping Coalition Game Model for Mobile Crowd Sensing Mechanism

  • Kim, Sungwook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권7호
    • /
    • pp.3413-3430
    • /
    • 2017
  • With the fast increasing popularity of mobile services, ubiquitous mobile devices with enhanced sensing capabilities collect and share local information towards a common goal. The recent Mobile Crowd Sensing (MCS) paradigm enables a broad range of mobile applications and undoubtedly revolutionizes many sectors of our life. A critical challenge for the MCS paradigm is to induce mobile devices to be workers providing sensing services. In this study, we examine the problem of sensing task assignment to maximize the overall performance in MCS system while ensuring reciprocal advantages among mobile devices. Based on the overlapping coalition game model, we propose a novel workload determination scheme for each individual device. The proposed scheme can effectively decompose the complex optimization problem and obtains an effective solution using the interactive learning process. Finally, we have conducted extensive simulations, and the results demonstrate that the proposed scheme achieves a fair tradeoff solution between the MCS performance and the profit of individual devices.

Multimedia Service Discrimination Based on Fair Resource Allocation Using Bargaining Solutions

  • Shin, Kwang-Sup;Jung, Jae-Yoon;Suh, Doug-Young;Kang, Suk-Ho
    • ETRI Journal
    • /
    • 제34권3호
    • /
    • pp.341-351
    • /
    • 2012
  • We deal with a resource allocation problem for multimedia service discrimination in wireless networks. We assume that a service provider allocates network resources to users who can choose and access one of the discriminated services. To express the rational service selection of users, the utility function of users is devised to reflect both service quality and cost. Regarding the utility function of a service provider, total profit and efficiency of resource usage have been considered. The proposed service discrimination framework is composed of two game models. An outer model is a repeated Stackelberg game between a service provider and a user group, while an inner model is a service selection game among users, which is solved by adopting the Kalai-Smorodinsky bargaining solution. Through simulation experiments, we compare the proposed framework with existing resource allocation methods according to user cost sensitivity. The proposed framework performed better than existing frameworks in terms of total profit and fairness.

자기 강제적인 국제환경 협력을 위한 구상 (Designs for Self-Enforcing International Environmental Coordination)

  • 황욱
    • 자원ㆍ환경경제연구
    • /
    • 제15권5호
    • /
    • pp.827-858
    • /
    • 2006
  • 본 연구는 효과적인 국제 환경협약을 지속시키기 위해 소위, 자기 강제적인 협력체제 구축이 가능한 게임이론적 분석틀을 제시한다. 모델은 본질적으로 전략적 성향을 추구하는 각 국 정부의 환경 정책(본 논문에서는 배출허가 규범의 예를 고려함)이 추진되는 과정에서 어떻게 지속가능한 국제 환경협약이행을 위한 규칙이 계획될 수 있는지 분석한다. 특별히 최근 무한 반복적 게임이론의 연구 성과를 바탕으로, 본 연구는 이기적으로 행동하는 주권국가들이 일시적 이익을 위해 국제 협약을 위배하지 않고 지속적으로 그리고 협력적으로 그것을 위지시킬 수 있는 주요 메커니즘을 소개하는데 중점을 둔다. 현실적으로 국제 환경문제가 협약에 참가하는 국가들 뿐만 아니라 비회원국들에게도 외부효과가 미칠 수 있으며, 회원국 상호간에도 협약 이행에 관한 확실한 정보가 교환되지 못하는 경우를 고려하는 모델도 분석의 대상에 포함되었다. 이러한 경우, 모델의 균형 벡터를 구성하는 임계할인율, 유인가격수준, 그리고 협약위반에 따른 처벌 기간 등의 도출 과장이 간략히 논의된다.

  • PDF

지적장애 학생을 위한 VR 기반 요리하기 기능성 게임 개발 및 적용 효과 (Development and Applied Effects of VR-based Cooking Serious Game for Students with Intellectual Disabilities)

  • 이태수
    • 한국게임학회 논문지
    • /
    • 제21권1호
    • /
    • pp.67-80
    • /
    • 2021
  • 이 연구의 목적은 지적장애 학생을 위한 가상현실 기반 요리 활동 기능성 게임(VR-Cook)을 개발하고, 그 효과성을 검증하는 것이었다. 이에, ASSURE 모형을 활용하여 VR-Cook을 개발하였고, 지적장애 학생 20명을 대상으로 효과성을 검증하였다. 실험집단과 통제집단에 각각 10명씩 배치하였으며, 통제집단에는 전통적인 중재를 제공하였고, 실험집단에는 전통적 중재와 VR-Cook을 결합한 중재를 제공하였다. 평가는 중재 전, 중, 후에 총 3회 실시하였고, 평가 자료는 반복측정 이원 분산분석으로 분석하였다. 연구 결과, VR 기능성 게임을 활용한 실험집단이 통제집단보다 요리 활동에 대한 학습과 수업 태도에서 유의미한 향상을 나타내었다.

디지털 컨버전스 인프라로서의 NgN 환경에서 인터넷 산업구조 : ISP, CP, CDN 사업자간 경쟁을 중심으로 (Study on the Internet Industry Structure under the NgN Regime-Competitive Landscape of ISPs, CPs, and CDNs)

  • 김도훈
    • 경영과학
    • /
    • 제23권3호
    • /
    • pp.243-257
    • /
    • 2006
  • ITU-T's NgN(Next generation Network) architecture is expected to offer a new Internet platforms such as QoS(Quality of Service) guaranteed services as it overcame the limitations of the existing best-effort Internet architecture. However, policy development crucial for the NgN framework(e.g., interconnections and billing) is lagging far behind technology development. For example, arguments over network neutrality clearly indicate little understanding of the Internet industry structure where diverse providers including ISP and CP coexist. This study employs a network economics approach to predict how the competitive landscape involving various providers will evolve under the traffic-based billing system under the NgN environment. Applied is the non-cooperative game theory, in particular, Stackelberg's repeated game in order to build and analyze model for competition among those providers. We also studied possible impacts that CPs would have on the competitive landscape if they have an option to replace ISP: i.e., CDN(Content Delivery Network) provider. Lastly, based on the model analysis and experiments, presented are their implications to policy development and tile future prospect.