• 제목/요약/키워드: Mathematical Game

검색결과 168건 처리시간 0.121초

Teaching Mathematics Through Games at the First Stage of Elementary Education

  • Soylu, Yasin;Isik, Ahmet
    • 한국수학교육학회지시리즈D:수학교육연구
    • /
    • 제7권4호
    • /
    • pp.223-234
    • /
    • 2003
  • Children interest themselves in all different toys they see, before beginning to speak. The psychological reasons for children′s interest in toys have been investigated for a long time. Thus many scientists have studied on the question "what is game?", but they have not reached a consensus yet. Such contradiction may be dependent upon different points of view of the researchers about game. Besides, the view of game of a child and an adult is different too. According to an adult game is a rebirth and escape from monotony. For child it is a work. The aim of this study is to make mathematics regarding a mass of abstract concepts for the students of grade 1-3 of primary school in the concrete operations period, more attractive with the help of educational and instructional games, and to contribute to student′s developing. The capability of thinking and producing by changing abstract concepts into concrete ones.

  • PDF

초등학교 5$\cdot$6학년 특별 보충반 학생들의 나눗셈 연산능력 신장에 관한 연구 (A Study on the Improvement of Division Skill of 5th and 6th Grade Children Needing Extra Class after School)

  • 송영무;박윤자
    • 한국수학교육학회지시리즈A:수학교육
    • /
    • 제44권2호
    • /
    • pp.265-280
    • /
    • 2005
  • According to the characteristics of elementary school students in favor of playing games, and to their high energy levels and physical growth states, it is fair to say that students can learn mathematics through 'game playing activities.' These activities are considered to intrigue their interest in class and make them feel less stress from the burden of studying mathematics. Mr. Skemp, who had conducted research on 'game activity' with experimental studies relating to elementary mathematics, recommends that math teachers try to give as many activity-oriented classes as possible to students. The method of 'game activity' by Skemp's operation deals with the whole range of mathematical themes. It is believed by other math teachers that this is not a way to substitute free time or just to have fun in class, but an intentionally well-organized way of learning an entire mathematical course during elementary school. In this research, 5th and 6th grade students needing extra classes after school had been exposed to 'ame activity' by Skemp's operation. As a result, we can figure out its influence on their understanding of arithmetic ability, and on the cognitive definition territory in their minds.

  • PDF

ON A GENERALIZED BERGE STRONG EQUILIBRIUM

  • Kim, Won Kyu
    • 대한수학회논문집
    • /
    • 제29권2호
    • /
    • pp.367-377
    • /
    • 2014
  • In this paper, we first introduce a generalized concept of Berge strong equilibrium for a generalized game $\mathcal{G}=(X_i;T_i,f_i)_{i{\in}I}$ of normal form, and using a fixed point theorem for compact acyclic maps in admissible convex sets, we establish the existence theorem of generalized Berge strong equilibrium for the game $\mathcal{G}$ with acyclic values. Also, we have demonstrated by examples that our new approach is useful to produce generalized Berge strong equilibria.

NOTE ON PURE-STRATEGY NASH EQUILIBRIA IN MATRIX GAMES

  • Ma, Weidong
    • 대한수학회보
    • /
    • 제49권6호
    • /
    • pp.1251-1254
    • /
    • 2012
  • Pure-strategy Nash Equilibrium (NE) is one of the most important concepts in game theory. Tae-Hwan Yoon and O-Hun Kwon gave a "sufficient condition" for the existence of pure-strategy NEs in matrix games [5]. They also claimed that the condition was necessary for the existence of pure-strategy NEs in undominated matrix games. In this short note, we show that these claims are not true by giving two examples.

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

COINCIDENCE THEOREMS ON A PRODUCT OF GENERALIZED CONVEX SPACES AND APPLICATIONS TO EQUILIBRIA

  • Park, Se-Hie;Kim, Hoon-Joo
    • 대한수학회지
    • /
    • 제36권4호
    • /
    • pp.813-828
    • /
    • 1999
  • In this paper, we give a Peleg type KKM theorem on G-convex spaces and using this, we obtain a coincidence theorem. First, these results are applied to a whole intersection property, a section property, and an analytic alternative for multimaps. Secondly, these are used to proved existence theorems of equilibrium points in qualitative games with preference correspondences and in n-person games with constraint and preference correspondences for non-paracompact wetting of commodity spaces.

  • PDF

GENERALIZED STABILITIES OF CAUCHY'S GAMMA-BETA FUNCTIONAL EQUATION

  • Lee, Eun-Hwi;Han, Soon-Yi
    • 호남수학학술지
    • /
    • 제30권3호
    • /
    • pp.567-579
    • /
    • 2008
  • We obtain generalized super stability of Cauchy's gamma-beta functional equation B(x, y) f(x + y) = f(x)f(y), where B(x, y) is the beta function and also generalize the stability in the sense of R. Ger of this equation in the following setting: ${\mid}{\frac{B(x,y)f(x+y)}{f(x)f(y)}}-1{\mid}$ < H(x,y), where H(x,y) is a homogeneous function of dgree p(0 ${\leq}$ p < 1).

피연산자들의 트리구조 분석을 통한 게임공식 설계방법 (A Design Method of Game Formulas by Analyzing the Tree Structure of The Operands)

  • 장희동
    • 한국게임학회 논문지
    • /
    • 제11권2호
    • /
    • pp.39-44
    • /
    • 2011
  • 컴퓨터게임은 게임규칙들을 컴퓨터가 자동적으로 처리하기 때문에 게임규칙들이 수학적 함수들로 표현된 게임공식들이 필요하다. 게임공식들은 일반적으로 다변수 함수들이다. 게임공식을 설계하는 것은 관련 게임규칙을 만족하는 다변수 함수를 설계하는 것이기 때문에 복잡하고 어려운 문제이다. 본 논문에서는 게임공식을 체계적으로 설계하는 방법을 제안하였다. 제안하는 방법은 다변수 함수인 게임공식을 피연산자들의 트리구조로 분해하여 이 트리구조의 최하위레벨에는 단일변수 함수들로 구성된다. 그래서 게임공식의 트리구조 분해를 통해 복잡하고 어려운 다변수 함수 설계 문제를 단순하고 쉬운 단일변수 함수 설계 문제로 변경하여 설계하는 방법이다.

동적게임이론을 이용한 최적입찰전략수립 (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.