EconPapers    
Economics at your fingertips  
 

Optimal Payments to Connected Depositors in Turbulent Times: A Markov Chain Approach

Dávid Csercsik and Hubert Janos Kiss

Complexity, 2018, vol. 2018, 1-14

Abstract:

We propose a discrete time probabilistic model of depositor behavior which takes into account the information flow among depositors. In each time period each depositors’ current state is determined in a stochastic way, based on their previous state, the state of other connected depositors, and the strategy of the bank. The bank offers payment to impatient depositors (those who want to withdraw their funds) who accept or decline them with certain probability, depending on the offered amount. Our principal aim is to see what are the optimal offers of the bank if it wants to keep the expected chance of a bank run under a certain level and minimize its expected payments, while taking into account the connection structure of the depositors. We show that in the case of the proposed model this question results in a nonlinear optimization problem with nonlinear constraints and that the method is capable of accounting for time-varying resource limits of the bank. Optimal offers increase (a) in the degree of the depositor, (b) in the probability of being hit by a liquidity shock, and (c) in the effect of a neighboring impatient depositor.

Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2018/9434608.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2018/9434608.xml (text/xml)

Related works:
Working Paper: Optimal payments to connected depositors in turbulent times-a Markov chain approach (2016) Downloads
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:9434608

DOI: 10.1155/2018/9434608

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().

 
Page updated 2025-03-22
Handle: RePEc:hin:complx:9434608