الفهرس 
2 Simultaneous gameOnly 14 pages are availabe for public view
 |  | from | 79 |  |  |
| | | from | 79 | | |
Abstract
We, humans, cannot survive without interacting with other humans, and ironically, it sometimes seems that we have survived despite those interactions. The subject matter of game theory is exactly those interactions within a group of individuals (or governments, firms, etc.) where the actions of each individual have an effect on the outcome that is of interest to all. In this thesis, we will study the concept of surreal numbers and their relationship to some games and link them in an understandable way, and then put some concepts related to the relationship of the graph to the games and study a game represented on the graphs and we show some properties.
This dissertation falls into four chapters as following.
Chapter One: In this chapter, we will present a critical introduction to basic concepts of game theory. These include basic definitions of simultaneous game and sequential game, describing strategic games, discussion the combinatorial games in detail and explain some models of combinatorial games.
Chapter Two: In this chapter we study construction of the Surreal Numbers, showing it is a class that forms the totally ordered field, and then explore some of new numbers, we present to the reader some algebraic operations related to combinatorial games and gives a detailed outlook of the Surreal Numbers. A fresh outlook to some combinatorial mathematical algebraic operations, through the evaluation of a deduced several algebraic concepts. The findings in this chapter have been published in International Journal of Scientific & Engineering Research in 2020 under the name “Maan T. Alabdullah, Essam El-Seidy and Neveen S. Morcos (2020). On Numbers and Games, International Journal of Scientific & Engineering Research, Volume 11, Issue 2, February -2020.”.
Chapter Three: We begin our investigation of the surreals by looking at what numbers are created on the first few days, and then verifying some basic properties of all numbers. Then we add the addition and multiplication of the surreal numbers, we end the chapter by introducing how surreal numbers can be used to analyze games, in particular the game of Hackenbush
Chapter Four: In this chapter, we provide basic knowledge of definitions and concepts related to the concept of matching in the graph. We are studying a model of games based on two players who take turns adding edges to G, this process eventually produces a maximal matching of the graph. We call the first Maximizer and second player Minimizer. The first aims to get a final matching to be large while the second one wants to reduce it. Maximizer wins if he manages a maximal matching while Minimizer wins if he can prevent him from doing this. The matcher number (α_g ) ́(G) is the number of edges chosen when both players play optimally, while the matching number (α_ ) ́(G) is the number of maximum matching edges. In this chapter, we study the relationship between (α_g ) ́(G) and (α_ ) ́(G) .And we also prove some results on types of graph.