CriticalSet Problem: Identifying Key Contributors in Bipartite Networks

The CriticalSet problem has been formally defined by researchers, focusing on determining the k contributors whose removal leads to the greatest isolation of items within a bipartite dependency network. This network comprises two types of nodes, with edges indicating dependencies between the groups. The problem is established as NP-hard and requires the maximization of a supermodular set function, rendering conventional greedy algorithms ineffective. To tackle this challenge, the researchers conceptualize CriticalSet as a coalitional game and introduce a closed-form centrality measure known as ShapleyCov, derived from the Shapley value. ShapleyCov reflects the anticipated number of items that would be isolated following a contributor's exit. This research is available on arXiv with the identifier 2604.21537.