Some heuristics in automatic theorem proving.
Cvetković, Dragoš, Pevac, Irena (1984)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Cvetković, Dragoš, Pevac, Irena (1984)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Nancy E. Clarke, Richard J. Nowakowski (2005)
Discussiones Mathematicae Graph Theory
Similarity:
In this version of the Cops and Robber game, the cops move in tandems, or pairs, such that they are at distance at most one from each other after every move. The problem is to determine, for a given graph G, the minimum number of tandems sufficient to guarantee a win for the cops. We investigate this game on three graph products, the Cartesian, categorical and strong products.
Kárná, Lucie
Similarity:
This article formalizes some aspects of the board game Carcassonne. Combinatorical problems related to the number of tile types are mentioned. Then the paper describes a game map using graph theory.
Riis, Søren (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ljiljana Pavlović (1993)
The Yugoslav Journal of Operations Research
Similarity:
Stephan Dominique Andres, Andrea Theuser (2016)
Discussiones Mathematicae Graph Theory
Similarity:
We generalize the methods of Esperet and Zhu [6] providing an upper bound for the game colouring number of squares of graphs to obtain upper bounds for the game colouring number of m-th powers of graphs, m ≥ 3, which rely on the maximum degree and the game colouring number of the underlying graph. Furthermore, we improve these bounds in case the underlying graph is a forest.
György Szabó (2008)
Banach Center Publications
Similarity:
We survey several mechanisms supporting the maintenance of cooperation for evolutionary Prisoner's Dilemma games. In these models players are located on the sites of a lattice or graph and they can follow one of the pure strategies: cooperation (C) or defection (D). Their total income comes from Prisoner's Dilemma games with their neighbors. We discuss the consequences of different evolutionary rules determining the time-dependence of the strategy distribution and compare the results...
Barát, János, Stojaković, Miloš (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ferber, Asaf, Hefetz, Dan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nowakowski, Richard J., Ottaway, Paul (2005)
Integers
Similarity:
Jesús Mario Bilbao (2000)
Qüestiió
Similarity:
We study the existence of connected coalitions in a simple game restricted by a partial order. First, we define a topology compatible with the partial order in the set of players. Second, we prove some properties of the covering and comparability graphs of a finite poset. Finally, we analize the core and obtain sufficient conditions for the existence of winning coalitions such that contains dominant players in simple games restricted by the connected subspaces of a finite topological...
Julio B. Clempner, Alexander S. Poznyak (2011)
International Journal of Applied Mathematics and Computer Science
Similarity:
We introduce the concept of a Lyapunov game as a subclass of strictly dominated games and potential games. The advantage of this approach is that every ergodic system (repeated game) can be represented by a Lyapunov-like function. A direct acyclic graph is associated with a game. The graph structure represents the dependencies existing between the strategy profiles. By definition, a Lyapunov-like function monotonically decreases and converges to a single Lyapunov equilibrium point identified...
Nešetřil, J., Sopena, E. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lee, Jae-Ha, Park, Chong-Dae, Chwa, Kyung-Yong (2001)
Journal of Graph Algorithms and Applications
Similarity:
Albert, Michael H., Grossman, J.P., Nowakowski, Richard J., Wolfe, David (2005)
Integers
Similarity: