• School Mathematics
• /
• v.15 no.3
• /
• pp.619-632
• /
• 2013

One area where research is especially needed is their elaboration process and how they elaborate their idea as a group in a mathematical board game re-creation project. In this research, this process was named 'Mathematical Elaboration Process'. The purpose of this research is to understand how the gifted children elaborate their idea in a small group, and which idea can be chosen for a new board game when they are exposed to a project for making new mathematical board games using the what-if-not strategy. One of the gifted children's classes was chosen in which there were twenty students, and the class was composed of four groups in an elementary school in Korea. The researcher presented a series of re-creation game projects to them during the course of five weeks. To interpret their process of elaborating, the communication of the gifted students was recorded and transcribed. Students' elaboration processes were constructed through the interaction of both the mathematical route and the non-mathematical route. In the mathematical route, there were three routes; favorable thoughts, unfavorable thoughts and a neutral route. Favorable thoughts was concluded as 'Accepting', unfavorable thoughts resulted in 'Rejecting', and finally, the neutral route lead to a 'non-mathematical route'. Mainly, in a mathematical route, the reason of accepting the rule was mathematical thinking and logical reasons. The gifted children also show four categorized non-mathematical reactions when they re-created a mathematical board game; Inconsistency, Liking, Social Proof and Authority.

• Journal of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.871-881
• /
• 2008

In this paper, we study the core stability of the dominating set game which has arisen from the cost allocation problem related to domination problem on graphs. Let G be a graph whose neighborhood matrix is balanced. Applying duality theory of linear programming and graph theory, we prove that the dominating set game corresponding to G has the stable core if and only if every vertex belongs to a maximum 2-packing in G. We also show that for dominating set games corresponding to G, the core is stable if it is large, the game is extendable, or the game is exact. In fact, the core being large, the game being extendable and the game being exact are shown to be equivalent.

• School Mathematics
• /
• v.12 no.3
• /
• pp.337-351
• /
• 2010

Blackout game on a certain size of the Go table, which looks simple, involves a variety of mathematical modeling. This study uses a research and education method. While the mathematically gifted students were playing blackout game, the author, as the instructor, observed the ways in which they approached various mathematical models. Based on the data, this study examines the effects of blackout game on the children's cognitive processes. This study further discusses the issues of questions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4157-4175
• /
• 2020

Moving target defense, as a 'game-changing' security technique for network warfare, realizes proactive defense by increasing network dynamics, uncertainty and redundancy. How to select the best countermeasure from the candidate countermeasures to maximize defense payoff becomes one of the core issues. In order to improve the dynamic analysis for existing decision-making, a novel approach of selecting the optimal countermeasure using game theory is proposed. Based on the signal game theory, a multi-stage adversary model for dynamic defense is established. Afterwards, the payoffs of candidate attack-defense strategies are quantified from the viewpoint of attack surface transfer. Then the perfect Bayesian equilibrium is calculated. The inference of attacker type is presented through signal reception and recognition. Finally the countermeasure for selecting optimal defense strategy is designed on the tradeoff between defense cost and benefit for dynamic network. A case study of attack-defense confrontation in small-scale LAN shows that the proposed approach is correct and efficient.

• The Mathematical Education
• /
• v.45 no.4 s.115
• /
• pp.507-518
• /
• 2006

There is a great need to find new topics which are good to evaluate and to encourage the mathematical creativity of gifted students, For the purpose to find such a topic, we study Ho-bak-go-nu game that is one of Korean traditional games and a typical alignment game. By analyzing patterns of possible alignment, the author gives a complete solution to win or not to lose according to the rules chosen by players. The author also poses several class-models including a test for the class of gifted students based on the analysis of real classes on Ho-bak-go-nu game.

• Journal of the Korean Mathematical Society
• /
• v.39 no.5
• /
• pp.745-764
• /
• 2002

In this paper we Study a time-optimal model of pursuit in which the players move on a plane with bounded velocities. This game is supposed to be a nonzero-sum group pursuit game. The main point of the work is to construct and compare cooperative and non-cooperative solutions in the game and make a conclusion about cooperation possibility in differential pursuit games. We consider all possible cooperations of the players in the game. For that purpose for every game $\Gamma(x_0,y_0,z_0)$ we construct the corresponding game in characteristic function form $\Gamma_v(x_0,y_0,z_0)$. We show that in this game there exists the nonempty core for any initial positions of the players. The core can take four various forms depending on initial positions of the players. We study how the core changes when the game is proceeding. For the original agreement (an imputation from the original core) to remain in force at each current instant t it is necessary for the core to be time-consistent. Nonemptiness of the core in any current subgame constructing along a cooperative trajectory and its time-consistency are shown. Finally, we discuss advantages and disadvantages of choosing this or that imputation from the core.

• Education of Primary School Mathematics
• /
• v.3 no.2
• /
• pp.133-142
• /
• 1999

When the game is used in mathematics loaming, students take pleasure of game in themselves and communicate through interaction with other students naturally. It is important because the game is activity for intellectual growth and social development. Also students have had affirmative attitude about mathematics by Emu. The communication in mathematics loaming helps that linking informal and intuitive thinking of students with abstract and basic mathematical language and that it also helps changing from the dependent situation to teacher to the self-directive teaming of students. The purpose of this thesis is to effect on extension of mathematical communication ability to the second grade of elementary school students by applying of computational-strategy games. It has conclusion as follows. Application of computational-strategy games had effected on extension of mathematical communication ability importantly. When students have mathematical communication through computational-strategy games, at the beginning, the words which students used was long, incorrect, and unnecessary words. But at the later, students became to use clear, correct concise words as they connect their routine language with mathematical symbol. Therefore we can make sure that mathematical communication ability of the second grade students' is extended by applying of computational-strategy games.

• The Journal of the Korea Contents Association
• /
• v.13 no.12
• /
• pp.680-689
• /
• 2013

In recent, much attention has been paid to the educational serious games that provide both fun and learning effects. However, most educational games have been targeted at the infants and children, and it is still hard to use such games in higher education. On the contrary, this paper aims to develop an educational game for teaching mathematical programming to the undergraduates. It is well known that most puzzle games can be transformed into associated optimization problem and vice versa, and this paper proposes a simple educational game based on the subset sum problem. This game enables the users to play the puzzle and construct their own mathematical programming model for solving it. Moreover, the users are provided with appropriate instructions for modeling and their models are evaluated by using the data automatically generated. It is expected that the educational game in this paper will be helpful for teaching basic programming models to the students in industrial engineering or management science.

• Journal of the Korean Mathematical Society
• /
• v.40 no.5
• /
• pp.883-899
• /
• 2003

In this paper, we will introduce the general concepts of generalized multiobjective game, generalized weight Nash equilibria and generalized Pareto equilibria. Next using the fixed point theorems due to Idzik [5] and Kim-Tan [6] , we shall prove the existence theorems of generalized weight Nash equilibria under general hypotheses. And as applications of generalized weight Nash equilibria, we shall prove the existence of generalized Pareto equilibria in non-compact generalized multiobjective game.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.127-131
• /
• 2020

We discuss two unrelated topics regarding Cops and Robbers, a well-known pursuit-evasion game played on a simple graph. First, we address a recent question of Breen et al. and prove the PSPACE-completeness of the cop throttling number, that is, the minimal possible sum of the number k of cops and the number capt(k) of moves that the robber can survive against k cops under the optimal play of both sides. Secondly, we revisit a teleporting version of the game due to Wagner; we disprove one of his conjectures and suggest a new related research problem.