Allocation rules for hypergraph communication situations

From MaRDI portal
Publication:1185760

DOI10.1007/BF01253780zbMath0751.90103OpenAlexW2038090895MaRDI QIDQ1185760

S. H. Tijs, Anne van den Nouweland, P. E. M. Borm

Publication date: 28 June 1992

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01253780




Related Items (30)

The degree value for games with communication structureNew Characteristic Function for Cooperative Games with Hypergraph Communication StructureNetworks, Communication and Hierarchy: Applications to Cooperative GamesThe position value is the Myerson value, in a senseCominimum additive operatorsDecomposition of network communication gamesAdaptive allocation rules for hypergraph gamesCost sharing on prices for games on graphsPower surplus solutions for weighted hypergraph communication situationsThe Myerson value and superfluous supports in union stable systemsThe Myerson value for complete coalition structuresCapability accumulation and conglomeratization in the information ageThe two-step average tree value for graph and hypergraph gamesPotential maximizers and network formationValues and potential of games with cooperation structureA Note on the Position Value for Hypergraph Communication SituationsThe Myerson value for directed graph gamesA value for communication situations with players having different bargaining abilitiesThe within groups and the between groups Myerson valuesThe core of games on ordered structures and graphsA note on a value with incomplete communicationCooperative games with partial informationNetworks and outside optionsOn the structural stability of values for cooperative gamesAn allocation rule for dynamic random network formation processesThe average tree value for hypergraph gamesThe Myerson value on local structures of coalitionsConference structures and consistencyThe nucleolus and inheritance of properties in communication situationsHarsanyi power solutions for games on union stable systems



Cites Work




This page was built for publication: Allocation rules for hypergraph communication situations