Capacitated Network Bargaining Games: Stability and Structure

References

• [1] Ahmadian S, Hosseinzadeh H, Sanità L (2018) Stabilizing network bargaining games by blocking players. Math. Programming 172:249–275.Crossref, Google Scholar
• [2] Appa G, Kotnyek B (2006) A bidirected generalization of network matrices. Networks 47(4):185–198.Crossref, Google Scholar
• [3] Bateni M, Hajiaghayi M, Immorlica N, Mahini H (2010) The cooperative game theory foundations of network bargaining games. Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. Automata, Languages and Programming (Springer, Berlin, Heidelberg), 67–78.Crossref, Google Scholar
• [4] Biró P, Kern W, Paulusma D (2010) On solution concepts for matching games. Kratochvíl J, Li A, Fiala J, Kolman P, eds. Theory and Applications of Models of Computation (Springer, Berlin, Heidelberg), 117–127.Crossref, Google Scholar
• [5] Bock A, Chandrasekaran K, Könemann J, Peis B, Sanità L (2015) Finding small stabilizers for unstable graphs. Math. Programming 154:173–196.Crossref, Google Scholar
• [6] Chandrasekaran K (2017) Graph Stabilization: A Survey (Springer, Singapore), 21–41.Google Scholar
• [7] Chandrasekaran K, Gottschalk C, Könemann J, Peis B, Schmand D, Wierz A (2019) Additive stabilizers for unstable graphs. Discrete Optim. 31:56–78.Crossref, Google Scholar
• [8] De Loera JA, Kafer S, Sanità L (2022) Pivot rules for circuit-augmentation algorithms in linear optimization. SIAM J. Optim. 32(3):2156–2179.Crossref, Google Scholar
• [9] Finhold E (2014) Circuit diameters and their application to transportation problems. Unpublished PhD thesis, Technische Universität München, Germany.Google Scholar
• [10] Gerstbrein M, Sanità L, Verberk L (2025) Stabilization of capacitated matching games. Math. Programming 210:313–334. Crossref, Google Scholar
• [11] Gottschalk C (2018) Personal communication, Manuscript, Hardess of approximation (no O(1) possible) for edge-stabilizers in unit-weight unit-capacities graphs.Google Scholar
• [12] Ito T, Kakimura N, Kamiyama N, Kobayashi Y, Okamoto Y (2017) Efficient stabilization of cooperative matching games. Theoret. Comput. Sci. 677:69–82.Crossref, Google Scholar
• [13] Kafer S (2022) Polyhedral diameters and applications to optimization. Unpublished PhD thesis, University of Waterloo, Ontario, Canada.Google Scholar
• [14] Kleinberg J, Tardos É (2008) Balanced outcomes in social exchange networks. Proc. Fortieth Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 295–304.Google Scholar
• [15] Koh ZK, Sanità L (2020) Stabilizing weighted graphs. Math. Oper. Res. 45(4):1318–1341.Link, Google Scholar
• [16] Könemann J, Larson K, Steiner D (2012) Network bargaining: Using approximate blocking sets to stabilize unstable instances. Serna M, ed. Algorithmic Game Theory (Springer, Berlin Heidelberg), 216–226.Crossref, Google Scholar
• [17] Nash JF (1950) The bargaining problem. Econometrica 18(2):155–162.Crossref, Google Scholar
• [18] Sanità L (2018) The diameter of the fractional matching polytope and its hardness implications. IEEE 59th Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 910–921.Google Scholar
• [19] Schrijver A (2003) Combinatorial Optimization (Springer-Verlag, Berlin Heidelberg, New York).Google Scholar