Graph domination games represent a vibrant area of combinatorial game theory wherein two opponents engage in a strategic contest on the vertices of a graph. In the standard format, one player, known ...

We discuss an integer programming formulation for a class of cooperative games. We focus on algorithmic aspects of the core, one of the most important solution concepts in cooperative game theory.

This is a preview. Log in through your library . Abstract The eigenvalues of the adjacency operator of a finite regular graph yield a great deal of information about the graph, including bounds on its ...