Edge Manipulations for the Maximum Vertex-Weighted Bipartite \(b\) -matching
Edge Manipulations for the Maximum Vertex-Weighted Bipartite \(b\) -matching
In this paper, we explore the Mechanism Design aspects of the Maximum Vertex-weighted \(b\) -Matching (MVbM) problem on bipartite graphs \((A\cup T,E)\) . The set \(A\) comprises agents, while \(T\) represents tasks. The set \(E\) , which connects \(A\) and \(T\) , is the private information of either agents or …