Failure and Rescue in an Interbank Network
|
|
- Paulina O’Connor’
- 6 years ago
- Views:
Transcription
1 Failure and Rescue in an Interbank Network Luitgard A. M. Veraart London School of Economics and Political Science October 202 Joint work with L.C.G Rogers (University of Cambridge) Paris 202 Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October 202 / 30
2 Questions How can default and contagion be modelled in financial networks? Under which circumstances do banks have incentives to bail-out defaulting banks? What are resolution mechanisms of financial distress? Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
3 An Interbank Network bank bank bank bank bank bank Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
4 The Setting Market with n banks with indices in N := {,..., n}; nodes in a network. The liabilities matrix is L R n n, where the ij th entry L ij represents the nominal liability of bank i to bank j. Assumption: L ij 0 i, j and L ii = 0 i. The total nominal obligations of bank i to all other banks in the system are given by L i = n j= L ij. The relative liabilities matrix Π R n n is defined by { Lij / L π ij := i if L i > 0, 0 otherwise. We denote by e i 0 the net assets of bank i from sources outside the banking system. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
5 Default in a Financial Network Consider network with liabilities matrix L and net external assets e. Check for each bank i N whether n π ji L j + e i j= } {{ } in flow L i }{{} out flow 0. If this is < 0 for some banks, some banks are bankrupt. Assumptions in case of default: Default costs: Fraction of net external assets realized on liquidation: α (0, ], Fraction of interbank assets realized on liquidation: β (0, ]. Clearing: Clearing mechanism determines the payments between banks. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
6 The Clearing Mechanism Limited liabilities: Nodes never pay more than available cash flow. Priority of debt claims over equity: Paying off the liabilities L ij has priority, even if net assets e i have to be used. Proportionality: If default occurs the defaulting bank pays all claimant banks in proportion to the size of their nominal claims on the assets of the defaulting bank. A clearing vector for the financial system (L, e, α, β) is a vector L [0, L] such that L = Φ(L ), { Φ(L) i := L i, if L i e i + n j= L jπ ji, αe i + β n j= L jπ ji, else. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
7 Clearing Vectors - Existence Theorem (Existence of Clearing Vectors) Let α, β (0, ]. For every financial system (L, e, α, β) there exist clearing vectors L and L such that for any clearing vector L, we have L L L. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
8 Greatest Clearing Vector Algorithm (GA) constructs sequence ( Λ (ν)) : Set ν = 0, Λ (0) := L and I :=. 2 For all nodes i compute v (ν) i := n j= Λ(ν) j π ji + e i L i. 3 Insolvent banks: I ν ={i : v (ν) i < 0}, solvent banks: S ν = {i : v (ν) i 0}. 4 If I ν I ν terminate the algorithm. Otherwise set Λ (ν+) j := L j j S ν, solve { } x i = αe i + β L j π ji + x j π ji j S ν j I ν and set Λ (ν+) i := x i for i I ν. i I ν 5 Set ν ν + and go back to 2. When the algorithm has terminated, the vector Λ (ν) is a clearing vector. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
9 Example I Bank 3 Bank Bank 2 l 3 = 2 l 2 = 2 e = /2 3/2, L = ; L = 2 0 2, Π = Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
10 Example II γ 3 2 γ γ 2 Bank 3 Bank Bank 2 π 3 L3 = 2 π 2 L = 2 Net assets are reduced to γe, γ [0, ]. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
11 Example III Bank 3 Bank Bank 2 π 3Λ (0) 3 = 2 π 2Λ (0) = 2 Example: γ = 6. Define new net assets e := ( 6, 2, 4 ). ν = 0, Λ (0) = L, v (0) = ( , 2 + 2, 4 2 ). I 0 = {3}, S 0 = {, 2}. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October 202 / 30
12 Example IV Bank 3 Bank Bank 2 π 3Λ (0) 3 = 2 π 2Λ (0) = 2 I 0 = {3}, S 0 = {, 2}. Λ () = L = 2, Λ() 2 = L 2 = 0, Λ () { 3 = x 3 where x 3 = αe 3 + β L j S0 j π j3 + } j I 0 x j π j3 = α 4 + β{ } = α 4. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
13 Example V Bank 3 Bank Bank 2 π 3Λ () 3 = 8 π 2Λ () = 2 ν :=. α = 2. v () = ( , 2 + 2, 4 2 ), I = {, 3}, S = {2}. Λ (2) = x, Λ { (2) 2 = L 2 = 0, Λ () 3 = x 3, where x = αe +β L j S0 j π j + } j I 0 x j π j = 2 +β{0+x 3+x 0} = 2 + βx 3. { x 3 = αe 3 +β L j S0 j π j3 + } j I 0 x j π j3 = 8 +β{ 2 0+x 0+x 3 0} = 8. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
14 Example VI Bank 3 Bank Bank 2 π 3Λ (2) 3 = 8 π 2Λ (2) = 2 + β 8 ν := 2. v (2) = ( , I 2 = {, 3} = I. STOP! β 8, 4 2 ), L = Λ (2) = ( 2 + β 8, 0, 8 ). Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
15 Consequences The greatest clearing vector algorithm (GA) produces a sequence of vectors ( Λ (ν)) decreasing in at most n iterations to the greatest clearing payment vector. We call the set I ν the level-ν insolvency set. The level-0 insolvency set is the set of those banks which would default even if all other banks paid their obligations in full. The level-ν insolvency set is the set of all those banks which would not be able to meet their obligations if all the level-(ν ) insolvent banks were to default. The insolvency sets I ν trace the spread of default through the financial system. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
16 Bank Merger Given a financial system (L, e, α, β) with banks of indices N. After a merger of all banks in B N one obtains a new financial system ( L, ẽ, α, β) indexed by Ñ := {0} (N \ B). We assume that a merger is associated with costs. We model costs from merger in terms of a vector κ R n +. If bank i is involved in a merger, costs of size κ i occur. New liabilities matrix L: The liabilities of the merging banks to the other (non merging) banks in the network are added up. The liabilities to those banks which merge are cancelled. New net assets ẽ: The net assets of the merged bank are the sum of the net assets of the banks that merged minus the costs for merger, i B κ i. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
17 Example of Merger - Initial Network e e 2 l 2 bank bank 2 l 2 l 3 l 4 l 24 l 32 bank 4 l 43 bank 3 e 4 e 3 Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
18 Example of Merger - Change Liabilities and Net Assets e e 2 l 2 bank + 4 bank 2 l 2 l 24 l 3 l 43 l 32 bank 3 e 4 e 3 Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
19 Example of Merger - New Network ẽ 0 = e + e 4 ẽ 2 = e 2 bank 0 l0 = l 2 l20 = l 2 + l 24 bank 2 l03 = l 3 + l 43 l32 = l 32 bank 3 ẽ 3 = e 3 Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
20 Rescue Consortium Let (L, ẽ, α, β) be a financial system where the level-0 insolvency set I 0 is non-empty and let L be the greatest clearing vector. The value V of the banks is defined as V(L, ẽ) i := (Π L + ẽ L ) i I {L i L i }. The bailout costs are j I 0 δ j, with δ := max { 0, ( Π L + ẽ L )}. Let Ṽ := max{0, Π L + ẽ L}, V := Ṽ V(L, ẽ). A rescue consortium is a set A N \ I 0 such that: i A V i > j I 0 δ j + k A I 0 κ k (rescue incentive), 2 i A Ṽi > j I 0 δ j + k A I 0 κ k (rescue ability). Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
21 Rescue Incentive and Rescue Ability Theorem Every rescue consortium which has an incentive to rescue the failing banks also has the ability to rescue the failing banks. 2 Suppose that the set of banks at risk of contagious default R := ν I ν \I 0 is non-empty, and suppose, further that some subset A R is able to rescue the failing banks. Then A also has an incentive to rescue the failing banks. Definition (Rescued Financial System) Let (L, ẽ, α, β) be a financial system in which the level-0 insolvency set I 0 is non-empty, and suppose that a rescue consortium defined by a set of indices A exists. Then the rescued financial system is the financial system obtained by a merger of all banks in I 0 A. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
22 Absence of Rescue Consortium Theorem Consider a financial system (L, e, α, β) in which all banks are initially solvent. Suppose the assets e are reduced to ẽ, with ẽ i e i i with the result that at least one bank becomes level-0 insolvent. Suppose that α = β =. Then no group of banks in the network has an incentive to rescue the insolvent bank(s). Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
23 Presence of Rescue Consortium Theorem Let (L, ẽ, α, β) be a financial system with α, β [0, ). Suppose that I 0 is a proper subset of N : I 0 N. Let L be the corresponding greatest clearing vector and let κ be the vector describing the costs for merger. Suppose n n n ( α)ẽ i + ( β) L j π ji I {L i < L i } > κ k. i= j= Then there exists a rescue consortium. k= Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
24 Assessing and Controlling Contagion Risk Consider financial system (L, e, α, β) with I 0 =. Reduce net assets to γe, γ [0, ] and consider the relative losses due to default: γ λ(γ) := n i= e v(γ) n i= e The function λ measures the difference between the initial value of the system and the value of the stressed system divided by the initial value of the system. the proportion of defaulting banks: γ η(γ) := {i N L i (γ) < L i }, N where L (γ) is the greatest clearing vector if the external assets are given by ẽ = γe. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
25 An Interbank Network bank bank bank bank bank bank Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
26 Assessing and Controlling Contagion Risk III Plot of λ and η for the asymmetric network with 6 banks, β = 0.9 (first example, slide 3) λ(γ, α) η(γ, α) γ α γ α Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
27 Possible Resolution Mechanisms for Bank Rescues I Suppose that the banks in I are capable of mounting a rescue. The regulator should be empowered to compel that group of banks to rescue the banks in I 0. Main ideas for different mechanisms: Each bank in I contributes to bailout costs in proportion to losses V that they would experience if default were to occur, receives shares in rescued banks in proportion to their contribution. 2 Each bank i in I gives a sealed bid to the regulator containing the fraction α i of the bailout costs which it was willing to take: If i I α i, banks in I are allocated fractions of the defaulting banks assets and liabilities proportional to their bids α i. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
28 Possible Resolution Mechanisms for Bank Rescues II i I α i <, then each bank in I contributes to the bailout proportionally to its potential losses V as in mechanism () above, but receives a fraction of the defaulting banks proportional to its bid. 3 Allow the regulator to seize the assets of any failing bank, which would then pay out nothing to any bank to which it owed money. Assets could be used to compensate depositors, with any not used in this way being held by the government. Gives other banks a very strong incentive to mount a rescue. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
29 Conclusion Modelled contagion in financial networks. Derived conditions for existence of a rescue consortium. Default costs are necessary for the existence of a rescue consortium. Role of regulator and bail-out decisions. Model can be used for stress testing a given network. Could include random shocks etc. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
30 References I Eisenberg, L. & Noe, T. (200). Systemic risk in financial networks. Management Science 47, Rogers, L. C. G. & Veraart, L. A. M. (202+). Failure and rescue in an interbank network. Forthcoming in Management Science. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
31 Default Costs Lemma Consider a financial system (L, e, α, β) in which all banks are initially solvent. Suppose that the assets e are reduced to ẽ, with ẽ i e i i such that some banks have become insolvent: I 0. Let L be the greatest clearing vector in (L, ẽ, α, β). Then 0 = n (V( L, e) i V(L, ẽ) i ) i= n (e i ẽ i ) + n n ( α)ẽ i + ( β) L j π ji I {L i < L i }. i= i= j= Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
32 Presence of Rescue Consortium - Corollary Theorem Let (L, ẽ, α, β) be a financial system with α, β [0, ). Suppose that I 0 is a proper subset of N : I 0 N. Suppose that the costs for merger are κ 0. Let L be the corresponding greatest clearing vector and suppose that there exists a bank k such that L k < L k which satisfies at least one of the following two conditions: ẽ k > 0, 2 there exists j k such that L j π jk > 0. Then there exists a rescue consortium. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
33 Assessing and Controlling Contagion Risk Consider financial system (L, e, α, β) with I 0 =. Reduce net assets to γe, γ [0, ] and consider the relative losses due to default: γ λ(γ) := n i= e v(γ) n i= e The function λ measures the difference between the initial value of the system and the value of the stressed system divided by the initial value of the system. the proportion of defaulting banks: γ η(γ) := {i N L i (γ) < L i }, N where L (γ) is the greatest clearing vector if the external assets are given by ẽ = γe. Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
34 An Interbank Network bank bank bank bank bank bank Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
35 Assessing and Controlling Contagion Risk III Plot of λ and η for the asymmetric network with 6 banks, β = 0.9 (first example, slide 3) λ(γ, α) η(γ, α) γ α γ α Luitgard A. M. Veraart (LSE) Failure and Rescue in an Interbank Network October / 30
Network Uncertainty and Systemic Loss
Network Uncertainty and Systemic Loss Peng-Chu Chen School of Industrial Engineering Purdue University chen621@purdue.edu 1 st Eastern Conference on Mathematical Finance Mar 18, 2016 joint work with Agostino
More informationTo Fully Net or Not to Net: Adverse Effects of Partial Multilateral Netting
Swiss Finance Institute Research Paper Series N 14-63 To Fully Net or Not to Net: Adverse Effects of Partial Multilateral Netting Hamed AMINI Ecole Polytechnique Fédérale de Lausanne Damir FILIPOVIC Ecole
More informationDiscussion of Financial Networks and Contagion Elliott, Golub, and Jackson (2013)
Discussion of Financial Networks and Contagion Elliott, Golub, and Jackson (2013) Alireza Tahbaz-Salehi Columbia Business School Macro Financial Modeling and Macroeconomic Fragility Conference October
More informationWhy are Banks Highly Interconnected?
Why are Banks Highly Interconnected? Alexander David Alfred Lehar University of Calgary Fields Institute - 2013 David and Lehar () Why are Banks Highly Interconnected? Fields Institute - 2013 1 / 35 Positive
More informationFinancial Networks, Cross Holdings, and Limited Liability
Financial Networks, Cross Holdings, and Limited Liability Helmut Elsinger Economic Studies Division, Oesterreichische Nationalbank and Department of Finance, University of Vienna February 23, 27 I discuss
More informationObligations with Physical Delivery in a Multi-Layered Financial
Obligations with Physical Delivery in a Multi-Layered Financial Network arxiv:1702.07936v3 [q-fin.rm] 15 Jun 2018 Zachary Feinstein Washington University in St. Louis June 19, 2018 Abstract This paper
More informationFinancial Networks, Cross Holdings, and Limited Liability
Financial Networks, Cross Holdings, and Limited Liability Helmut Elsinger April 4, 2 I discuss a network of banks which are linked with each other by financial obligations and cross holdings. Given an
More informationThe Effects of Leverage Requirements and Fire Sales on Financial. Contagion via Asset Liquidation Strategies in Financial Networks
The Effects of Leverage Requirements and Fire Sales on Financial Contagion via Asset Liquidation Strategies in Financial Networks Zachary Feinstein a Washington University in St. Louis Fatena El-Masri
More information4: SINGLE-PERIOD MARKET MODELS
4: SINGLE-PERIOD MARKET MODELS Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) Slides 4: Single-Period Market Models 1 / 87 General Single-Period
More informationarxiv: v1 [q-fin.rm] 31 Oct 2017
Network models of financial systemic risk: A review Fabio Caccioli, 1,2,3 Paolo Barucca, 4,5 and Teruyoshi Kobayashi 6 arxiv:1710.11512v1 [q-fin.rm] 31 Oct 2017 1 Department of Computer Science, University
More informationCentrality-based Capital Allocations *
Centrality-based Capital Allocations * Peter Raupach (Bundesbank), joint work with Adrian Alter (IMF), Ben Craig (Fed Cleveland) CIRANO, Montréal, Sep 2017 * Alter, A., B. Craig and P. Raupach (2015),
More informationHandout 4: Deterministic Systems and the Shortest Path Problem
SEEM 3470: Dynamic Optimization and Applications 2013 14 Second Term Handout 4: Deterministic Systems and the Shortest Path Problem Instructor: Shiqian Ma January 27, 2014 Suggested Reading: Bertsekas
More informationOptimization Models in Financial Mathematics
Optimization Models in Financial Mathematics John R. Birge Northwestern University www.iems.northwestern.edu/~jrbirge Illinois Section MAA, April 3, 2004 1 Introduction Trends in financial mathematics
More informationNetwork Valuation in Financial Systems
Network Valuation in Financial Systems Paolo Barucca*, Marco Bardoscia, Fabio Caccioli, Marco D Errico, Gabriele Visentin, Guido Caldarelli, Stefano Battiston *University of Zurich IMT Lucca CoSyDy - July
More informationSolutions of Bimatrix Coalitional Games
Applied Mathematical Sciences, Vol. 8, 2014, no. 169, 8435-8441 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.410880 Solutions of Bimatrix Coalitional Games Xeniya Grigorieva St.Petersburg
More informationFinancial Giffen Goods: Examples and Counterexamples
Financial Giffen Goods: Examples and Counterexamples RolfPoulsen and Kourosh Marjani Rasmussen Abstract In the basic Markowitz and Merton models, a stock s weight in efficient portfolios goes up if its
More informationFinal exam solutions
EE365 Stochastic Control / MS&E251 Stochastic Decision Models Profs. S. Lall, S. Boyd June 5 6 or June 6 7, 2013 Final exam solutions This is a 24 hour take-home final. Please turn it in to one of the
More informationMechanism Design For Set Cover Games When Elements Are Agents
Mechanism Design For Set Cover Games When Elements Are Agents Zheng Sun, Xiang-Yang Li 2, WeiZhao Wang 2, and Xiaowen Chu Hong Kong Baptist University, Hong Kong, China, {sunz,chxw}@comp.hkbu.edu.hk 2
More informationManaging Default Contagion in Financial Networks
Managing Default Contagion in Financial Networks Nils Detering University of California, Santa Barbara with Thilo Meyer-Brandis, Konstantinos Panagiotou, Daniel Ritter (all LMU) CFMAR 10th Anniversary
More informationSecuritization and Financial Stability
Securitization and Financial Stability Hyun Song Shin Princeton University Global Financial Crisis of 2007 2009: Theoretical and Empirical Perspectives Summer Economics at SNU and Korea Economic Association
More informationEssays on Some Combinatorial Optimization Problems with Interval Data
Essays on Some Combinatorial Optimization Problems with Interval Data a thesis submitted to the department of industrial engineering and the institute of engineering and sciences of bilkent university
More informationFinancial Network and Systemic Risk A Dynamic Model
Financial Network and Systemic Risk A Dynamic Model Hong Chen, Tan Wang and David D. Yao July 29, 2016 Abstract We develop a dynamic model of banking network to study the systemic risk of a financial system
More informationTug of War Game: An Exposition
Tug of War Game: An Exposition Nick Sovich and Paul Zimand April 21, 2009 Abstract This paper proves that there is a winning strategy for Player L in the tug of war game. 1 Introduction We describe an
More informationThe lender of last resort: liquidity provision versus the possibility of bail-out
The lender of last resort: liquidity provision versus the possibility of bail-out Rob Nijskens Sylvester C.W. Eijffinger June 24, 2010 The lender of last resort: liquidity versus bail-out 1 /20 Motivation:
More informationMaking Complex Decisions
Ch. 17 p.1/29 Making Complex Decisions Chapter 17 Ch. 17 p.2/29 Outline Sequential decision problems Value iteration algorithm Policy iteration algorithm Ch. 17 p.3/29 A simple environment 3 +1 p=0.8 2
More informationOptimal monitoring and mitigation of systemic risk in lending networks
Purdue University Purdue e-pubs Open Access Dissertations Theses and Dissertations 4-2016 Optimal monitoring and mitigation of systemic risk in lending networks Zhang Li Purdue University Follow this and
More informationA1: American Options in the Binomial Model
Appendix 1 A1: American Options in the Binomial Model So far we were dealing with options which can be excercised only at a fixed time, at their maturity date T. These are european options. In a complete
More informationLecture 6. 1 Polynomial-time algorithms for the global min-cut problem
ORIE 633 Network Flows September 20, 2007 Lecturer: David P. Williamson Lecture 6 Scribe: Animashree Anandkumar 1 Polynomial-time algorithms for the global min-cut problem 1.1 The global min-cut problem
More informationRevenue Management Under the Markov Chain Choice Model
Revenue Management Under the Markov Chain Choice Model Jacob B. Feldman School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853, USA jbf232@cornell.edu Huseyin
More informationAlgorithmic Game Theory
Algorithmic Game Theory Lecture 10 06/15/10 1 A combinatorial auction is defined by a set of goods G, G = m, n bidders with valuation functions v i :2 G R + 0. $5 Got $6! More? Example: A single item for
More informationLecture 4: Model-Free Prediction
Lecture 4: Model-Free Prediction David Silver Outline 1 Introduction 2 Monte-Carlo Learning 3 Temporal-Difference Learning 4 TD(λ) Introduction Model-Free Reinforcement Learning Last lecture: Planning
More informationBSLoss - a comprehensive measure for interconnectedness
BSLoss - a comprehensive measure for interconnectedness K. Fink, U. Krüger, B. Meller, L. Wong (Deutsche Bundesbank) 3 rd EBA Policy Research Workshop 2014 25 November 2014 The paper presents the authors
More informationApplication of an Interval Backward Finite Difference Method for Solving the One-Dimensional Heat Conduction Problem
Application of an Interval Backward Finite Difference Method for Solving the One-Dimensional Heat Conduction Problem Malgorzata A. Jankowska 1, Andrzej Marciniak 2 and Tomasz Hoffmann 2 1 Poznan University
More informationInterbank market liquidity and central bank intervention
Interbank market liquidity and central bank intervention by Allen, Carletti, and Gale - JME 2009 Cecilia Parlatore Siritto March 2010 The Model 3 periods t = 0, 1, 2 1 good Banks (large number): perfectly
More information9.1 Principal Component Analysis for Portfolios
Chapter 9 Alpha Trading By the name of the strategies, an alpha trading strategy is to select and trade portfolios so the alpha is maximized. Two important mathematical objects are factor analysis and
More informationApproximation of Continuous-State Scenario Processes in Multi-Stage Stochastic Optimization and its Applications
Approximation of Continuous-State Scenario Processes in Multi-Stage Stochastic Optimization and its Applications Anna Timonina University of Vienna, Abraham Wald PhD Program in Statistics and Operations
More informationbeing saturated Lemma 0.2 Suppose V = L[E]. Every Woodin cardinal is Woodin with.
On NS ω1 being saturated Ralf Schindler 1 Institut für Mathematische Logik und Grundlagenforschung, Universität Münster Einsteinstr. 62, 48149 Münster, Germany Definition 0.1 Let δ be a cardinal. We say
More informationNetworks of Common Asset Holdings : Aggregation and Measures of Vulnerability
Networks of Common Asset Holdings : Aggregation and Measures of Vulnerability Andreea Minca Cornell University, Operations Research Department Joint work with : Anton Braverman, Cornell University Apr
More informationPortfolio Management and Optimal Execution via Convex Optimization
Portfolio Management and Optimal Execution via Convex Optimization Enzo Busseti Stanford University April 9th, 2018 Problems portfolio management choose trades with optimization minimize risk, maximize
More informationCS360 Homework 14 Solution
CS360 Homework 14 Solution Markov Decision Processes 1) Invent a simple Markov decision process (MDP) with the following properties: a) it has a goal state, b) its immediate action costs are all positive,
More information4 Reinforcement Learning Basic Algorithms
Learning in Complex Systems Spring 2011 Lecture Notes Nahum Shimkin 4 Reinforcement Learning Basic Algorithms 4.1 Introduction RL methods essentially deal with the solution of (optimal) control problems
More informationMarkets with convex transaction costs
1 Markets with convex transaction costs Irina Penner Humboldt University of Berlin Email: penner@math.hu-berlin.de Joint work with Teemu Pennanen Helsinki University of Technology Special Semester on Stochastics
More informationNetworks: Propagation of Shocks over Economic Networks
Networks: Propagation of Shocks over Economic Networks Daron Acemoglu MIT July 22, 2014. Daron Acemoglu (MIT) Networks July 22, 2014. 1 / 59 Introduction Introduction Networks provide a natural framework
More informationInterbank Market Liquidity and Central Bank Intervention
Interbank Market Liquidity and Central Bank Intervention Franklin Allen University of Pennsylvania Douglas Gale New York University June 9, 2008 Elena Carletti Center for Financial Studies University of
More informationOutline. 1 Introduction. 2 Algorithms. 3 Examples. Algorithm 1 General coordinate minimization framework. 1: Choose x 0 R n and set k 0.
Outline Coordinate Minimization Daniel P. Robinson Department of Applied Mathematics and Statistics Johns Hopkins University November 27, 208 Introduction 2 Algorithms Cyclic order with exact minimization
More informationChair of Communications Theory, Prof. Dr.-Ing. E. Jorswieck. Übung 5: Supermodular Games
Chair of Communications Theory, Prof. Dr.-Ing. E. Jorswieck Übung 5: Supermodular Games Introduction Supermodular games are a class of non-cooperative games characterized by strategic complemetariteis
More informationThe Duo-Item Bisection Auction
Comput Econ DOI 10.1007/s10614-013-9380-0 Albin Erlanson Accepted: 2 May 2013 Springer Science+Business Media New York 2013 Abstract This paper proposes an iterative sealed-bid auction for selling multiple
More informationContinuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals
Continuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals Philipp Moritz Lücke (joint work with Philipp Schlicht) Mathematisches Institut, Rheinische Friedrich-Wilhelms-Universität
More informationQ1. [?? pts] Search Traces
CS 188 Spring 2010 Introduction to Artificial Intelligence Midterm Exam Solutions Q1. [?? pts] Search Traces Each of the trees (G1 through G5) was generated by searching the graph (below, left) with a
More informationAssortment Planning under the Multinomial Logit Model with Totally Unimodular Constraint Structures
Assortment Planning under the Multinomial Logit Model with Totally Unimodular Constraint Structures James Davis School of Operations Research and Information Engineering, Cornell University, Ithaca, New
More informationThe Probabilistic Method - Probabilistic Techniques. Lecture 7: Martingales
The Probabilistic Method - Probabilistic Techniques Lecture 7: Martingales Sotiris Nikoletseas Associate Professor Computer Engineering and Informatics Department 2015-2016 Sotiris Nikoletseas, Associate
More informationAn effective perfect-set theorem
An effective perfect-set theorem David Belanger, joint with Keng Meng (Selwyn) Ng CTFM 2016 at Waseda University, Tokyo Institute for Mathematical Sciences National University of Singapore The perfect
More information1 Dynamic programming
1 Dynamic programming A country has just discovered a natural resource which yields an income per period R measured in terms of traded goods. The cost of exploitation is negligible. The government wants
More informationEconomics Honors Exam 2008 Solutions Question 1
Economics Honors Exam 2008 Solutions Question 1 (a) (2 points) The steel firm's profit-maximization problem is max p s s c s (s, x) = p s s αs 2 + βx γx 2 s,x 0.5 points: for realizing that profit is revenue
More informationControl Improvement for Jump-Diffusion Processes with Applications to Finance
Control Improvement for Jump-Diffusion Processes with Applications to Finance Nicole Bäuerle joint work with Ulrich Rieder Toronto, June 2010 Outline Motivation: MDPs Controlled Jump-Diffusion Processes
More informationTHE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET
THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET MICHAEL PINSKER Abstract. We calculate the number of unary clones (submonoids of the full transformation monoid) containing the
More informationExtender based forcings, fresh sets and Aronszajn trees
Extender based forcings, fresh sets and Aronszajn trees Moti Gitik August 31, 2011 Abstract Extender based forcings are studied with respect of adding branches to Aronszajn trees. We construct a model
More informationDynamic Replication of Non-Maturing Assets and Liabilities
Dynamic Replication of Non-Maturing Assets and Liabilities Michael Schürle Institute for Operations Research and Computational Finance, University of St. Gallen, Bodanstr. 6, CH-9000 St. Gallen, Switzerland
More informationDistributed Function Calculation via Linear Iterations in the Presence of Malicious Agents Part I: Attacking the Network
8 American Control Conference Westin Seattle Hotel, Seattle, Washington, USA June 11-13, 8 WeC34 Distributed Function Calculation via Linear Iterations in the Presence of Malicious Agents Part I: Attacking
More informationStochastic Games and Bayesian Games
Stochastic Games and Bayesian Games CPSC 532L Lecture 10 Stochastic Games and Bayesian Games CPSC 532L Lecture 10, Slide 1 Lecture Overview 1 Recap 2 Stochastic Games 3 Bayesian Games Stochastic Games
More informationHW Consider the following game:
HW 1 1. Consider the following game: 2. HW 2 Suppose a parent and child play the following game, first analyzed by Becker (1974). First child takes the action, A 0, that produces income for the child,
More informationGeneralising the weak compactness of ω
Generalising the weak compactness of ω Andrew Brooke-Taylor Generalised Baire Spaces Masterclass Royal Netherlands Academy of Arts and Sciences 22 August 2018 Andrew Brooke-Taylor Generalising the weak
More information1 Auctions. 1.1 Notation (Symmetric IPV) Independent private values setting with symmetric riskneutral buyers, no budget constraints.
1 Auctions 1.1 Notation (Symmetric IPV) Ancient market mechanisms. use. A lot of varieties. Widespread in Independent private values setting with symmetric riskneutral buyers, no budget constraints. Simple
More information4 Martingales in Discrete-Time
4 Martingales in Discrete-Time Suppose that (Ω, F, P is a probability space. Definition 4.1. A sequence F = {F n, n = 0, 1,...} is called a filtration if each F n is a sub-σ-algebra of F, and F n F n+1
More informationA relative of the approachability ideal, diamond and non-saturation
A relative of the approachability ideal, diamond and non-saturation Boise Extravaganza in Set Theory XVIII March 09, Boise, Idaho Assaf Rinot Tel-Aviv University http://www.tau.ac.il/ rinot 1 Diamond on
More informationChapter 5 Finite Difference Methods. Math6911 W07, HM Zhu
Chapter 5 Finite Difference Methods Math69 W07, HM Zhu References. Chapters 5 and 9, Brandimarte. Section 7.8, Hull 3. Chapter 7, Numerical analysis, Burden and Faires Outline Finite difference (FD) approximation
More informationMengdi Wang. July 3rd, Laboratory for Information and Decision Systems, M.I.T.
Practice July 3rd, 2012 Laboratory for Information and Decision Systems, M.I.T. 1 2 Infinite-Horizon DP Minimize over policies the objective cost function J π (x 0 ) = lim N E w k,k=0,1,... DP π = {µ 0,µ
More informationMicroeconomics Comprehensive Exam
Microeconomics Comprehensive Exam June 2009 Instructions: (1) Please answer each of the four questions on separate pieces of paper. (2) When finished, please arrange your answers alphabetically (in the
More informationIdentification and Estimation of Dynamic Games when Players Belief Are Not in Equilibrium
Identification and Estimation of Dynamic Games when Players Belief Are Not in Equilibrium A Short Review of Aguirregabiria and Magesan (2010) January 25, 2012 1 / 18 Dynamics of the game Two players, {i,
More informationProblem 1: Random variables, common distributions and the monopoly price
Problem 1: Random variables, common distributions and the monopoly price In this problem, we will revise some basic concepts in probability, and use these to better understand the monopoly price (alternatively
More informationA No-Arbitrage Theorem for Uncertain Stock Model
Fuzzy Optim Decis Making manuscript No (will be inserted by the editor) A No-Arbitrage Theorem for Uncertain Stock Model Kai Yao Received: date / Accepted: date Abstract Stock model is used to describe
More informationEstimating Market Power in Differentiated Product Markets
Estimating Market Power in Differentiated Product Markets Metin Cakir Purdue University December 6, 2010 Metin Cakir (Purdue) Market Equilibrium Models December 6, 2010 1 / 28 Outline Outline Estimating
More informationOn the Optimality of Financial Repression
On the Optimality of Financial Repression V.V. Chari, Alessandro Dovis and Patrick Kehoe Conference in honor of Robert E. Lucas Jr, October 2016 Financial Repression Regulation forcing financial institutions
More informationMathematics in Finance
Mathematics in Finance Steven E. Shreve Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213 USA shreve@andrew.cmu.edu A Talk in the Series Probability in Science and Industry
More informationarxiv:math/ v1 [math.lo] 15 Jan 1991
ON A CONJECTURE OF TARSKI ON PRODUCTS OF CARDINALS arxiv:math/9201247v1 [mathlo] 15 Jan 1991 Thomas Jech 1 and Saharon Shelah 2 Abstract 3 We look at an old conjecture of A Tarski on cardinal arithmetic
More informationMathematics of Finance Final Preparation December 19. To be thoroughly prepared for the final exam, you should
Mathematics of Finance Final Preparation December 19 To be thoroughly prepared for the final exam, you should 1. know how to do the homework problems. 2. be able to provide (correct and complete!) definitions
More informationCollective Moral Hazard, Maturity Mismatch, and Systemic Bailouts
Collective Moral Hazard, Maturity Mismatch, Systemic Bailouts Emmanuel Farhi Jean Tirole Web Appendix ProofofProposition5 Ex-post (date-1) welfare W (; )isgivenby Z β ( ) W (; 1 A ( n (β,a)) )= L()+ π
More informationPart 3: Trust-region methods for unconstrained optimization. Nick Gould (RAL)
Part 3: Trust-region methods for unconstrained optimization Nick Gould (RAL) minimize x IR n f(x) MSc course on nonlinear optimization UNCONSTRAINED MINIMIZATION minimize x IR n f(x) where the objective
More informationDefault Risk and Aggregate Fluctuations in an Economy with Production Heterogeneity
Default Risk and Aggregate Fluctuations in an Economy with Production Heterogeneity Aubhik Khan The Ohio State University Tatsuro Senga The Ohio State University and Bank of Japan Julia K. Thomas The Ohio
More informationContagion Flow Through Banking Networks arxiv:cond-mat/ v1 [cond-mat.other] 5 Mar 2004
Contagion Flow Through Banking Networks arxiv:cond-mat/0403167v1 [cond-mat.other] 5 Mar 2004 Michael Boss 1, Martin Summer 1, Stefan Thurner 2 1 Oesterreichische Nationalbank, Otto-Wagner-Platz 3, A-1011
More informationAlgorithmic Trading with Prior Information
Washington University in St. Louis Washington University Open Scholarship Arts & Sciences Electronic Theses and Dissertations Arts & Sciences Spring 5-18-2018 Algorithmic Trading with Prior Information
More informationThe tree property for supercompactness
(Joint work with Matteo Viale) June 6, 2010 Recall that κ is weakly compact κ is inaccessible + κ-tp holds, where κ-tp is the tree property on κ. Due to Mitchell and Silver we have V = κ is weakly compact
More informationDecision Theory: Value Iteration
Decision Theory: Value Iteration CPSC 322 Decision Theory 4 Textbook 9.5 Decision Theory: Value Iteration CPSC 322 Decision Theory 4, Slide 1 Lecture Overview 1 Recap 2 Policies 3 Value Iteration Decision
More informationAlgorithmic and High-Frequency Trading
LOBSTER June 2 nd 2016 Algorithmic and High-Frequency Trading Julia Schmidt Overview Introduction Market Making Grossman-Miller Market Making Model Trading Costs Measuring Liquidity Market Making using
More informationLecture 7: Bayesian approach to MAB - Gittins index
Advanced Topics in Machine Learning and Algorithmic Game Theory Lecture 7: Bayesian approach to MAB - Gittins index Lecturer: Yishay Mansour Scribe: Mariano Schain 7.1 Introduction In the Bayesian approach
More informationADDING A LOT OF COHEN REALS BY ADDING A FEW II. 1. Introduction
ADDING A LOT OF COHEN REALS BY ADDING A FEW II MOTI GITIK AND MOHAMMAD GOLSHANI Abstract. We study pairs (V, V 1 ), V V 1, of models of ZF C such that adding κ many Cohen reals over V 1 adds λ many Cohen
More informationLong Term Values in MDPs Second Workshop on Open Games
A (Co)Algebraic Perspective on Long Term Values in MDPs Second Workshop on Open Games Helle Hvid Hansen Delft University of Technology Helle Hvid Hansen (TU Delft) 2nd WS Open Games Oxford 4-6 July 2018
More informationSlides III - Complete Markets
Slides III - Complete Markets Julio Garín University of Georgia Macroeconomic Theory II (Ph.D.) Spring 2017 Macroeconomic Theory II Slides III - Complete Markets Spring 2017 1 / 33 Outline 1. Risk, Uncertainty,
More informationFeb. 4 Math 2335 sec 001 Spring 2014
Feb. 4 Math 2335 sec 001 Spring 2014 Propagated Error in Function Evaluation Let f (x) be some differentiable function. Suppose x A is an approximation to x T, and we wish to determine the function value
More informationIMPA Commodities Course : Forward Price Models
IMPA Commodities Course : Forward Price Models Sebastian Jaimungal sebastian.jaimungal@utoronto.ca Department of Statistics and Mathematical Finance Program, University of Toronto, Toronto, Canada http://www.utstat.utoronto.ca/sjaimung
More informationSystemic risk in financial networks: Quantification and control
Systemic risk in financial networks: Quantification and control Stefan Thurner www.complex-systems.meduniwien.ac.at www.santafe.edu wien, apr 20, 2013 with Sebastian Poledna, Doyne Farmer, Peter Klimek,
More informationEfficiency and Herd Behavior in a Signalling Market. Jeffrey Gao
Efficiency and Herd Behavior in a Signalling Market Jeffrey Gao ABSTRACT This paper extends a model of herd behavior developed by Bikhchandani and Sharma (000) to establish conditions for varying levels
More informationFinancial Linkages, Portfolio Choice and Systemic Risk
Financial Linkages, Portfolio Choice and Systemic Risk Andrea Galeotti Sanjeev Goyal Christian Ghiglino LSE 2016 Motivation Financial linkages reflect cross-ownership and borrowing between banks and corporations.
More informationModeling Over-The-Counter Derivative Trading with and without Central Clearing Parties
Modeling Over-The-Counter Derivative Trading with and without Central Clearing Parties Natalie Wellen May 1, 2017 Abstract Over-the-counter (OTC) derivatives are believed to have played a significant role
More informationInformation Aggregation in Dynamic Markets with Strategic Traders. Michael Ostrovsky
Information Aggregation in Dynamic Markets with Strategic Traders Michael Ostrovsky Setup n risk-neutral players, i = 1,..., n Finite set of states of the world Ω Random variable ( security ) X : Ω R Each
More informationarxiv: v5 [quant-ph] 16 Oct 2008
Violation of Equalities in Bipartite Qutrits Systems Hossein Movahhedian Department of Physics, Shahrood University of Technology, Seventh Tir Square, Shahrood, Iran We have recently shown that for the
More informationDynamic Portfolio Execution Detailed Proofs
Dynamic Portfolio Execution Detailed Proofs Gerry Tsoukalas, Jiang Wang, Kay Giesecke March 16, 2014 1 Proofs Lemma 1 (Temporary Price Impact) A buy order of size x being executed against i s ask-side
More informationDiscussion of Systemic Risk and Stability in Financial Networks by Acemoglu, Ozdaglar, & Tahbaz-Salehi
Discussion of Systemic Risk and Stability in Financial Networks by Acemoglu, Ozdaglar, & Tahbaz-Salehi Jennifer La O Columbia University October 11, 2013 This Paper Provides a framework to think about
More informationMore On λ κ closed sets in generalized topological spaces
Journal of Algorithms and Computation journal homepage: http://jac.ut.ac.ir More On λ κ closed sets in generalized topological spaces R. Jamunarani, 1, P. Jeyanthi 2 and M. Velrajan 3 1,2 Research Center,
More informationAdverse Selection in the Loan Market
1/45 Adverse Selection in the Loan Market Gregory Crawford 1 Nicola Pavanini 2 Fabiano Schivardi 3 1 University of Warwick, CEPR and CAGE 2 University of Warwick 3 University of Cagliari, EIEF and CEPR
More information