• Title/Summary/Keyword: Strategy Game

Search Result 514, Processing Time 0.021 seconds

Analysis of Metaverse Business Model and Ecosystem (메타버스 비즈니스 모델 및 생태계 분석)

  • Seok, W.H.
    • Electronics and Telecommunications Trends
    • /
    • v.36 no.4
    • /
    • pp.81-91
    • /
    • 2021
  • Recently, discussions on Metaverse, which represents the transcendent world, have been dominant for some time. Cases related to the Metaverse are introduced through various media and are continuously attracting attention as the next generation of the Internet. This study reviews the business model and the ecosystem overview, focusing on service cases related to the Metaverse. The widely used business models include content production and sales, media brokerage fee, and marketing fee. The Metaverse ecosystem is formed around games, with major players in game production, authoring tool & support SW, intelligent cloud service, and game platform expected to lead the market. Results show that a strategy to secure the leadership of the Metaverse, such as the business model expansion conditions, a strategy to foster a game-oriented Metaverse ecosystem, and technology development for the realization of the ultra-realistic Metaverse, is necessary.

A Study on the Game Marketing Strategy in the Streaming Support System Environment (스트리밍 지원 시스템 환경에서의 게임 마케팅 전략에 관한 연구)

  • Kim, Hyo-Nam
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2020.01a
    • /
    • pp.51-54
    • /
    • 2020
  • 스마트폰의 보급으로 빠르게 성장한 인터넷 시장은 다양한 정보를 쉽고 빠르게 접할 수 있게 되었고 많은 사람들이 찾아보는 실시간 스트리밍 또한 빠른 속도로 성장하였다. 실시간 스트리밍이 알려지고 성장하기까지는 긴 시간이 걸리지 않았으며 현재까지도 급격하게 성장하고 있는 추세이다. 본 논문에서는 글로벌 대표 기업들이 클라우드 기반의 게임 플랫폼 시스템을 제시하고 있는 반면 국내 기업들의 상황은 그렇지 못하고 있는 부분에 대해서 게임 플레어들의 스트리밍 기반의 게임 구입 선호도 설문을 통해 국내 게임 마케팅에 스트리밍 기반의 게임 판매 전략에 중요성을 제시하고자 한다.

  • PDF

Modeling and Stimulating Node Cooperation in Wireless Ad Hoc Networks

  • Arghavani, Abbas;Arghavani, Mahdi;Sargazi, Abolfazl;Ahmadi, Mahmood
    • ETRI Journal
    • /
    • v.37 no.1
    • /
    • pp.77-87
    • /
    • 2015
  • In wireless networks, cooperation is necessary for many protocols, such as routing, clock synchronization, and security. It is known that cooperator nodes suffer greatly from problems such as increasing energy consumption. Therefore, rational nodes have no incentive to cooperatively forward traffic for others. A rational node is different from a malicious node. It is a node that makes the best decision in each state (cooperate or non-cooperate). In this paper, game theory is used to analyze the cooperation between nodes. An evolutionary game has been investigated using two nodes, and their strategies have been compared to find the best one. Subsequently, two approaches, one based on a genetic algorithm (GA) and the other on learning automata (LA), are presented to incite nodes for cooperating in a noisy environment. As you will see later, the GA strategy is able to disable the effect of noise by using a big enough chromosome; however, it cannot persuade nodes to cooperate in a noisefree environment. Unlike the GA strategy, the LA strategy shows good results in a noise-free environment because it has good agreement in cooperation-based strategies in both types of environment (noise-free and noisy).

Optimal Allocation Strategy Based on Stackelberg Game for Inspecting Drunk Driving on Traffic Network

  • Jie, Yingmo;Li, Mingchu;Tang, Tingting;Guo, Cheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5759-5779
    • /
    • 2017
  • As the main means to cope with the stubborn problem of drunk driving, the inspection of drunk driving has already been paid more attention and thus reinforced. In this paper, we model this scenario as a Stackelberg game, where the police department (called defender) allocates resources dynamically in terms of the traffic situation on the traffic network to arrest drink drivers and drivers who drink (called attacker), whether choosing drunk driving or designated driving service, expect to minimize their cost for given travel routes. However, with the number of resources are limited, our goal is to calculate the optimal resource allocation strategy for the defender. Therefore, first, we provide an effective approach (named OISDD) to fulfill our goal, i.e., generate the optimal strategy to inspect drunk driving. Second, we apply OISDD to directed graphs (which are abstracted from Dalian traffic network) to analyze and test its correctness and rationality. The experimental results show that OISDD is feasible and efficient.

