No description
-
April 16, 2015 (v1)PublicationUploaded on: March 27, 2023
-
April 5, 2021 (v1)Publication
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...
Uploaded on: December 4, 2022 -
April 17, 2017 (v1)Publication
The goal of this paper is to develop a theoretical framework inorder to analyze cooperative games inwhic h only certaincoalition s are allowed to form. We will axiomatize the structure of such allowable coalitions using the theory of antimatroids, a notion developed for combinatorially abstract sets. There have been previous models developed to...
Uploaded on: March 27, 2023 -
December 5, 2016 (v1)Publication
This paper analyzes a model of formation of connected coalitions in a cooperative game. This model is a communication situation, and the Shapley value of this graph-restricted game is the Myerson value. The potential function for cooperative games was defined by Hart and Mas-Colell, and Winter showed that the Myerson value admits a potential...
Uploaded on: March 27, 2023 -
April 18, 2017 (v1)Publication
This paper deals with cooperative games in which only certain coalitions are allowed to form. There have been previous models developed to confront the problem of nonfeasible coalitions. Games restricted by a communication graph are games in which the feasible coalitions are those that induce connected subgraphs. Another type of model is...
Uploaded on: March 27, 2023 -
June 29, 2020 (v1)Publication
En este trabajo se definen algoritmos, basados en funciones generatrices, para calcular el índice de poder de Banzhaf en juegos simples de votación ponderada y en juegos de doble y triple mayoría. La utilización de funciones generatrices permite un cálculo exacto del índice de Banzhaf con una reducción sensible de la complejidad temporal....
Uploaded on: December 4, 2022 -
December 10, 2016 (v1)Publication
En este trabajo se definen algoritmos, basados en funciones generatrices, para calcular el índice de poder de Banzhaf en juegos simples de votación ponderada y en juegos de doble y triple mayoría. La utilización de funciones generatrices permite un cálculo exacto del índice de Banzhaf con una reducción sensible de la complejidad temporal....
Uploaded on: December 4, 2022 -
August 28, 2019 (v1)Publication
La teoría de juegos es una valiosa herramienta para analizar situaciones económicas, políticas y sociales, mediante modelos basados en juegos de estrategia. En este libro se exponen las diversas aportaciones a la teoría general en dos campos: los modelos relacionados con los juegos con pagos vectoriales y los juegos de cooperación restringida.
Uploaded on: March 27, 2023