Flow Allocation Games

References

• [1] Arora S, Barak B, Brunnermeier M, Ge R (2011) Computational complexity and information asymmetry in financial products. Commun. ACM 54(5):101–107.Crossref, Google Scholar
• [2] Bachrach Y, Rosenschein J (2009) Power in threshold network flow games. Auton. Agent. Multi Agent Syst. 18(1):106–132.Crossref, Google Scholar
• [3] Barucca P, Bardoscia M, Caccioli F, D’Errico M, Visentin G, Caldarelli G, Battiston S (2020) Network valuation in financial systems. Math. Finance 30(4):1181–1204.Crossref, Google Scholar
• [4] Bertschinger N, Hoefer M, Schmand D (2020) Strategic payments in financial networks. Thomas V, ed. Proc. 11th Symp. Innov. Theoret. Comput. Sci. (ITCS) (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany), 46:1–46:16.Google Scholar
• [5] Braverman M, Pasricha K (2014) The computational hardness of pricing compound options. Naor M, ed. Proc. 5th Symp. Innov. Theoret. Comput. Sci. (ITCS) (Association for Computing Machinery, New York), 103–104.Google Scholar
• [6] Candogan O, Epitropou M, Vohra R (2021) Competitive equilibrium and trading networks: A network flow approach. Oper. Res. 69(1):114–147.Link, Google Scholar
• [7] Cseh Á, Matuschke J (2019) New and simple algorithms for stable flow problems. Algorithmica 81(6):2557–2591.Crossref, Google Scholar
• [8] Cseh A, Matuschke J, Skutella M (2013) Stable flows over time. Algorithms (Basel) 6(3):532–545.Crossref, Google Scholar
• [9] Csóka P, Herings PJ (2018) Decentralized clearing in financial networks. Management Sci. 64(10):4681–4699.Link, Google Scholar
• [10] Deng X, Ibaraki T, Nagamochi H (1999) Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24(3):751–766.Link, Google Scholar
• [11] Dinitz Y (1970) Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl. 11:1277–1280.Google Scholar
• [12] Dubey P, Shapley L (1984) Totally balanced games arising from controlled programming problems. Math. Program. 29(3):245–267.Crossref, Google Scholar
• [13] Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2):248–264.Crossref, Google Scholar
• [14] Eisenberg L, Noe T (2001) Systemic risk in financial systems. Management Sci. 47(2):236–249.Link, Google Scholar
• [15] Fischer T (2014) No-arbitrage pricing under systemic risk: Accounting for cross-ownership. Math. Finance 24(1):97–124.Crossref, Google Scholar
• [16] Fleiner T (2014) On stable matchings and flows. Algorithms (Basel) 7(1):1–14.Crossref, Google Scholar
• [17] Fleiner T, Jankó Z, Schlotter I, Teytelboym A (2023) Complexity of stability in trading networks. Internat. J. Game Theory 52(3):629–648.Crossref, Google Scholar
• [18] Froese H, Hoefer M, Wilhelmi L (2023) The complexity of debt swapping. Preprint, submitted February 22, https://arxiv.org/abs/2302.11250.Google Scholar
• [19] Gai P, Kapadia S (2010) Contagion in financial networks. Proc. Royal Soc. London A: Math. Phys. Eng. Sci. 466(2120):2401–2423.Crossref, Google Scholar
• [20] Granot D, Granot F (1992) On some network flow games. Math. Oper. Res. 17(4):792–841.Link, Google Scholar
• [21] Guha S, Kupferman O, Vardi G (2019) Multi-player flow games. Auton. Agent. Multi Agent Syst. 33(6):798–820.Crossref, Google Scholar
• [22] Hatfield J, Kominers S, Nichifor A, Ostrovsky M, Westkamp A (2013) Stability and competitive equilibrium in trading networks. J. Political Econom. 121(5):966–1005.Crossref, Google Scholar
• [23] Hemenway B, Khanna S (2016) Sensitivity and computational complexity in financial networks. Algorithmic Finance 5(3–4):95–110.Crossref, Google Scholar
• [24] Hoefer M, Wilhelmi L (2022) Seniorities and minimal clearing in financial network games. Kanellopoulos P, Kyropoulou M, Voudouris AA, eds. Proc. 15th Symp. Algorithmic Game Theory (SAGT) (Springer, Berlin, Heidelberg), 187–204.Google Scholar
• [25] Ioannidis S, de Keijzer B, Ventre C (2022) Strong approximations and irrationality in financial networks with financial derivatives. Bojańczyk M, Merelli E, Woodruff DP, eds. Proc. 49th Int. Colloq. Autom. Lang. Programming (ICALP) (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany), 76:1–76:18.Google Scholar
• [26] Ioannidis S, de Keijzer B, Ventre C (2023) Financial networks with singleton liability priorities. Theoret. Comput. Sci. 963:113965.Crossref, Google Scholar
• [27] Kalai E, Zemel E (1982a) Generalized network problems yielding totally balanced games. Oper. Res. 30(5):998–1008.Link, Google Scholar
• [28] Kalai E, Zemel E (1982b) Totally balanced games and games of flow. Math. Oper. Res. 7(3):476–478.Link, Google Scholar
• [29] Kanellopoulos P, Kyropoulou M, Zhou H (2021) Financial network games. Calinescu A, Szpruch L, eds. Proc. 2nd ACM Int. Conf. AI in Finance (ICAIF) (Association for Computing Machinery, New York), 26:1–26:9.Google Scholar
• [30] Kanellopoulos P, Kyropoulou M, Zhou H (2022) Forgiving debt in financial network games. Raedt LD, ed. Proc. 31st Int. Joint Conf. Artif. Intell. (IJCAI, California), 335–341.Google Scholar
• [31] Karp R (1972) Reducibility among combinatorial problems. Miller R, Thatcher J, eds., Complexity of Computer Computations (Plenum Press, New York).Crossref, Google Scholar
• [32] Király T, Pap J (2013) Stable multicommodity flows. Algorithms (Basel) 6(1):161–168.Crossref, Google Scholar
• [33] Kupferman O, Vardi G, Vardi M (2017) Flow games. Lokam S, Ramanujam R, eds. Proc. 37th Conf. Found. Software Tech. Theor. Comput. Sci. (FSTTCS) (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany), 38:1–38:16.Google Scholar
• [34] Markakis E, Saberi A (2005) On the core of the multicommodity flow game. Decis. Support Syst. 39(1):3–10.Crossref, Google Scholar
• [35] Ostrovsky M (2008) Stability in supply chain networks. Amer. Econom. Rev. 98(3):897–923.Crossref, Google Scholar
• [36] Papadimitriou C (2001) Algorithms, games and the Internet. Vitter JS, Paul G, Spirakis PG, Yannakakis M, eds. Proc. 33rd Symp. Theory Comput. (STOC) (Association for Computing Machinery, New York), 749–753.Google Scholar
• [37] Papp PA, Wattenhofer R (2020) Network-aware strategies in financial systems. Czumaj A, Dawar A, Merelli E, eds. Proc. 47thInt. Colloq. Autom. Lang. Programming (ICALP) (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany), 91:1–91:17.Google Scholar
• [38] Papp PA, Wattenhofer R (2021a) Debt swapping for risk mitigation in financial networks. Biró P, SChawla S, Federico E, eds. Proc. 22nd Conf. Econ. Comput. (EC) (Association for Computing Machinery, New York), 765–784.Google Scholar
• [39] Papp PA, Wattenhofer R (2021b) Default ambiguity: Finding the best solution to the clearing problem. Feldman M, Fu H, Talgam-Cohen I, eds. Proc. 17th Conf. Web and Internet Econ. (WINE) (Springer, Berlin, Heidelberg), 391–409.Google Scholar
• [40] Papp PA, Wattenhofer R (2021c) Sequential defaulting in financial networks. Lee JR, ed. Proc. 12th Symp. Innov. Theoret. Comput. Sci. (ITCS) (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany), 52:1–52:20.Google Scholar
• [41] Rogers LCG, Veraart LAM (2013) Failure and rescue in an interbank network. Management Sci. 59(4):882–898.Link, Google Scholar
• [42] Schuldenzucker S, Seuken S, Battiston S (2017) Finding clearing payments in financial networks with credit default swaps is PPAD-complete. Papadimitriou CH, ed. Proc. 8th Symp. Innov. Theoret. Comput. Sci. (ITCS) (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany), 32:1–32:20.Google Scholar
• [43] Shapley L, Scarf H (1974) On cores and indivisibility. J. Math. Econom. 1(1):23–37.Crossref, Google Scholar
• [44] Suzuki T (2002) Valuing corporate debt: The effect of cross-holdings of stock and debt. J. Oper. Res. Soc. Japan 45(2):123–144.Google Scholar
• [45] Tardos É (1985) A strongly polynomial minimum cost circulation algorithm. Combinatorica 5(3):247–256.Crossref, Google Scholar
• [46] Tarski A (1955) A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5(2):285–309.Crossref, Google Scholar