Graphs, topologies and simple games.

Bilbao, Jesús Mario. "Graphs, topologies and simple games.." Qüestiió 24.2 (2000): 317-331. <http://eudml.org/doc/40309>.

@article{Bilbao2000,
abstract = {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.},
author = {Bilbao, Jesús Mario},
journal = {Qüestiió},
keywords = {Juegos cooperativos; Grafos; Espacio topológico; multivariate split-plot designs; arbitrary dispersion matrices; robust procedures; tables},
language = {eng},
number = {2},
pages = {317-331},
title = {Graphs, topologies and simple games.},
url = {http://eudml.org/doc/40309},
volume = {24},
year = {2000},
}

TY - JOUR
AU - Bilbao, Jesús Mario
TI - Graphs, topologies and simple games.
JO - Qüestiió
PY - 2000
VL - 24
IS - 2
SP - 317
EP - 331
AB - 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.
LA - eng
KW - Juegos cooperativos; Grafos; Espacio topológico; multivariate split-plot designs; arbitrary dispersion matrices; robust procedures; tables
UR - http://eudml.org/doc/40309
ER -