A technique for graph-dynamic modeling of binary games based on scenario bindings

A technique for binary games modeling (describing) is suggested. It is based on integration of signed graphs and Petri nets techniques. The notions of “aimed-action graph”, “linear scenario of behavior of game party”, “binary scenario binding” are introduced. The modeling technique is illustrated on the example of a real politic binary game.