Graphs, topologies and simple games.
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 space.