Advertisement

Finding Small Stabilizers for Unstable Graphs

  • Adrian Bock
  • Karthekeyan Chandrasekaran
  • Jochen Könemann
  • Britta Peis
  • Laura Sanità
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8494)

Abstract

An undirected graph G = (V,E) is stable if its inessential vertices (those that are exposed by at least one maximum matching) form a stable set. We call a set of edges F ⊆ E a stabilizer if its removal from G yields a stable graph. In this paper we study the following natural edge-deletion question: given a graph G = (V,E), can we find a minimum-cardinality stabilizer?

Stable graphs play an important role in cooperative game theory. In the classic matching game introduced by Shapley and Shubik [19] we are given an undirected graph G = (V,E) where vertices represent players, and we define the value of each subset S ⊆ V as the cardinality of a maximum matching in the subgraph induced by S. The core of such a game contains all fair allocations of the value of V among the players, and is well-known to be non-empty iff graph G is stable. The stabilizer problem addresses the question of how to modify the graph to ensure that the core is non-empty.

We show that this problem is vertex-cover hard. We then prove that there is a minimum-cardinality stabilizer that avoids some maximum matching of G. We use this insight to give efficient approximation algorithms for sparse graphs and for regular graphs.

Keywords

Undirected Graph Regular Graph Vertex Cover Grand Coalition Maximum Match 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: O(\(\sqrt{ \log n}\)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 573–581 (2005)Google Scholar
  2. 2.
    Alon, N., Shapira, A., Sudakov, B.: Additive approximation for edge-deletion problems. Annals of Mathematics 170, 371–411 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Balas, E.: Integer and fractional matchings. Annals of Discrete Mathematics 11, 1–13 (1981)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Balinski, M.L.: On maximum matching, minimum covering and their connections. In: Proceedings of the Princeton Symposium on Mathematical Programming (1970)Google Scholar
  5. 5.
    Bateni, M., Hajiaghayi, M., Immorlica, N., Mahini, H.: The cooperative game theory foundations of network bargaining games. In: Proc., International Colloquium on Automata, Languages and Processing, pp. 67–78 (2010)Google Scholar
  6. 6.
    Biró, P., Bomhoff, M., Golovach, P.A., Kern, W., Paulusma, D.: Solutions for the stable roommates problem with payments. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 69–80. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  7. 7.
    Bock, A., Chandrasekaran, K., Könemann, J., Peis, B., Sanità, L.: Finding small stabilizers for unstable graphs, Full version in preparation (2014)Google Scholar
  8. 8.
    Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational aspects of cooperative game theory. In: Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers (2011)Google Scholar
  9. 9.
    Hochbaum, D.: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing 11(3), 555–556 (1982)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Khot, S.: On the power of unique 2-Prover 1-Round games. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 767–775 (2002)Google Scholar
  11. 11.
    Kleinberg, J.M., Tardos, É.: Balanced outcomes in social exchange networks. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 295–304 (2008)Google Scholar
  12. 12.
    Könemann, J., Larson, K., Steiner, D.: Network bargaining: Using approximate blocking sets to stabilize unstable instances. In: Proceedings of the Symposium on Algorithmic Game Theory, pp. 216–226 (2012)Google Scholar
  13. 13.
    Korach, E.: Flowers and Trees in a Ballet of K 4, or a Finite Basis Characterization of Non-König-Egerváry Graphs, Tech. Report 115, IBM Israel Scientific Center (1982)Google Scholar
  14. 14.
    Korach, E., Nguyen, T., Peis, B.: Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 842–850 (2006)Google Scholar
  15. 15.
    Mishra, S., Raman, V., Saurabh, S., Sikdar, S., Subramanian, C.R.: The complexity of König subgraph problems and above-guarantee vertex cover. Algorithmica 61(4), 857–881 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Nash, J.: The bargaining problem. Econometrica 18, 155–162 (1950)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 17.
    Pulleyblank, W.R.: Fractional matchings and the edmonds-gallai theorem. Discrete Appl. Math. 16, 51–58 (1987)CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Schrijver, A.: Combinatorial optimization. Springer, New York (2003)zbMATHGoogle Scholar
  19. 19.
    Shapley, L.S., Shubik, M.: The assignment game: the core. International Journal of Game Theory 1(1), 111–130 (1971)CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Sterboul, F.: A characterization of the graphs in which the transversal number equals the matching number. J. Combin. Theory Ser. B, 228–229 (1979)Google Scholar
  21. 21.
    Uhry, J.P.: Sur le problème du couplage maximal. RAIRO 3, 13–20 (1975)MathSciNetGoogle Scholar
  22. 22.
    Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 253–264 (1978)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Adrian Bock
    • 1
  • Karthekeyan Chandrasekaran
    • 2
  • Jochen Könemann
    • 3
  • Britta Peis
    • 4
  • Laura Sanità
    • 3
  1. 1.EPFLSwitzerland
  2. 2.Harvard UniversityUSA
  3. 3.University of WaterlooCanada
  4. 4.RWTH Aachen UniversityGermany

Personalised recommendations