Generating Functions for Computing the Myerson Value

J.R. Fernández, E. Algaba, J.M. Bilbao (), A. Jiménez, N. Jiménez and J.J. López

Annals of Operations Research, 2002, vol. 109, issue 1, 143-158

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. Copyright Kluwer Academic Publishers 2002

Keywords: complexity; Myerson value; weighted voting games (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1016348001805 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:109:y:2002:i:1:p:143-158:10.1023/a:1016348001805

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1016348001805

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().