A context-free grammar G (henceforth abbreviated to “grammar”) is a 4-tuple (N,V, P, S) consisting of the following components: a finite set N of non-terminal variables, a finite set V of terminal variables that is disjoint from N , a finite set P of production rules, mapping non-terminal variables to a series of non-terminals and terminals, and a distinguished symbol S ∈ N that is the start sy...

A context-free grammar G (henceforth abbreviated to “grammar”) is a 4-tuple (N,V, P, S) consisting of the following components: a finite set N of non-terminal variables, a finite set V of terminal variables that is disjoint from N , a finite set P of production rules, mapping non-terminal variables to a series of non-terminals and terminals, and a distinguished symbol S ∈ N that is the start sy...

analyzing free riding problem through static games considering homogenous players has been resulted in choosing the free riding strategy as a dominant strategy for the players. in this paper free riding is analyzed through cooperation game imposing non-homogenous players using network models. players would be differentiated by their links with their neighbors in the game. evolutionary game theo...