Stabilizing Weighted Graphs

@article{Koh2017StabilizingWG,
  title={Stabilizing Weighted Graphs},
  author={Zhuan Khye Koh and Laura Sanit{\`a}},
  journal={Math. Oper. Res.},
  year={2017},
  volume={45},
  pages={1318-1341}
}
An edge-weighted graph [Formula: see text] is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in network bargaining games and cooperative matching games, because they characterize instances that admit stable outcomes. We give the first polynomial-time algorithm to find a minimum cardinality subset of vertices whose removal from G yields a stable graph, for any weighted graph G. The algorithm… 

Stabilization of Capacitated Matching Games

An edge-weighted, vertex-capacitated graph G is called stable if the value of a maximum-weight capacity-matching equals the value of a maximum-weight fractional capacity-matching. Stable graphs play

Tractability of Konig Edge Deletion Problems

The Complexity of Matching Games: A Survey

This survey focuses on computational complexity aspects of various game-theoretical solution concepts, such as the core, nucleolus and Shapley value, when the input is restricted to some (generalized) matching game.

References

SHOWING 1-10 OF 32 REFERENCES

Additive Stabilizers for Unstable Graphs

Stabilizing network bargaining games by blocking players

This paper gives a combinatorial polynomial-time algorithm for finding a minimum cardinality set of vertices such that its removal from G yields a stable graph, and develops approximation algorithms for some NP-hard weighted variants, where each vertex has an associated non-negative weight.

Computing solutions for matching games

It is NP-hard to determine an imputation with minimum number of blocking pairs, even for matching games with unit edge weights, whereas the problem of determining an imputations with minimum total blocking value is shown to be polynomial-time solvable for general matching games.

Finding small stabilizers for unstable graphs

It is proved that every minimum-cardinality stabilizer avoids some maximum matching of graph G, which is used to give efficient approximation algorithms for sparse graphs and for regular graphs.

Efficient Stabilization of Cooperative Matching Games

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover

While studying the parameterized complexity of the problem of deleting k vertices to obtain a König-Egerváry graph, a number of interesting structural results on matchings and vertex covers are shown which could be useful in other contexts.

Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances

It is shown that by removing edges in the network that belong to a blocking set the authors can find a stable solution to the problem of finding small blocking sets in sparse graphs in polynomial time.

Graph Stabilization: A Survey

This survey outlines recent developments in graph stabilization and highlights some open problems.

Integer and Fractional Matchings