merged

Study of Network Games with Many Attackers and Defenders
Mak Jia Le
Supervisor: Dr. Ahmad Termimi Bin Ab Ghani
Bachelor of Science (Computational Mathematics)
School of Informatics and Applied Mathematics
In network games with two types of players, attackers and a defender, Mavronicolas et
al. (2008) introduced that network game as an undirected graph which vertices are
attacked by attackers whereas the edges are selectively protected by a defender. They
showed that unless the graph is trivial, a graph-theoretic network game has no pure Nash
equilibrium. In this research, we discuss the network games with many attackers and
defenders with interchange the roles of player. In addition, the objective of this research
is to prove the existence of Nash equilibrium in the new model of network games. In the
graph-theoretic network games, if attacker caught by the defender, it will receive 0 and
1 otherwise. We provide a graph-theoretic characterization of Nash equilibrium of our
new model, in particular we study the properties of new model and prove the existence
of Nash equilibrium in the new model of network games.
943 | UMT UNDERGRADUATE RESEARCH DAY 2018