AbstractIn 1987 Mozes invented a mathematical game on graphs and investigated its convergence properties using Weyl group theory. This paper arrives at some of his results and also at some previously unknown facts, using only elementary graph and matrix theory. The set of graphs with looping games is described, the total number of moves of any convergent game is determined, and a comparison test of convergence is stated
We present a new category of games on graphs and derive from it a model for Intuitionistic Linear Lo...
AbstractThe numbers game is a one-player game played on a finite simple graph with certain “amplitud...
AbstractGiven δ and n, a minimum degree game starts with n disconnected nodes. Two players alternate...
AbstractS. Mozes investigated a certain solitary game played on a weighted graph. Numbers are placed...
AbstractS. Mozes investigated a certain solitary game played on a weighted graph. Numbers are placed...
We embed Iterated Prisoner’s Dilemma problem into a graph system. Each vertex in the graph correspon...
The game domination number of a (simple, undirected) graph is defined by the following game. Two pla...
AbstractThe concept of an infinite game played on a finite graph is perhaps novel in the context of ...
The Game of Cycles, invented by Francis Su (2020, p.51) is an impartial game played on a graph, wher...
The game domination number-of a (simple, undirected) graph is defined by the following game. Two pla...
The game domination number-of a (simple, undirected) graph is defined by the following game. Two pla...
The numbers game is a one-player game played on a finite simple graph with certain “amplitudes” assi...
In 1981 the famous graph coloring game was introduced by Brams. The idea was to play a simple two pl...
The subject of this thesis is to introduce game theory and cooperative game theory in relation to gr...
The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on gra...
We present a new category of games on graphs and derive from it a model for Intuitionistic Linear Lo...
AbstractThe numbers game is a one-player game played on a finite simple graph with certain “amplitud...
AbstractGiven δ and n, a minimum degree game starts with n disconnected nodes. Two players alternate...
AbstractS. Mozes investigated a certain solitary game played on a weighted graph. Numbers are placed...
AbstractS. Mozes investigated a certain solitary game played on a weighted graph. Numbers are placed...
We embed Iterated Prisoner’s Dilemma problem into a graph system. Each vertex in the graph correspon...
The game domination number of a (simple, undirected) graph is defined by the following game. Two pla...
AbstractThe concept of an infinite game played on a finite graph is perhaps novel in the context of ...
The Game of Cycles, invented by Francis Su (2020, p.51) is an impartial game played on a graph, wher...
The game domination number-of a (simple, undirected) graph is defined by the following game. Two pla...
The game domination number-of a (simple, undirected) graph is defined by the following game. Two pla...
The numbers game is a one-player game played on a finite simple graph with certain “amplitudes” assi...
In 1981 the famous graph coloring game was introduced by Brams. The idea was to play a simple two pl...
The subject of this thesis is to introduce game theory and cooperative game theory in relation to gr...
The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on gra...
We present a new category of games on graphs and derive from it a model for Intuitionistic Linear Lo...
AbstractThe numbers game is a one-player game played on a finite simple graph with certain “amplitud...
AbstractGiven δ and n, a minimum degree game starts with n disconnected nodes. Two players alternate...
DOI
Add to ORKG
