• Title/Summary/Keyword: Game Optimal

Search Result 274, Processing Time 0.43 seconds

Optimal Charging and Discharging for Multiple PHEVs with Demand Side Management in Vehicle-to-Building

  • Nguyen, Hung Khanh;Song, Ju Bin
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.662-671
    • /
    • 2012
  • Plug-in hybrid electric vehicles (PHEVs) will be widely used in future transportation systems to reduce oil fuel consumption. Therefore, the electrical energy demand will be increased due to the charging of a large number of vehicles. Without intelligent control strategies, the charging process can easily overload the electricity grid at peak hours. In this paper, we consider a smart charging and discharging process for multiple PHEVs in a building's garage to optimize the energy consumption profile of the building. We formulate a centralized optimization problem in which the building controller or planner aims to minimize the square Euclidean distance between the instantaneous energy demand and the average demand of the building by controlling the charging and discharging schedules of PHEVs (or 'users'). The PHEVs' batteries will be charged during low-demand periods and discharged during high-demand periods in order to reduce the peak load of the building. In a decentralized system, we design an energy cost-sharing model and apply a non-cooperative approach to formulate an energy charging and discharging scheduling game, in which the players are the users, their strategies are the battery charging and discharging schedules, and the utility function of each user is defined as the negative total energy payment to the building. Based on the game theory setup, we also propose a distributed algorithm in which each PHEV independently selects its best strategy to maximize the utility function. The PHEVs update the building planner with their energy charging and discharging schedules. We also show that the PHEV owners will have an incentive to participate in the energy charging and discharging game. Simulation results verify that the proposed distributed algorithm will minimize the peak load and the total energy cost simultaneously.

Extended Information Entropy via Correlation for Autonomous Attribute Reduction of BigData (빅 데이터의 자율 속성 감축을 위한 확장된 정보 엔트로피 기반 상관척도)

  • Park, In-Kyu
    • Journal of Korea Game Society
    • /
    • v.18 no.1
    • /
    • pp.105-114
    • /
    • 2018
  • Various data analysis methods used for customer type analysis are very important for game companies to understand their type and characteristics in an attempt to plan customized content for our customers and to provide more convenient services. In this paper, we propose a k-mode cluster analysis algorithm that uses information uncertainty by extending information entropy to reduce information loss. Therefore, the measurement of the similarity of attributes is considered in two aspects. One is to measure the uncertainty between each attribute on the center of each partition and the other is to measure the uncertainty about the probability distribution of the uncertainty of each property. In particular, the uncertainty in attributes is taken into account in the non-probabilistic and probabilistic scales because the entropy of the attribute is transformed into probabilistic information to measure the uncertainty. The accuracy of the algorithm is observable to the result of cluster analysis based on the optimal initial value through extensive performance analysis and various indexes.

Comparative Analysis of Game-Theoretic Demand Allocation for Enhancing Profitability of Whole Supply Chain (전체 공급망 수익성 개선을 위한 게임이론 기반의 수요 할당 메커니즘의 비교 연구)

  • Shin, Kwang Sup
    • The Journal of Society for e-Business Studies
    • /
    • v.19 no.1
    • /
    • pp.43-61
    • /
    • 2014
  • This research is an application of game theory to developing the supplier selection and demand allocation mechanism, which are the essential and major research areas of supply chain planning and operation. In this research, the most popular and widely accepted mechanism, the progressive reverse auction is analyzed and compared with the other game theoretic approach, Kalai-Smorodinsky Bargaining Solution in the viewpoint of holistic efficiency of supply chain operation. To logically and exquisitely compare the efficiencies, a heuristic algorithm based on Genetic Algorithm is devised to find the other optimal demand allocation plan. A well known metric, profit-cost ratio, as well as profit functions for both suppliers and buyer has been designed for evaluating the overall profitability of supply chain. The experimental results with synthesis data and supply chain model which were made to mimic practical supply chain are illustrated and analyzed to show how the proposed approach can enhance the profitability of supply chain planning. Based on the result, it can be said that the proposed mechanism using bargainging solution mayguarantee the better profitability for the whole supply chin including both suppliers and buyer, even though quite small portion of buyer's profitability should be sacrified.

Explanation of Runs Lost Using Combined Fielding Indices in Korean Professional Baseball (결합된 수비지표들을 이용한 한국 프로야구의 실점 설명)

  • Kim, Hyuk Joo;Kim, Yea Hyoung
    • The Korean Journal of Applied Statistics
    • /
    • v.28 no.5
    • /
    • pp.1003-1011
    • /
    • 2015
  • We studied indices to explain runs lost for Korean professional baseball teams. Kim and Kim (2014) studied batting indices to explain run productivity of teams; subsequently, we studied fielding indices to explain runs lost. We considered several combined indices made by combining fielding indices closely connected with the runs lost of teams. Data analysis from all games in the regular seasons of 1982~2014 show that weighted WPH (defined as weighted average of WHIP and number of home runs allowed per game) best explain runs lost. Weighted WPH consisting of WHIP (with weight 81%) and number of home runs allowed per game (with weight 19%) was found optimal weighted WPH having correlation coefficient 0.95033 with average runs lost per game. Analysis by chronological periods gave results not much different.

