Generating Functions for Computing the Myerson Value |
| |
Authors: | JR Fernández E Algaba JM Bilbao A Jiménez N Jiménez JJ López |
| |
Institution: | (1) Matemática Aplicada II, Escuela Superior de Ingenieros, Camino de los Descubrimientos s/n, 41092 Sevilla, Spain |
| |
Abstract: | The complexity of a computational problem is the order of computational resources which are necessary and sufficient to solve the problem. The algorithm complexity is the cost of a particular algorithm. We say that a problem has polynomial complexity if its computational complexity is a polynomial in the measure of input size. We introduce polynomial time algorithms based in generating functions for computing the Myerson value in weighted voting games restricted by a tree. Moreover, we apply the new generating algorithm for computing the Myerson value in the Council of Ministers of the European Union restricted by a communication structure. |
| |
Keywords: | complexity Myerson value weighted voting games |
本文献已被 SpringerLink 等数据库收录! |