| Article ID: | iaor2003644 |
| Country: | Netherlands |
| Volume: | 109 |
| Issue: | 1 |
| Start Page Number: | 143 |
| End Page Number: | 158 |
| Publication Date: | Jan 2002 |
| Journal: | Annals of Operations Research |
| Authors: | Bilbao J.M., Jimnez N., Algaba E., Lpez J.J., Fernndez J.R., Jimnez A. |
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.