Case Analysis of Conflicts in Renewable Power Generation Projects Using Non-cooperative Game Theory (비협조적 게임이론을 활용한 신재생발전사업 갈등 사례분석)

  • Park, Jaehyon;Kim, Kyeongkuk;Kim, Kyeongseok
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.44 no.2
    • /
    • pp.215-221
    • /
    • 2024
  • The government is encouraging the expansion of renewable energy facilities through national renewable energy policy. However, the installation of renewable energy generation facilities has led to local resident complaints due to landscape degradation, electromagnetic wave emission, real estate devaluation, and environmental pollution. This creates conflicts between power project developers and residents, making the progress of projects more difficult. This study applies non-cooperative game theory to analyze eight cases of renewable energy projects where conflicts between developers and residents were resolved through resident's investment participation. By accepting investments from local stakeholders, residents achieved returns ranging from a maximum of 25 % to a minimum of 4.1 %. It was found through game theory analysis that a dominant strategy involves residents agreeing to the development of the project and the developers sharing a portion of the profits with the residents. The analysis results show that the point where dominant strategy meet forms a Nash equilibrium, and at the same time becomes the Pareto optimal point, benefiting both power generation operators and residents.

Folding Analysis of Paper Structure and Estimation of Optimal Collision Conditions for Reversal (종이구조물의 접기해석과 반전을 위한 최적충돌조건의 산정)

  • Gye-Hee Lee
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.36 no.4
    • /
    • pp.213-220
    • /
    • 2023
  • This paper presents a model simulating the folding process and collision dynamics of "ddakji", a traditional Korean game played using paper tiles (which are also referred to as ddakji). The model uses two A4 sheets as the base materials for ddakji. The folding process involves a series of boundary conditions that transform the wing part of the paper structure into a twisted configuration. A rigid plate boundary condition is also adopted for squeezing, establishing the shape and stress state of the game-ready ddakji through dynamic relaxation analysis. The gaming process analysis involves a forced displacement of the striking ddakji to a predetermined collision position. Collision analysis then follows at a given speed, with the objective of overturning the struck ddakji--a winning condition. A genetic algorithm-based optimization analysis identifies the optimal collision conditions that result in the overturning of the struck ddakji. For efficiency, the collision analysis is divided into two stages, with the second stage carried out only if the first stage predicts a possible overturn. The fitness function for the genetic algorithm during the first stage is the direction cosine of the struck ddakji, whereas in the second stage, it is the inverse of the speed, thus targeting the lowest overall collision speed. Consequently, this analysis provides optimal collision conditions for various compression thicknesses.

Game Theory Application in Wetland Conservation Across Various Hypothetical City Sizes (다양한 이론적 도시규모에서의 습지 보전을 위한 게임 이론 적용)

  • Ran-Young Im;Ji Yoon Kim;Yuno Do
    • Journal of Wetlands Research
    • /
    • v.26 no.1
    • /
    • pp.10-20
    • /
    • 2024
  • The conservation and restoration of wetlands are essential tasks for the sustainable development of human society and the environment, providing vital benefits such as biodiversity maintenance, natural disaster mitigation, and climate change alleviation. This study aims to analyze the strategic interactions and interests among various stakeholders using game theory and to provide significant grounds for policy decisions related to wetland restoration and development. In this study, hypothetical scenarios were set up for three types of cities: large, medium, and small. Stakeholders such as governments, development companies, environmental groups, and local residents were identified. Strategic options for each stakeholder were developed, and a payoff matrix was established through discussions among wetland ecology experts. Subsequently, non-cooperative game theory was applied to analyze Nash equilibria and Pareto efficiency. In large cities, strategies of 'Wetland Conservation' and 'Eco-Friendly Development' were found beneficial for all stakeholders. In medium cities, various strategies were identified, while in small cities, 'Eco-Friendly Development' emerged as the optimal solution for all parties involved. The Pareto efficiency analysis revealed how the optimal solutions for wetland management could vary across different city types. The study highlighted the importance of wetland conservation, eco-friendly development, and wetland restoration projects for each city type. Accordingly, policymakers should establish regulations and incentives that harmonize environmental protection and urban development and consider programs that promote community participation. Understanding the roles and strategies of stakeholders and the advantages and disadvantages of each strategy is crucial for making more effective policy decisions.

Bidding Strategy Determination by Defining Strategic Vector

  • Kang, Dong-Joo;Kim, Balho H.;Chung, Koo-Hyung;Moon, Young-Hwan
    • KIEE International Transactions on Power Engineering
    • /
    • v.3A no.1
    • /
    • pp.47-52
    • /
    • 2003
  • This paper presents a schematic process based on the method of eliminating dominated strategies to obtain the optimal bidding strategy Pursuing the Nash equilibrium Point. The Proposed approach is demonstrated for a bidding game in a generation competitive market with 2-dimensional bidding strategy vectors constituting a price-quantity strategy curve.

Adapative Modular Q-Learning for Agents´ Dynamic Positioning in Robot Soccer Simulation

  • Kwon, Ki-Duk;Kim, In-Cheol
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.149.5-149
    • /
    • 2001
  • The robot soccer simulation game is a dynamic multi-agent environment. In this paper we suggest a new reinforcement learning approach to each agent´s dynamic positioning in such dynamic environment. Reinforcement learning is the machine learning in which an agent learns from indirect, delayed reward an optimal policy to choose sequences of actions that produce the greatest cumulative reward. Therefore the reinforcement learning is different from supervised learning in the sense that there is no presentation of input-output pairs as training examples. Furthermore, model-free reinforcement learning algorithms like Q-learning do not require defining or learning any models of the surrounding environment. Nevertheless ...

  • PDF

BEST PROXIMITY PAIRS AND NASH EQUILIBRIUM PAIRS

  • Kim, Won-Kyu;Kum, Sang-Ho
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.5
    • /
    • pp.1297-1310
    • /
    • 2008
  • Main purpose of this paper is to combine the optimal form of Fan's best approximation theorem and Nash's equilibrium existence theorem into a single existence theorem simultaneously. For this, we first prove a general best proximity pair theorem which includes a number of known best proximity theorems. Next, we will introduce a new equilibrium concept for a generalized Nash game with normal form, and as applications, we will prove new existence theorems of Nash equilibrium pairs for generalized Nash games with normal form.