The MaxIS-Shapley value in perfect graphs
From MaRDI portal
Publication:6606181
DOI10.1007/978-3-031-49611-0_14MaRDI QIDQ6606181
Junqi Tan, Dongjing Miao, Pengyu Chen
Publication date: 16 September 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- The strong perfect graph theorem
- Counting the number of independent sets in chordal graphs
- Determinants of matrices related to the Pascal triangle
- Computing the Shapley value of threshold cardinality matching games
- The complexity of computing the Tutte polynomial on transversal matroids
- Time-consistent Shapley value allocation of pollution cost reduction
- Shapley meets Shapley
- Bargaining Foundations of Shapely Value
- On the Complexity of Cooperative Solution Concepts
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Evaluation of Labeling Strategies for Rotating Maps
- Experimental and Efficient Algorithms
This page was built for publication: The MaxIS-Shapley value in perfect graphs
