On the convexity of communication games
From MaRDI portal
Publication:811421
DOI10.1007/BF01766431zbMath0734.90126OpenAlexW1991088533MaRDI QIDQ811421
Anne van den Nouweland, P. E. M. Borm
Publication date: 1991
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01766431
Related Items (17)
On the convexity of independent set games ⋮ A simple procedure to compute the nucleolus of \(\Gamma\)-component additive games ⋮ Inheritance of convexity for the \(\mathcal{P}_{\min}\)-restricted game ⋮ The Myerson value and superfluous supports in union stable systems ⋮ A new stable and more responsive cost sharing solution for minimum cost spanning tree problems ⋮ A value for generalized probabilistic communication situations ⋮ Games induced by the partitioning of a graph ⋮ On hierarchies and communication ⋮ Values and potential of games with cooperation structure ⋮ Inheritance of convexity for partition restricted games ⋮ The core of games on ordered structures and graphs ⋮ Games with a permission structure -- a survey on generalizations and applications ⋮ An efficient characterization of submodular spanning tree games ⋮ Convexity of graph-restricted games induced by minimum partitions ⋮ The Banzhaf power index on convex geometries ⋮ The nucleolus and inheritance of properties in communication situations ⋮ A Simple Bargaining Procedure for the Myerson Value
Cites Work
This page was built for publication: On the convexity of communication games
