Pages that link to "Item:Q811421"
From MaRDI portal
The following pages link to On the convexity of communication games (Q811421):
Displayed 17 items.
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems (Q417711) (← links)
- Games with a permission structure -- a survey on generalizations and applications (Q526627) (← links)
- The Banzhaf power index on convex geometries (Q1296463) (← links)
- Inheritance of convexity for partition restricted games (Q1751228) (← links)
- A simple procedure to compute the nucleolus of \(\Gamma\)-component additive games (Q1919115) (← links)
- The Myerson value and superfluous supports in union stable systems (Q1935304) (← links)
- Games induced by the partitioning of a graph (Q1945082) (← links)
- Values and potential of games with cooperation structure (Q1972566) (← links)
- The nucleolus and inheritance of properties in communication situations (Q2095955) (← links)
- A value for generalized probabilistic communication situations (Q2427196) (← links)
- On hierarchies and communication (Q2450142) (← links)
- On the convexity of independent set games (Q2659079) (← links)
- Inheritance of convexity for the \(\mathcal{P}_{\min}\)-restricted game (Q2661754) (← links)
- A Simple Bargaining Procedure for the Myerson Value (Q2867523) (← links)
- Convexity of graph-restricted games induced by minimum partitions (Q5242268) (← links)
- The core of games on ordered structures and graphs (Q5902298) (← links)
- An efficient characterization of submodular spanning tree games (Q5918917) (← links)