An Electronic Strategy in Innovative Learning Situations and the Design of a Digital Application for Individual Learning to Combat Deviant Intellectual Currents in Light of the Saudi Vision 2030

  • Aisha Bleyhesh, Al-Amri;Khaloud, Zainaddin;Abdulrahman Ahmed, Zahid;Jehan, Sulaimani
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.12
    • /
    • pp.217-228
    • /
    • 2022
  • The study aimed to build an electronic strategy in innovative learning situations for the role of education in combating intellectual currents. A total of 525 Saudi university faculty members and general education teachers were surveyed using two electronic questionnaires. Arithmetic averages and standard deviations, One-way ANOVA, Scheffé's test, Pearson's correlation coefficient, and Cronbach's alpha stability coefficient were used as statistical methods. The study statistically identifies the differences between the study sample at the level of significance (0.05). and the design of a digital application for individual learning to combat deviant intellectual currents to activate them in light of Saudi Vision 2030 by combining the theoretical academic material and turning it into a learning e-game called (crosswords). The game is equipped with hyper media that supports education with entertainment to direct ideas towards the promotion of identity, the development of values towards moderation and the consolidation of intellectual security. Additionally, the learning e-game represents awareness messages in three short films to activate the role of curricula and intellectual awareness centers to apply realistically, innovatively, and effectively.

Fun Factors by Game Genre (게임의 장르별 재미 요소)

  • Park, Chan-Il;Yang, Hae-Seung;Yang, Hae-Sool
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.12
    • /
    • pp.20-29
    • /
    • 2007
  • The ultimate purpose of producing game is to make successful sale as making players to be fun. We have to identify fun factors of game and analyze player activities more detail to make fun game. In this paper, we compare game fun factors and select the most detailed one of them and then computed weight factors with AHP method. Based on survey of game players of the selected fun factors, we quantified satisfaction of game fun factors. The result of this paper can be used for assessment of game fun satisfaction and establish game development strategy to implement fun factors according to game genre.

The extremal shift method for the feedback optimal game-control problems

  • Park, Young-Sang;Andrew N. Krasovskii
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1998.10a
    • /
    • pp.379-379
    • /
    • 1998
  • The report presents an approach to constructing or control algorithms for finite dimensional dynamical systems under the deficit of information about dynamical disturbances. The approach is based on the constructions of the extremal shift strategy of the differential game theory.

  • PDF

Power Control Algorithm with Finite Strategies: Game Theoretic Approach (게임이론을 이용한 유한 전략 집합을 갖는 전력제어 알고리즘)

  • Kim, Ju-Hyup;Jang, Yeon-Sik;Lee, Deok-Joo;Hong, Een-Kee
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.1
    • /
    • pp.87-96
    • /
    • 2009
  • The purpose of this paper is to analyze the power control problem in wireless communications with game theoretic approach. The major contribution of the present paper is that we formulated the problem as a game with a finite number of strategies while most of the previous game theoretic power control literatures modeled with continuous game in which there are infinite number of strategies. It should be noted that the closed-loop power control would be performed in a discrete manner, power up or down from the present level of power with fixed power control step size. We model the current closed-loop power control scheme with the famous Prisoner's dilemma model and show that the power-up strategy is Nash equilibrium. That is, every mobile tries to increase their power and approach to their maximal power. Thus, the outcome of current power control (Nash equilibrium) is inefficient. In order to attain efficient power control for the environment where ICI(Inter-Cell Interference is severe, we developed a new payoff function in which the penalty mechanism is introduced and derived conditions under which power-down becomes Nash equilibrium strategy for all players. Furthermore we examined the trajectory of equilibrium power when the power control game will be played repeatedly.

  • PDF

A Design of a Coordination Agent Controlling Decision with Each Other Agents in RTS (RTS 게임에서 에이전트와 상호 의사를 조절하는 조정 에이전트의 설계)

  • Park, Jin-Young;Sung, Yun-Sick;Cho, Kyung-Eun;Um, Ky-Hyun
    • Journal of Korea Game Society
    • /
    • v.9 no.5
    • /
    • pp.117-125
    • /
    • 2009
  • In real-time strategy simulation (RTS) game each team is composed of agents and executes strategies to win other team. Strategy needs agents' cooperation in each team. This needs multi-agent system (MAS). Centralized decision making, one of decision making in MAS, selects actions not to agents but to team by a coordinated agent. Decentralized decision making costs high because each agent communicates with each other. In this paper we propose a system which controls agents by grouping and allocates roles through negotiation by a coordinated agent. Then, when one of allocated actions is not executed or failed, a coordinated agent allocates its role to another agent. We make experiments in starcraft, famous RTS game. When a proposed method is applied, the performance of attack and defense is increased. The improved agents' team wins eight times per ten games.

  • PDF

Making Levels More Challenging with a Cooperative Strategy of Ghosts in Pac-Man (고스트들의 협력전술에 의한 팩맨게임 난이도 제고)

  • Choi, Taeyeong;Na, Hyeon-Suk
    • Journal of Korea Game Society
    • /
    • v.15 no.5
    • /
    • pp.89-98
    • /
    • 2015
  • The artificial intelligence (AI) of Non-Player Companions (NPC), especially opponents, is a key element to adjust the level of games in game design. Smart opponents can make games more challenging as well as allow players for diverse experiences, even in the same game environment. Since game users interact with more than one opponent in most of today's games, collaboration control of opponent characters becomes more important than ever before. In this paper, we introduce a cooperative strategy based on the A* algorithm for enemies' AI in the Pac-Man game. A survey from 17 human testers shows that the levels with our collaborative opponents are more difficult but interesting than those with either the original Pac-Man's personalities or the non-cooperative greedy opponents.