Artículo
Graphs, Topologies and simple games
Autor/es | Bilbao Arrese, Jesús Mario |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada II (ETSI) |
Fecha de publicación | 2000 |
Fecha de depósito | 2021-04-05 |
Publicado en |
|
Resumen | We study the existence of connected coalitions in a simple game restricted
by a partia/ order. First, we define a topology compatible with the par-
tia/ order in the set of players. Second, we prove some properties of ... We study the existence of connected coalitions in a simple game restricted by a partia/ order. First, we define a topology compatible with the par- tia/ 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 coa- litions such that contains dominant players in simple games restricted by the connected subspaces of a finite topological space. |
Identificador del proyecto | USE 97-191
![]() |
Cita | Bilbao Arrese, J.M. (2000). Graphs, Topologies and simple games. Questiió: Quaderns d'Estadística, Sistemes, Informatica i Investigació Operativa, 24 (2), 317-331. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Graphs, topologíes.pdf | 410.9Kb | ![]() | Ver/ | |