Εμφανίζονται 1 - 1 Αποτελέσματα από 1 για την αναζήτηση '"дискретное распределение вероятностей"', χρόνος αναζήτησης: 0,40δλ Περιορισμός αποτελεσμάτων
  1. 1
    Academic Journal

    Συνεισφορές: The work was performed with the financial support within the framework of the separate project No. 20231671 of the Ministry of Education of the Republic of Belarus., Работа выполнена при финансовой поддержке в рамках отдельного проекта № 20231671 Министерства образования Республики Беларусь.

    Πηγή: Informatics; Том 21, № 4 (2024); 37-45 ; Информатика; Том 21, № 4 (2024); 37-45 ; 2617-6963 ; 1816-0301

    Περιγραφή αρχείου: application/pdf

    Relation: https://inf.grid.by/jour/article/view/1302/1097; https://inf.grid.by/jour/article/downloadSuppFile/1302/304; Eisenberg, L. Systemic risk in financial systems / L. Eisenberg, T. H. Noe // Management Science. – 2001. – Vol. 47(2). – P. 236–249.; Schaarsberg, G. M. On solving mutual liability problems / G. M. Schaarsberg, H. Reijnierse, P. Borm // Mathematical Methods of Operations Research. – 2018. – Vol. 87(3). – P. 383–409.; Jackson, M. O. Systemic risk in financial networks: A survey / M. O. Jackson, A. Pernoud // Annual Review of Economics. – 2021. – Vol. 13(1). – Р. 171–202.; Csóka, P. Centralized clearing mechanisms in financial networks: A programming approach / P. Csóka, P. J.-J. Herings // Journal of Mechanism and Institution Design. – 2022. – Vol. 7(1). – P. 45–69.; Csóka, P. Uniqueness of clearing payment matrices in financial networks / P. Csóka, P. J.-J. Herings // Mathematics of Operations Research. – 2024. – Vol. 49(1). – P. 232–250.; Elliott, M. Networks and economic fragility / M. Elliott, B. Golub // Annual Review of Economics. – 2022. – Vol. 14(1). – P. 665–696.; Thomson, W. How to Divide When There Isn’t Enough / W. Thomson. – Cambridge : Cambridge University Press, 2019. – 508 p.; Лекции по теории графов / В. А. Емеличев, О. И. Мельников, В. И. Сарванов, Р. И. Тышкевич. – М. : Наука, 1990. – 384 с.; Tarjan, R. E. Depth-first search and linear graph algorithms / R. E. Tarjan // SIAM Journal on Computing. – 1972. – Vol. 1(2). – P. 146–160.; https://inf.grid.by/jour/article/view/1302