Games induced by the partitioning of a graph

DOI10.1007/s10479-012-1200-8zbMath1262.90032OpenAlexW2091117768MaRDI QIDQ1945082

Michel Grabisch, Alexandre Skoda

Publication date: 2 April 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1200-8

zbMATH Keywords

communication networkscooperative gamecoalition structurestrength of a graph

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Cooperative games (91A12)

Related Items

Inheritance of convexity for the \(\mathcal{P}_{\min}\)-restricted game ⋮ Fast approximation of matroid packing and covering ⋮ Inheritance of convexity for partition restricted games ⋮ Multi-sided assignment games on \(m\)-partite graphs ⋮ Cores and optimal fuzzy communication structures of fuzzy games ⋮ Convexity of graph-restricted games induced by minimum partitions

Cites Work

• On the convexity of communication games
• A new algorithm for the intersection of a line with the independent set polytope of a matroid
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Optimal attack and reinforcement of a network
• Values of Graph-Restricted Games
• Computing the Strength of a Graph
• Graphs and Cooperation in Games
• Cores of games with restricted cooperation
• The core of games on ordered structures and graphs
• A unified approach to restricted games.

This page was built for publication: Games induced by the partitioning of a graph