Convexity of graph-restricted games induced by minimum partitions
From MaRDI portal
Publication:5242268
DOI10.1051/ro/2017069zbMath1432.91015OpenAlexW3023337657MaRDI QIDQ5242268
Publication date: 6 November 2019
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://halshs.archives-ouvertes.fr/halshs-01617023/file/articleSkoda-Pmin8.pdf
Cooperative games (91A12) Games involving graphs (91A43) Combinatorial optimization (90C27) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the convexity of communication games
- Monge extensions of cooperation and communication structures
- The position value for union stable systems
- Inheritance of convexity for partition restricted games
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Games induced by the partitioning of a graph
- Submodular functions and optimization.
- Graphs and Cooperation in Games
- Cores of games with restricted cooperation
- Cooperative Games under Augmenting Systems
- The core of games on ordered structures and graphs
- A unified approach to restricted games.
This page was built for publication: Convexity of graph-restricted games induced by minimum partitions