Stabilizing network bargaining games by blocking players | Mathematical Programming Skip to main content
Springer Nature Link
Log in

Stabilizing network bargaining games by blocking players

  • Full Length Paper
  • Series B
  • Published:
Mathematical Programming Submit manuscript

Abstract

Cooperative matching games (Shapley and Shubik) and Network bargaining games (Kleinberg and Tardos) are games described by an undirected graph, where the vertices represent players. An important role in such games is played by stable graphs, that are graphs whose set of inessential vertices (those that are exposed by at least one maximum matching) are pairwise non adjacent. In fact, stable graphs characterize instances of such games that admit the existence of stable outcomes. In this paper, we focus on stabilizing instances of the above games by blocking as few players as possible. Formally, given a graph G we want to find a minimum cardinality set of vertices such that its removal from G yields a stable graph. We give a combinatorial polynomial-time algorithm for this problem, and develop approximation algorithms for some NP-hard weighted variants, where each vertex has an associated non-negative weight. Our approximation algorithms are LP-based, and we show that our analysis are almost tight by giving suitable lower bounds on the integrality gap of the used LP relaxations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. These are subsets of edges such that their removal from G yields a stable graph.

References

  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. Proc. STOC 2005, 573–581 (2005)

    MATH  Google Scholar 

  2. Bassalygo, L.A.: Asymptotically optimal switching circuits. Probl. Peredachi Inf. 17(3), 81–88 (1981)

    MathSciNet  MATH  Google Scholar 

  3. Berge, C.: Two theorems in graph theory. Proc. Natl. Acad. Sci. USA 43(9), 842 (1957)

    Article  MathSciNet  Google Scholar 

  4. Biró, P., Bomhoff, M., Golovach, P.A., Kern, W., Paulusma, D.: Solutions for the stable roommates problem with payments. Theor. Comput. Sci. 540, 53–61 (2014)

    Article  MathSciNet  Google Scholar 

  5. Bock, A., Chandrasekaran, K., Könemann, J., Peis, B., Sanità, L.: Finding small stabilizers for unstable graphs. Math. Program. 154(1), 173–196 (2015)

    Article  MathSciNet  Google Scholar 

  6. Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational aspects of cooperative game theory. In: Synthesis Lectures on Artificial Intelligence and Machine Learning, vol 5. Morgan & Claypool, pp. 1–168 (2011)

  7. Cook, W., Cunningham, W., Pulleyblank, W., Schrijver, A.: Combinatorial Optimization. Wiley, New York (1998)

    MATH  Google Scholar 

  8. Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449–467 (1965)

    Article  MathSciNet  Google Scholar 

  9. Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput. 25, 698–707 (1993)

    MathSciNet  MATH  Google Scholar 

  10. Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., Okamoto, Y.: Efficient stabilization of cooperative matching games. Theor. Comput. Sci. (2017). doi:10.1016/j.tcs.2017.03.020

    Article  MathSciNet  Google Scholar 

  11. Kleinberg, J., Tardos, É.: Balanced outcomes in social exchange networks. Proc. STOC 2008, 295–304 (2008)

    MathSciNet  MATH  Google Scholar 

  12. Kohli, R., Krishnamurti, R., Mirchandani, P.: The minimum satisfiability problem. SIAM J. Discrete Math. 7(2), 275–283 (1994)

    Article  MathSciNet  Google Scholar 

  13. Könemann, J., Larson, K., Steiner, D.: Network bargaining: using approximate blocking sets to stabilize unstable instances. Theor. Comput. Sci. 57(3), 655–672 (2015)

    MathSciNet  MATH  Google Scholar 

  14. Korach, E., Nguyen, T., Peis, B.: Subgraph characterization of Red/Blue-Split Graph and König Egerváry graphs. In: Proceedings of SODA, pp. 842–850 (2006)

  15. Mishra, S., Raman, V., Saurabh, S., Sikdar, S., Subramanian, C.: The complexity of König subgraph problems and above-guarantee vertex cover. Algorithmica 61(4), 857–881 (2011)

    Article  MathSciNet  Google Scholar 

  16. Nash, J.: The bargaining problem. Econometrica 18, 155–162 (1950)

    Article  MathSciNet  Google Scholar 

  17. Nisan, N., Roughgarden, T., Tardos, É., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)

    Book  Google Scholar 

  18. Schrijver, A.: Combinatorial Optimization. Springer, New York (2003)

    MATH  Google Scholar 

  19. Shapley, L.S., Shubik, M.: The assignment game: the core. Int. J. Game Theory 1(1), 111–130 (1971)

    Article  MathSciNet  Google Scholar 

  20. Sterboul, F.: A characterization of the graphs in which the transversal number equals the matching number. J. Comb. Theory Ser. B 27, 228–229 (1979)

    Article  MathSciNet  Google Scholar 

  21. Vadhan, S.P.: Pseudorandomness. Now Publishers Inc., Hanover (2012)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada

    Sara Ahmadian & Laura Sanità

  2. Faculty of Mathematical Science, Alzahra University, Tehran, Iran

    Hamideh Hosseinzadeh

Authors
  1. Sara Ahmadian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hamideh Hosseinzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Laura Sanità
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Laura Sanità.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ahmadian, S., Hosseinzadeh, H. & Sanità, L. Stabilizing network bargaining games by blocking players. Math. Program. 172, 249–275 (2018). https://doi.org/10.1007/s10107-017-1177-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-017-1177-9

Mathematics Subject Classification

Search

Navigation