Generating functions for computing the Myerson value
From MaRDI portal
Recommendations
Cited in
(19)- Weighted multiple majority games with unions: generating functions and applications to the European Union
- Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation
- The cg-position value for games on fuzzy communication structures
- Voting power on a graph connected political space with an application to decision-making in the council of the European Union
- Measuring power in coalitional games with friends, enemies and allies
- A value for communication situations with players having different bargaining abilities
- An approach via generating functions to compute power indices of multiple weighted voting games with incompatible players
- Attachment centrality: measure for connectivity in networks
- The cg-average tree value for games on cycle-free fuzzy communication structures
- Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players
- A cooperative value in a multiplicative model
- A generating functions approach for computing the public good index efficiently
- Networks, communication and hierarchy: applications to cooperative games
- Generating functions of weighted voting games, MacMahon's partition analysis, and Clifford algebras
- Efficient Shapley performance attribution for least-squares regression
- Banzhaf index for multiple voting systems. An application to the European Union
- Generating functions for coalitional power indices: an application to the IMF
- The complexity of power indexes with graph restricted coalitions
- Polynomial calculation of the Shapley value based on sampling
This page was built for publication: Generating functions for computing the Myerson value
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1614134)
