Fernández, J. R.; Algaba, E.; Bilbao, J. M.; Jiménez, A.; Jiménez, N. Generating functions for computing the Myerson value. (English) Zbl 1007.91005 Ann. Oper. Res. 109, 143-158 (2002). Summary: 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. Cited in 18 Documents MSC: 91A12 Cooperative games 65Y20 Complexity and performance of numerical algorithms Keywords:complexity; Myerson value; weighted voting games Software:Mathematica PDFBibTeX XMLCite \textit{J. R. Fernández} et al., Ann. Oper. Res. 109, 143--158 (2002; Zbl 1007.91005) Full Text: DOI