Generating functions for computing the Myerson value
From MaRDI portal
Publication:1614134
DOI10.1023/A:1016348001805zbMath1007.91005MaRDI QIDQ1614134
Publication date: 3 September 2002
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items (18)
Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players ⋮ A cooperative value in a multiplicative model ⋮ Networks, Communication and Hierarchy: Applications to Cooperative Games ⋮ Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation ⋮ The complexity of power indexes with graph restricted coalitions ⋮ A generating functions approach for computing the public good index efficiently ⋮ A value for communication situations with players having different bargaining abilities ⋮ Polynomial calculation of the Shapley value based on sampling ⋮ The \(cg\)-position value for games on fuzzy communication structures ⋮ An approach via generating functions to compute power indices of multiple weighted voting games with incompatible players ⋮ Banzhaf index for multiple voting systems. An application to the European Union ⋮ Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras ⋮ Weighted multiple majority games with unions: generating functions and applications to the European Union ⋮ Voting power on a graph connected political space with an application to decision-making in the council of the European Union ⋮ Attachment centrality: measure for connectivity in networks ⋮ The \(cg\)-average tree value for games on cycle-free fuzzy communication structures ⋮ Measuring power in coalitional games with friends, enemies and allies ⋮ Generating functions for coalitional power indices: an application to the IMF
Uses Software
This page was built for publication: Generating functions for computing the Myerson value
