Abstract (X (1) i k. The reverse bound holds if in addition, the following symmetry condition holds almost surely

Size: px
Start display at page:

Download "Abstract (X (1) i k. The reverse bound holds if in addition, the following symmetry condition holds almost surely"

Transcription

1 Decouping Inequaities for the Tai Probabiities of Mutivariate U-statistics by Victor H. de a Peña 1 and S. J. Montgomery-Smith 2 Coumbia University and University of Missouri, Coumbia Abstract In this paper we present a decouping inequaity that shows that mutivariate U- statistics can be studied as sums of (conditionay independent random variabes. This resut has important impications in severa areas of probabiity and statistics incuding the study random graphs and mutipe stochastic integration. More precisey, we get the foowing resut: Theorem 1. Let {X j } be a sequence of independent random variabes in a measurabe space (S, S, and et {X (j i }, j = 1,..., k be k independent copies of {X i }. Let f i1... be famiies of functions of k variabes taking (S... S into a Banach space (B,. Then, for a n k 2, t > 0, there exist numerica constants C k depending on k ony so that, P ( C k P (C k 1... n 1... n f i1...,... t f i1...,..., X (k t. The reverse bound hods if in addition, the foowing symmetry condition hods amost surey f i1... (X i1, X i2,..., X ik = f iπ(1 i π(2...i π(k (X iπ(1, X iπ(2,..., X iπ(k, for a permutations π of (1,..., k. 1. Introduction In this paper we provide the mutivariate extension of the tai probabiity decouping inequaity for generaized U-statistics of order two and quadratic forms presented in de a Peña and Montgomery-Smith (1993. This type of inequaity permits the transfer of some resuts for sums of independent random variabes to the case of U-statistics. Our work buids mainy on recent work of Kwapien and Woyczynski (1992 as we as on resuts for U-statistics from Giné and Zinn (1992 and papers deaing with inequaities for mutiinear forms of symmetric and hypercontractive random variabes in de a Peña, Montgomery- Smith and Szuga (1992, and de a Peña (1992. It is to be remarked that the decouping inequaities for mutiinear forms introduced in McConne and Taqqu (1986 provided us with our first exposure to this decouping probem. For a more expanded ist of references on the subject see, for exampe, Kwapien and Woyczynski ( ,2 Supported in part by NSF grants. 2 Supported by the University of Missouri Research Board. AMS 1991 subject cassifications: Primary 60E15. Secondary 60D05. Key words and phrases: U-statistics, Decouping. 1

2 2. Main Resut Theorem 1. Let {X i } be a sequence of independent random variabes in a measurabe space (S, S, and et {X (j i }, j = 1,..., k be k independent copies of {X i }. Let f i1... be famiies of functions of k variabes taking (S... S into a Banach space (B,. Then, for a n k 2, t > 0, there exist numerica constants C k, Ck depending on k ony so that, P ( C k P (C k 1... n 1... n f i1...,... t f i1...,..., X (k t. If in addition, the foowing symmetry condition hods amost surey for a permutations π of (1,..., k, then P ( C k P ( C k f i1... (X i1, X i2,..., X ik = f iπ(1 i π(2...i π(k (X iπ(1, X iπ(2,..., X iπ(k 1... n 1... n f i1...,..., X (k t f i1...,... t. Note: In this paper we use the notation {... } to denote that a of,..., are different. 3. Preiminary Resuts Throughout this paper we wi be using two resuts found in earier work. The first one comes from de a Peña and Montgomery-Smith (1993. For competeness we reproduce the proof here. Lemma 1. Let X, Y be two i.i.d. random variabes. Then (1 P ( X t 3P ( X + Y 2t 3. Proof: Let X, Y, Z be i.i.d. random variabes. Then P ( X t = P ( (X + Y + (X + Z (Y + Z 2t P ( X + Y 2t/3 + P ( X + Z 2t/3 + P ( Y + Z 2t/3 = 3P ( X + Y 2t/3. The second resut comes from Kwapien and Woyczynski (1992 and can aso be found in de a Peña and Montgomery-Smith (

3 Proposition 1. Let Y be any mean zero random variabe with vaues in a Banach space (B,. Then, for a aɛb, (2 P ( a + Y a κ 4, where κ = inf x ɛb (E x (Y 2 E(x (Y. (Here B denotes the famiy of inear functionas on B. 2 Proof: Note first that if ξ is a random variabe for which Eξ = 0, then P (ξ 0 1 (E ξ 2 4 E(ξ 2. From this, we deduce that P (x (Y 0 1 (E X (Y 2 4 E(X (Y The resut then foows, 2 because if x ɛb is such that x = 1 and x (a = a, then { a + Y a } contains {x (a + Y x (a} = {x (Y 0}. Lemma 2. Let x, a i1, a i1,..., a i1... beong to a Banach space (B,. Let {ɛ i } be a sequence of symmetric Bernoui random variabes. Then, P ( x + k r=1 1 i i... i r n a i1...i r ɛ i1...ɛ ir x c 1 k, for a universa constant 1 < c k < depending on k ony. Proof: Suppose that x, a i1, a i1,..., a i1... are in R, then since the ɛ s are hypercontractive, by equation (1.4 of Kwapien and Szuga (1991 and the easy argument of the proof of Lemma 3 in de a Peña and Montgomery-Smith (1993, for some σ > 0, we get (E k r= i r n a...i r ɛ i1...ɛ ir = (E k r=1 1 <...<i r n b...i r ɛ i1...ɛ ir σ k (E k r=1 1 <...< n b...i r ɛ i1...ɛ ir = σ k (E k r= n a...i r ɛ i1...ɛ ir 2 1 2, where b i1...i r = π S r a iπ(1...i π(r, and S r denotes the set of a permutations of {1,..., r}. Next, observe that ξ 4 σ 2 ξ 2 impies that ξ 2 σ 4 ξ 1. Take x ɛb so that x = 1 and x (x = x, then P ( x + k r=1 1 i i... i r n a...i r ɛ i1...ɛ ir x P (x (x + k r=1 1 i i... i r n x (a i1...i r ɛ i1...ɛ ir x (x = P ( k r=1 1 i i... i r n x (a i1...i r ɛ i1...ɛ ir 0 c 1 k Note: Throughout this paper we wi use c k and C k to denote numerica constants that depend on k ony and may change from appication to appication. 4. Proof of the Upper Bound: Our proof of this resut is obtained by appying the argument used in the proof of the upper bound in the bivariate case pus an inductive argument. Let {σ i } be a sequence of independent symmetric Bernoui random variabes, P (σ i = 1 = 1 2 and P (σ i = 1 = 1 2. Consider random variabes (Z (1 i, Z (2 i such that (Z (1 i, Z (2 i = i i if σ i = 1 and (Z (1 i, Z (2 i = (X (2 i i if σ i = 1. Then (1 + σ i and (1 σ i are either 0 or 2 and 3

4 these random variabes can be used to transform the probem from one invoving X s to one invoving Z s. Let us first iustrate the argument in the case that k = f i1 (Z (1, Z (1, Z (2 = {(1 + σ i1 (1 + σ i2 (1 + σ i3 f i1 +(1 + σ i1 (1 + σ i2 (1 σ i3 f i1 +(1 + σ i1 (1 σ i2 (1 + σ i3 f i1 (3 +(1 σ i1 (1 + σ i2 (1 + σ i3 f i1 (X (2 +(1 + σ i1 (1 σ i2 (1 σ i3 f i1 +(1 σ i1 (1 + σ i2 (1 σ i3 f i1 (X (2 +(1 σ i1 (1 σ i2 (1 + σ i3 f i1 (X (2 +(1 σ i1 (1 σ i2 (1 σ i3 f i1 (X (2 }, where the sign + is chosen ifthe superscript of X i agrees with that of Z i, and otherwise. Next, set T n,3 = 1 n {f i1 + f i1 +f i1 + f i1 (X (2 +f i1 + f i1 (X (2 +f i1 (X (2 + f i1 (X (2 }. Letting G 2 = σ i i, i = 1,..., n we get T n,3 = n E(f i1 (Z (1, Z (1, Z (2 G 2. More generay, for any 1 1,..., k 2, one can obtain the expansion 4

5 2 k f i1... (Z ( 1,..., Z ( k (4 = Again, 1 j 1,...,j k 2 The appropriate extension of T n,3 is T n,k = T n,k = 2 k From Lemma 1 we get, 3P (3 3P (3 T n,k + {3P (3 T n,k t +3P (3 P ( 1... n 1... n 1... n (1±σ i1...(1±σ ik f i1...,..., X (j k n 1 j 1,...,j k n 1... n {3P (3 T n,k t (5 + C k P (C k 1 j 1,...,j k 2, not a j s equa f i1...,..., X (j k. E(f i1... (Z ( 1,..., Z ( k G 2. f i1...,... t {f i1...,... + f i1... (X (2,... } 2t = f i1...,... + f i1... (X (2,... T n,k 2t f i1...,..., X (j k t} 1 j 1,...j k 2, not a j s equa 1... n f i1...,..., X (j k t}. (Reca that C k, c k are numerica constants that depend on k ony and may change from appication to appication. Observe aso that using (4 and the fact that the σ s are independent from the X s, Lemma 2 with x = T n,k gives for any fixed 1 1,..., k 2, (6 P (2 k 1... n f i1... (Z ( 1,..., Z ( k T n,k G 2 c 1 k, Integrating over { T n,k t} and using the fact that { i i : i = 1,..., n} has the same joint distribution as {(Z (1 i, Z (2 i : i = 1,..., n} we obtain that (7 P (2 k f i1... (X ( 1,..., X ( k t n 5

6 = P (2 k 1... n f i1... (Z ( 1,..., Z ( k t c 1 k P ( T n,k t It is obvious that the upper bound decouping inequaity hods for the case of U- statistics of order 1. Assume that it hods for U-statistics of orders 2,..., k 1. Putting (5 and (7 together with 1 1,..., k 2, not a s equa we get, P ( 1... n f...,... t {3P (3 T n,k t + C k P (C k 1 j 1,...,j k 2, not a j s equa C k P (C k 1 j 1,...,j k 2, not a j s equa C k P (C k 1... n f n 1... n,..., X (k t, f i1...,..., X (j k t} f i1...,..., X (j k t where again, the ast ine foows by the decouping resut for U-statistics of orders 2,..., k 1 of the inductive hypothesis. Since the statement not a j s equa means that there are ess than k j s equa, the variabes whose j s are equa can be decouped using (conditionay on the other variabes the decouping inequaities for U-statistics of order 2,..., k 1. Next we give the proof of the ower bound. 5. Proof of the Lower Bound In order to show the ower bound we require the foowing resut. Lemma 3. Let 1 k. Then there is a constant C k such that P ( 1... n C 1 k P ( f i1...,... t 1... n 1 j 1,...,j k f i1..., X (j 2,..., X (j k C k t. Proof: Let {δ r }, r = 1,...,, be a sequence of random variabes for which P (δ r = 1 = 1 and P (δ r = 0 = 1 1, and r=1 δ r = 1. Set ɛ r = δ r 1 for r = 1,...,. Then, it is easy to see that there exists σ > 0 depending ony upon such that for any rea number x 0 and any sequence of rea constants {a i } (8 x 0 + r=1 a r ɛ r 4 x 0 + σ 1 a r ɛ r 2. One can aso use the resuts of Section 6.9 of Kwapien and Woyczynski (1992 (Pg. 180, 181 to assert this since the ɛ s satisfy the conditions 1. through 3. stated there. 6 r=1

7 Let {(δ i1,..., δ i, i = 1,..., n} be n independent copies of (δ 1,..., δ. As before, we define (9 ɛ ij = δ ij 1. Since the vectors E i = (ɛ i1,..., ɛ i are independent, by an argument given in Kwapien and Szuga (1991, for i = 1,..., n, for a constants x 0, a ij in R, (10 x 0 + n i=1 r=1 and recentering, we obtain (11 x 0 + a ir ɛ ir 4 x 0 + σ 1 n i=1 r=1 n i=1 r=1 a ir δ ir 4 σ 1 x 0 + a ir ɛ ir 2 σ 1 x 0 + n i=1 r=1 a ir δ ir 2. n i=1 r=1 a ir ɛ ir 2, Next we use the sequence E i, i = 1,..., n in defining the anaogue of the Z s used in our proof of the upper bound. For each i, et Z i = X (j i if δ ij = 1. Then, {Z i, i = 1,..., n} has the same joint distribution as {X (1 i, i = 1,..., n} and f i1... (Z i1,.., Z ik = 1 j 1,j 2,...,j k The fact that Eδ ir j r = 1 for a i r, j r gives, where G = σ( i E(f i1... (Z i1,..., Z ik G = ( 1 k,..., X ( i, i = 1,..., n. Let U n = 1... n f... (Z i1,..., Z ik = 1... n 1 j 1,...,j k δ i1 j 1...δ ik j k f i1...,..., X (j k. 1 j 1,...,j k f i1...,..., X (j k, δ i1 j 1...δ ik j k f i1...,, X (j k. Let D i = (δ i1,..., δ i. Since the D s are independent of the X s, if we et g i1... (D i1,..., D ik = 1 j 1,...,j k δ i1 j 1...δ ik j k f i1...,, X (j k. then, since f i1... (X i1,..., X ik = f i(π(1...i (π(k (X iπ(1,..., X iπ(k, 7

8 we have that, g i1... (D i1,..., D ik = g i(π(1...i (π(k (D iπ(1,..., D iπ(k. Therefore, the two sided decouping inequaity in de a Peña (1992 can be appied and, for every convex increasing function Φ, every G -measurabe function T, and k independent copies D (r i, r = 1,..., k of D i there exists numerica constants A k, B k so that E(Φ(A k T + E(Φ( T + E(Φ(B k T n 1... n 1... n This resut with (11 shows that conditionay on G g i1... (D i1,..., D ik G g i1... (D (1,..., D (k G g i1... (D i1,..., D ik G. (12 U n T n 4 σ k B k U n T n 2, A k where T n = E(U n G = ( 1 k 1... n 1 j 1,...,j k f i1..., X (j 2,..., X (j k. (See aso the proofs of Lemma 2 and Lemma of Kwapien and Woyczynski (1992. Thus we have that, (13 P ( U n T n G c 1 k. This foows from the use of (12 and Proposition 1 with a = T n and Y = U n T n. We aso use the fact that for any random variabe ξ and positive constant c, ξ 4 c ξ 2 impies that ξ 2 c 2 ξ 1 (See aso the proof of Lemma 2 for the approach to transfer the probem from one on Banach space vaued random variabes to one on rea vaued. Integrating (13 over the set { T n t} we get P ( 1... n f...,... t c 1 k P (C k = P ( and Lemma 3 is proved n 1... n 1 j 1,...,j k f i1... (Z i1, Z i2,..., Z ik t 8 f i1..., X (j 2,..., X (j k t,

9 The end of the proof of the ower bound foows by using induction and the iterative procedure introduced to obtain the proof of the ower bound mutivariate decouping inequaity in de a Peña (1992. We give a different expression of the same proof, motivated by ideas from de a Peña, Montgomery-Smith and Szuga (1992. We wi use S k to denote the set of permutations of {1,..., k}. The Mazur-Oricz formua tes us that for any 1 j 1,..., j k k that 1... n 0 δ 1,...,δ k 1 ( 1 k δ 1... δ k δ j1... δ jk is 0 uness j 1,..., j k is a permutation of 1,..., k, in which case it is 1. Hence f i1... (X (π(1,..., X (π(k π S k = 0 δ 1,...,δ k 1 By the symmetry properties on f, f i1... = 1 k! Therefore, Pr( 1... n =,..., X (k ( 1 k δ 1... δ k 1... n 0 δ 1,...,δ k 1 0 δ 1,...,δ k 1 k =1 ( k 1 j 1,...,j k k ( 1 k δ 1... δ k f i1...,..., X (k t Pr( Pr( 1... n 1 j 1,...,j k k 1... n 1 j 1,...,j k δ j1... δ jk f i1...,..., X (j k. 1 j 1,...,j k k δ j1... δ jk f i1...,..., X (j k. δ j1... δ jk f i1...,..., X (j k k!t/2 k f i1...,..., X (j k k!t/2 k, and this combined with Lemma 3 is sufficient to show the resut. 9

10 7. References 1. de a Peña, V. H. (1992. Decouping and Khintchine s inequaities for U-statistics. Ann. Probab. 20 4, de a Peña, V. H., Montgomery-Smith and Szuga, J. (1992. Contraction and decouping inequaities for mutiinear forms and U-statistics. Preprint. 3. de a Peña, V. H. and Montgomery-Smith (1993. Bounds on the tai probabiity of U-statistics and quadratic forms. Preprint. 4. Giné, E. and Zinn, J. (1992. A remark on convergence in distribution of U-statistics. Preprint. 5. Kwapien, S. Szuga, J. (1991. Hypercontraction methods in moment inequaities for series of independent random variabes in normed spaces. Ann. Probab. 19 (1, Kwapien, S. and Woyczynski, W. (1992. Random Series and Stochastic Integras: Singe and Mutipe. Birkhauser. 7. McConne, T. and Taqqu, M. (1986. Decouping inequaities for mutiinear forms in independent symmetric random variabes. Ann. Probab. 14(3,

Variance Reduction Through Multilevel Monte Carlo Path Calculations

Variance Reduction Through Multilevel Monte Carlo Path Calculations Variance Reduction Through Mutieve Monte Caro Path Cacuations Mike Gies gies@comab.ox.ac.uk Oxford University Computing Laboratory Mutieve Monte Caro p. 1/30 Mutigrid A powerfu technique for soving PDE

More information

Martingales. by D. Cox December 2, 2009

Martingales. by D. Cox December 2, 2009 Martingales by D. Cox December 2, 2009 1 Stochastic Processes. Definition 1.1 Let T be an arbitrary index set. A stochastic process indexed by T is a family of random variables (X t : t T) defined on a

More information

The Real Numbers. Here we show one way to explicitly construct the real numbers R. First we need a definition.

The Real Numbers. Here we show one way to explicitly construct the real numbers R. First we need a definition. The Real Numbers Here we show one way to explicitly construct the real numbers R. First we need a definition. Definitions/Notation: A sequence of rational numbers is a funtion f : N Q. Rather than write

More information

f (tl) <tf(l) for all L and t>1. + u 0 [p (l ) α wl ] pα (l ) α 1 w =0 l =

f (tl) <tf(l) for all L and t>1. + u 0 [p (l ) α wl ] pα (l ) α 1 w =0 l = Econ 101A Midterm Th November 006. You have approximatey 1 hour and 0 minutes to answer the questions in the midterm. I wi coect the exams at 11.00 sharp. Show your work, and good uck! Probem 1. Profit

More information

4 Martingales in Discrete-Time

4 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 information

Portfolio Choice. := δi j, the basis is orthonormal. Expressed in terms of the natural basis, x = j. x j x j,

Portfolio Choice. := δi j, the basis is orthonormal. Expressed in terms of the natural basis, x = j. x j x j, Portfolio Choice Let us model portfolio choice formally in Euclidean space. There are n assets, and the portfolio space X = R n. A vector x X is a portfolio. Even though we like to see a vector as coordinate-free,

More information

The Capital Asset Pricing Model as a corollary of the Black Scholes model

The Capital Asset Pricing Model as a corollary of the Black Scholes model he Capital Asset Pricing Model as a corollary of the Black Scholes model Vladimir Vovk he Game-heoretic Probability and Finance Project Working Paper #39 September 6, 011 Project web site: http://www.probabilityandfinance.com

More information

Multilevel Monte Carlo Path Simulation

Multilevel Monte Carlo Path Simulation Mutieve Monte Caro Path Simuation Mike Gies gies@comab.ox.ac.uk Oxford University Computing Laboratory First IMA Conference on Computationa Finance Mutieve Monte Caro p. 1/34 Generic Probem Stochastic

More information

Multilevel Monte Carlo Path Simulation

Multilevel Monte Carlo Path Simulation Mutieve Monte Caro Path Simuation Mike Gies gies@comab.ox.ac.uk Oxford University Computing Laboratory 15th Scottish Computationa Mathematics Symposium Mutieve Monte Caro p. 1/34 SDEs in Finance In computationa

More information

LECTURE 3: FREE CENTRAL LIMIT THEOREM AND FREE CUMULANTS

LECTURE 3: FREE CENTRAL LIMIT THEOREM AND FREE CUMULANTS LECTURE 3: FREE CENTRAL LIMIT THEOREM AND FREE CUMULANTS Recall from Lecture 2 that if (A, φ) is a non-commutative probability space and A 1,..., A n are subalgebras of A which are free with respect to

More information

Key Features of the Tax-Free Flexible Plan

Key Features of the Tax-Free Flexible Plan Key Features of the The Key Features suppied beow appy to the adut investment eement of the Famiy Fexibe Pan. No advice has been provided by Scottish Friendy in reation to this pan. If you are in any doubt

More information

Part 3: Trust-region methods for unconstrained optimization. Nick Gould (RAL)

Part 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 information

Preparing Cash Budgets

Preparing Cash Budgets Preparing Cash Budgets John Ogivie, author of the CIMA Study System Finance, gives some usefu tips on this popuar examination topic. The management of cash resources hods a centra position in the area

More information

A profile likelihood method for normal mixture with unequal variance

A profile likelihood method for normal mixture with unequal variance This is the author s fina, peer-reviewed manuscript as accepted for pubication. The pubisher-formatted version may be avaiabe through the pubisher s web site or your institution s ibrary. A profie ikeihood

More information

An Iterative Framework for Optimizing Multicast Throughput in Wireless Networks

An Iterative Framework for Optimizing Multicast Throughput in Wireless Networks An Iterative Framework for Optimizing Muticast Throughput in Wireess Networks Lihua Wan and Jie Luo Eectrica & Computer Engineering Department Coorado State University Fort Coins, CO 80523 Emai: {carawan,

More information

arxiv: v1 [q-fin.cp] 14 Feb 2018

arxiv: v1 [q-fin.cp] 14 Feb 2018 MULTILEVEL NESTED SIMULATION FOR EFFICIENT RISK ESTIMATION arxiv:1802.05016v1 [q-fin.cp] 14 Feb 2018 By Michae B. Gies and Abdu-Lateef Haji-Ai University of Oxford We investigate the probem of computing

More information

Your guide to remortgaging

Your guide to remortgaging Mortgages Need more information? Speak to one of our mortgage advisers who wi be happy to expain more about our range of mortgages. Ca: 0345 734 4345 (Monday to Friday 8am to 6pm) Cas may be monitored

More information

Deterministic multi-player Dynkin games

Deterministic multi-player Dynkin games Journa of Mathematica Economics 1097 (2003) 1 19 Deterministic muti-payer Dynkin games Eion Soan a,b,, Nicoas Vieie c a MEDS Department, Keogg Schoo of Management, Northwestern University, 2001 Sheridan

More information

Strong normalisation and the typed lambda calculus

Strong normalisation and the typed lambda calculus CHAPTER 9 Strong normalisation and the typed lambda calculus In the previous chapter we looked at some reduction rules for intuitionistic natural deduction proofs and we have seen that by applying these

More information

X i = 124 MARTINGALES

X i = 124 MARTINGALES 124 MARTINGALES 5.4. Optimal Sampling Theorem (OST). First I stated it a little vaguely: Theorem 5.12. Suppose that (1) T is a stopping time (2) M n is a martingale wrt the filtration F n (3) certain other

More information

Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem

Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem Joshua Cooper August 14, 006 Abstract We show that the problem of counting collinear points in a permutation (previously considered by the

More information

THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET

THE 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 information

Lecture 2: The Simple Story of 2-SAT

Lecture 2: The Simple Story of 2-SAT 0510-7410: Topics in Algorithms - Random Satisfiability March 04, 2014 Lecture 2: The Simple Story of 2-SAT Lecturer: Benny Applebaum Scribe(s): Mor Baruch 1 Lecture Outline In this talk we will show that

More information

Version A. Problem 1. Let X be the continuous random variable defined by the following pdf: 1 x/2 when 0 x 2, f(x) = 0 otherwise.

Version A. Problem 1. Let X be the continuous random variable defined by the following pdf: 1 x/2 when 0 x 2, f(x) = 0 otherwise. Math 224 Q Exam 3A Fall 217 Tues Dec 12 Version A Problem 1. Let X be the continuous random variable defined by the following pdf: { 1 x/2 when x 2, f(x) otherwise. (a) Compute the mean µ E[X]. E[X] x

More information

MULTILEVEL MONTE CARLO FOR BASKET OPTIONS. Michael B. Giles

MULTILEVEL MONTE CARLO FOR BASKET OPTIONS. Michael B. Giles Proceedings of the 29 Winter Simuation Conference M. D. Rossetti, R. R. Hi, B. Johansson, A. Dunkin, and R. G. Ingas, eds. MULTILEVEL MONTE CARLO FOR BASKET OPTIONS Michae B. Gies Oxford-Man Institute

More information

Value of Flexibility in Managing R&D Projects Revisited

Value of Flexibility in Managing R&D Projects Revisited Value of Flexibility in Managing R&D Projects Revisited Leonardo P. Santiago & Pirooz Vakili November 2004 Abstract In this paper we consider the question of whether an increase in uncertainty increases

More information

Multilevel Monte Carlo path simulation

Multilevel Monte Carlo path simulation Mutieve Monte Caro path simuation Mike Gies gies@comab.ox.ac.uk Oxford University Mathematica Institute Oxford-Man Institute of Quantitative Finance Acknowedgments: research funding from Microsoft and

More information

Online Appendix to Product and Pricing Decisions in Crowdfunding

Online Appendix to Product and Pricing Decisions in Crowdfunding 1 Onine Appendix to Product and Pricing Decisions in Crowdfunding A. Simutaneous versus Sequentia Modes Sequentia mecanism assumes tat two buyers arrive at te proposed project at different periods and

More information

Two-side Parisian Option with single barrier

Two-side Parisian Option with single barrier Two-side Parisian Option with singe barrier Angeos Dassios Shane Wu Department of Statistics London Schoo of conomics Houghton Street London WCA A adassios@seacuk swu3@seacuk Abstract In this paper we

More information

Lecture 14: Basic Fixpoint Theorems (cont.)

Lecture 14: Basic Fixpoint Theorems (cont.) Lecture 14: Basic Fixpoint Theorems (cont) Predicate Transformers Monotonicity and Continuity Existence of Fixpoints Computing Fixpoints Fixpoint Characterization of CTL Operators 1 2 E M Clarke and E

More information

On Existence of Equilibria. Bayesian Allocation-Mechanisms

On Existence of Equilibria. Bayesian Allocation-Mechanisms On Existence of Equilibria in Bayesian Allocation Mechanisms Northwestern University April 23, 2014 Bayesian Allocation Mechanisms In allocation mechanisms, agents choose messages. The messages determine

More information

Optimal Hedge Ratio for Brent Oil Market; Baysian Approach

Optimal Hedge Ratio for Brent Oil Market; Baysian Approach Internationa Letters of Socia and Humanistic Sciences Onine: 2014-08-17 ISSN: 2300-2697, Vo. 37, pp 82-87 doi:10.18052/www.scipress.com/ilshs.37.82 2014 SciPress Ltd., Switzerand Optima Hedge Ratio for

More information

The rth moment of a real-valued random variable X with density f(x) is. x r f(x) dx

The rth moment of a real-valued random variable X with density f(x) is. x r f(x) dx 1 Cumulants 1.1 Definition The rth moment of a real-valued random variable X with density f(x) is µ r = E(X r ) = x r f(x) dx for integer r = 0, 1,.... The value is assumed to be finite. Provided that

More information

TEST 1 SOLUTIONS MATH 1002

TEST 1 SOLUTIONS MATH 1002 October 17, 2014 1 TEST 1 SOLUTIONS MATH 1002 1. Indicate whether each it below exists or does not exist. If the it exists then write what it is. No proofs are required. For example, 1 n exists and is

More information

Lecture I. Advanced Monte Carlo Methods: I. Euler scheme

Lecture I. Advanced Monte Carlo Methods: I. Euler scheme Advanced Monte Caro Methods: I p. 3/51 Lecture I Advanced Monte Caro Methods: I p. 4/51 Advanced Monte Caro Methods: I Prof. Mike Gies mike.gies@maths.ox.ac.uk Oxford University Mathematica Institute Improved

More information

Cumulants and triangles in Erdős-Rényi random graphs

Cumulants and triangles in Erdős-Rényi random graphs Cumulants and triangles in Erdős-Rényi random graphs Valentin Féray partially joint work with Pierre-Loïc Méliot (Orsay) and Ashkan Nighekbali (Zürich) Institut für Mathematik, Universität Zürich Probability

More information

LECTURE 2: MULTIPERIOD MODELS AND TREES

LECTURE 2: MULTIPERIOD MODELS AND TREES LECTURE 2: MULTIPERIOD MODELS AND TREES 1. Introduction One-period models, which were the subject of Lecture 1, are of limited usefulness in the pricing and hedging of derivative securities. In real-world

More information

Game Theory: Normal Form Games

Game Theory: Normal Form Games Game Theory: Normal Form Games Michael Levet June 23, 2016 1 Introduction Game Theory is a mathematical field that studies how rational agents make decisions in both competitive and cooperative situations.

More information

The ruin probabilities of a multidimensional perturbed risk model

The ruin probabilities of a multidimensional perturbed risk model MATHEMATICAL COMMUNICATIONS 231 Math. Commun. 18(2013, 231 239 The ruin probabilities of a multidimensional perturbed risk model Tatjana Slijepčević-Manger 1, 1 Faculty of Civil Engineering, University

More information

Finance 462 Solutions to Problem Set #9. First, to simplify, set the unemployment rate to 5% (.05)

Finance 462 Solutions to Problem Set #9. First, to simplify, set the unemployment rate to 5% (.05) Finance 46 Soutions to Probem Set #9 1) With no fees, we have the foowing demand fooans: Q = 15 64 90. 4UR First, to simpify, set the unempoyment rate to 5% (.05) Q = 15 64 90.4(.05) = 10.48 64 To cacuate

More information

Notes on the symmetric group

Notes on the symmetric group Notes on the symmetric group 1 Computations in the symmetric group Recall that, given a set X, the set S X of all bijections from X to itself (or, more briefly, permutations of X) is group under function

More information

Barriers and Optimal Investment 1

Barriers and Optimal Investment 1 Barriers and Optima Investment 1 Jean-Danie Saphores 2 bstract This paper anayzes the impact of different types of barriers on the decision to invest using a simpe framework based on stochastic discount

More information

The Probabilistic Method - Probabilistic Techniques. Lecture 7: Martingales

The 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 information

Yao s Minimax Principle

Yao s Minimax Principle Complexity of algorithms The complexity of an algorithm is usually measured with respect to the size of the input, where size may for example refer to the length of a binary word describing the input,

More information

A guide to your with-profits investment and how we manage our With-Profit Fund

A guide to your with-profits investment and how we manage our With-Profit Fund Important information A guide to your with-profits investment and how we manage our With-Profit Fund For customers investing through pension pans. Contents This guide is important as it aims to answer

More information

arxiv: v2 [math.pr] 22 Dec 2015

arxiv: v2 [math.pr] 22 Dec 2015 Mean-fied Dynamics of Load-Baancing Networks with Genera Service Distributions Reza Aghajani 1, Xingjie Li 2, and Kavita Ramanan 1 arxiv:1512.556v2 [math.pr] 22 Dec 215 1 Division of Appied Mathematics,

More information

A class of coherent risk measures based on one-sided moments

A class of coherent risk measures based on one-sided moments A class of coherent risk measures based on one-sided moments T. Fischer Darmstadt University of Technology November 11, 2003 Abstract This brief paper explains how to obtain upper boundaries of shortfall

More information

On the Lower Arbitrage Bound of American Contingent Claims

On the Lower Arbitrage Bound of American Contingent Claims On the Lower Arbitrage Bound of American Contingent Claims Beatrice Acciaio Gregor Svindland December 2011 Abstract We prove that in a discrete-time market model the lower arbitrage bound of an American

More information

Decision theoretic estimation of the ratio of variances in a bivariate normal distribution 1

Decision theoretic estimation of the ratio of variances in a bivariate normal distribution 1 Decision theoretic estimation of the ratio of variances in a bivariate normal distribution 1 George Iliopoulos Department of Mathematics University of Patras 26500 Rio, Patras, Greece Abstract In this

More information

Stochastic Dual Dynamic Programming Algorithm for Multistage Stochastic Programming

Stochastic Dual Dynamic Programming Algorithm for Multistage Stochastic Programming Stochastic Dual Dynamic Programg Algorithm for Multistage Stochastic Programg Final presentation ISyE 8813 Fall 2011 Guido Lagos Wajdi Tekaya Georgia Institute of Technology November 30, 2011 Multistage

More information

A guide to your with-profits investment and how we manage our With-Profit Fund

A guide to your with-profits investment and how we manage our With-Profit Fund Important information A guide to your with-profits investment and how we manage our With-Profit Fund For customers investing through an Aviva investment bond. Contents This guide is important as it aims

More information

An Ascending Double Auction

An Ascending Double Auction An Ascending Double Auction Michael Peters and Sergei Severinov First Version: March 1 2003, This version: January 20 2006 Abstract We show why the failure of the affiliation assumption prevents the double

More information

A single potential governing convergence of conjugate gradient, accelerated gradient and geometric descent

A single potential governing convergence of conjugate gradient, accelerated gradient and geometric descent A singe potentia governing convergence of conjugate gradient, acceerated gradient and geometric descent Sahar Karimi Stephen Vavasis December 18, 2017 Abstract Nesterov s acceerated gradient (AG) method

More information

3.4 Copula approach for modeling default dependency. Two aspects of modeling the default times of several obligors

3.4 Copula approach for modeling default dependency. Two aspects of modeling the default times of several obligors 3.4 Copula approach for modeling default dependency Two aspects of modeling the default times of several obligors 1. Default dynamics of a single obligor. 2. Model the dependence structure of defaults

More information

Loading Factors and Equilibria in Insurance Markets

Loading Factors and Equilibria in Insurance Markets Loading Factors and Equiibria in Insurance Markets Yoram Eden, * Eiakim Katz, ** and Jacob Rosenberg *** Abstract: Tis paper examines te effect of introducing positive oading factors into insurance premia,

More information

Antithetic multilevel Monte Carlo estimation for multidimensional SDES

Antithetic multilevel Monte Carlo estimation for multidimensional SDES Antithetic mutieve Monte Caro estimation for mutidimensiona SDES Michae B. Gies and Lukasz Szpruch Abstract In this paper we deveop antithetic mutieve Monte Caro MLMC estimators for mutidimensiona SDEs

More information

Illiquid financial market models and absence of arbitrage

Illiquid financial market models and absence of arbitrage Johannes Gutenberg-Universität Mainz Iiquid financia market modes and absence of arbitrage Dipomarbeit vorgeegt dem Fachbereich Physik, Mathematik und Informatik im August 27 von Matthias Pau Jüttner Die

More information

In Discrete Time a Local Martingale is a Martingale under an Equivalent Probability Measure

In Discrete Time a Local Martingale is a Martingale under an Equivalent Probability Measure In Discrete Time a Local Martingale is a Martingale under an Equivalent Probability Measure Yuri Kabanov 1,2 1 Laboratoire de Mathématiques, Université de Franche-Comté, 16 Route de Gray, 253 Besançon,

More information

Outline. 1 Introduction. 2 Algorithms. 3 Examples. Algorithm 1 General coordinate minimization framework. 1: Choose x 0 R n and set k 0.

Outline. 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 information

Pricing and Simulating Catastrophe Risk Bonds in a Markov-dependent Environment

Pricing and Simulating Catastrophe Risk Bonds in a Markov-dependent Environment Pricing and Simuating Catastrophe Risk Bonds in a Markov-dependent Environment Shao, J, Papaioannou, A, Panteous, A & Sparks, T Author post-print (accepted) deposited by Coventry University s Repository

More information

Basic Arbitrage Theory KTH Tomas Björk

Basic Arbitrage Theory KTH Tomas Björk Basic Arbitrage Theory KTH 2010 Tomas Björk Tomas Björk, 2010 Contents 1. Mathematics recap. (Ch 10-12) 2. Recap of the martingale approach. (Ch 10-12) 3. Change of numeraire. (Ch 26) Björk,T. Arbitrage

More information

Lecture Quantitative Finance Spring Term 2015

Lecture Quantitative Finance Spring Term 2015 implied Lecture Quantitative Finance Spring Term 2015 : May 7, 2015 1 / 28 implied 1 implied 2 / 28 Motivation and setup implied the goal of this chapter is to treat the implied which requires an algorithm

More information

Equivalence between Semimartingales and Itô Processes

Equivalence between Semimartingales and Itô Processes International Journal of Mathematical Analysis Vol. 9, 215, no. 16, 787-791 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ijma.215.411358 Equivalence between Semimartingales and Itô Processes

More information

UNIFORM BOUNDS FOR BLACK SCHOLES IMPLIED VOLATILITY

UNIFORM BOUNDS FOR BLACK SCHOLES IMPLIED VOLATILITY UNIFORM BOUNDS FOR BLACK SCHOLES IMPLIED VOLATILITY MICHAEL R. TEHRANCHI UNIVERSITY OF CAMBRIDGE Abstract. The Black Scholes implied total variance function is defined by V BS (k, c) = v Φ ( k/ v + v/2

More information

COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS

COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS DAN HATHAWAY AND SCOTT SCHNEIDER Abstract. We discuss combinatorial conditions for the existence of various types of reductions between equivalence

More information

How to understand the invoicing package? February 2018

How to understand the invoicing package? February 2018 How to understand the invoicing package? February 2018 Introduction Documents incuded in the invoicing package: 1. Contribution Notice 2. Annex A: Debit Note - Debit note (and bank account confirmation

More information

S CORPORATIONS INTRODUCTION AND STUDY OBJECTIVES. In studying the rules of S corporations, the student should have these objectives: STUDY HIGHLIGHTS

S CORPORATIONS INTRODUCTION AND STUDY OBJECTIVES. In studying the rules of S corporations, the student should have these objectives: STUDY HIGHLIGHTS H Chapter Eeven H S CORPORATIONS INTRODUCTION AND STUDY OBJECTIVES Certain sma business corporations may eect to be taxed under Subchapter S instead of under the reguar rues for taxation of corporations.

More information

symmys.com 3.2 Projection of the invariants to the investment horizon

symmys.com 3.2 Projection of the invariants to the investment horizon 122 3 Modeling the market In the swaption world the underlying rate (3.57) has a bounded range and thus it does not display the explosive pattern typical of a stock price. Therefore the swaption prices

More information

Multifractal random walks as fractional Wiener integrals P. Abry, P. Chainais L. Coutin, V. Pipiras

Multifractal random walks as fractional Wiener integrals P. Abry, P. Chainais L. Coutin, V. Pipiras Multifractal random walks as fractional Wiener integrals P. Abry, P. Chainais L. Coutin, V. Pipiras 2 MOTIVATIONS Scale invariance property : Find a stochastic process (X t ) t [0,1] such that the moments

More information

Analyzing Scrip Systems

Analyzing Scrip Systems Submitted to manuscript Pease, provide the manuscript number! Anayzing Scrip Systems Kris Johnson Operations Research Center, Massachusetts Institute of Technoogy, krisd@mit.edu David Simchi-Levi Engineering

More information

On the Optimality of FCFS for Networks of Multi-Server Queues

On the Optimality of FCFS for Networks of Multi-Server Queues On the Optimality of FCFS for Networks of Multi-Server Queues Ger Koole Vrie Universiteit De Boelelaan 1081a, 1081 HV Amsterdam The Netherlands Technical Report BS-R9235, CWI, Amsterdam, 1992 Abstract

More information

Pricing and Revenue Sharing Strategies for Internet Service Providers

Pricing and Revenue Sharing Strategies for Internet Service Providers Pricing and Revenue Sharing Strategies for Internet Service Providers Linhai He and Jean Warand Dept. of EECS, U.C. Berkeey {inhai,wr}@eecs.berkeey.edu 1 Abstract One of the chaenges facing the networking

More information

( ) = R + ª. Similarly, for any set endowed with a preference relation º, we can think of the upper contour set as a correspondance  : defined as

( ) = R + ª. Similarly, for any set endowed with a preference relation º, we can think of the upper contour set as a correspondance  : defined as 6 Lecture 6 6.1 Continuity of Correspondances So far we have dealt only with functions. It is going to be useful at a later stage to start thinking about correspondances. A correspondance is just a set-valued

More information

- Introduction to Mathematical Finance -

- Introduction to Mathematical Finance - - Introduction to Mathematical Finance - Lecture Notes by Ulrich Horst The objective of this course is to give an introduction to the probabilistic techniques required to understand the most widely used

More information

Introduction to Game Theory Evolution Games Theory: Replicator Dynamics

Introduction to Game Theory Evolution Games Theory: Replicator Dynamics Introduction to Game Theory Evolution Games Theory: Replicator Dynamics John C.S. Lui Department of Computer Science & Engineering The Chinese University of Hong Kong www.cse.cuhk.edu.hk/ cslui John C.S.

More information

The Fundamental Theorem of Asset Pricing under Proportional Transaction Costs in Finite Discrete Time

The Fundamental Theorem of Asset Pricing under Proportional Transaction Costs in Finite Discrete Time The Fundamental Theorem of Asset Pricing under Proportional Transaction Costs in Finite Discrete Time Walter Schachermayer Vienna University of Technology November 15, 2002 Abstract We prove a version

More information

Math-Stat-491-Fall2014-Notes-V

Math-Stat-491-Fall2014-Notes-V Math-Stat-491-Fall2014-Notes-V Hariharan Narayanan December 7, 2014 Martingales 1 Introduction Martingales were originally introduced into probability theory as a model for fair betting games. Essentially

More information

SELF-ADJOINT BOUNDARY-VALUE PROBLEMS ON TIME-SCALES

SELF-ADJOINT BOUNDARY-VALUE PROBLEMS ON TIME-SCALES Electronic Journal of Differential Equations, Vol. 2007(2007), No. 175, pp. 1 10. ISSN: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu (login: ftp) SELF-ADJOINT

More information

Additional Guidance 2019 ex-ante data reporting form. October 2018

Additional Guidance 2019 ex-ante data reporting form. October 2018 Additiona Guidance 2019 ex-ante data reporting form October 2018 The foowing sides compement the definitions and guidance incuded in the Ex-ante Contributions Reporting Form (hereafter Data Reporting Form)

More information

Additional questions for chapter 3

Additional questions for chapter 3 Additional questions for chapter 3 1. Let ξ 1, ξ 2,... be independent and identically distributed with φθ) = IEexp{θξ 1 })

More information

B. Online Appendix. where ɛ may be arbitrarily chosen to satisfy 0 < ɛ < s 1 and s 1 is defined in (B1). This can be rewritten as

B. Online Appendix. where ɛ may be arbitrarily chosen to satisfy 0 < ɛ < s 1 and s 1 is defined in (B1). This can be rewritten as B Online Appendix B1 Constructing examples with nonmonotonic adoption policies Assume c > 0 and the utility function u(w) is increasing and approaches as w approaches 0 Suppose we have a prior distribution

More information

STAT 830 Convergence in Distribution

STAT 830 Convergence in Distribution STAT 830 Convergence in Distribution Richard Lockhart Simon Fraser University STAT 830 Fall 2013 Richard Lockhart (Simon Fraser University) STAT 830 Convergence in Distribution STAT 830 Fall 2013 1 / 31

More information

Hedging of swaptions in a Lévy driven Heath-Jarrow-Morton framework

Hedging of swaptions in a Lévy driven Heath-Jarrow-Morton framework Hedging of swaptions in a Lévy driven Heath-Jarrow-Morton framework Kathrin Glau, Nele Vandaele, Michèle Vanmaele Bachelier Finance Society World Congress 2010 June 22-26, 2010 Nele Vandaele Hedging of

More information

The Limiting Distribution for the Number of Symbol Comparisons Used by QuickSort is Nondegenerate (Extended Abstract)

The Limiting Distribution for the Number of Symbol Comparisons Used by QuickSort is Nondegenerate (Extended Abstract) The Limiting Distribution for the Number of Symbol Comparisons Used by QuickSort is Nondegenerate (Extended Abstract) Patrick Bindjeme 1 James Allen Fill 1 1 Department of Applied Mathematics Statistics,

More information

Universality of Correlations for Random Analytic Functions

Universality of Correlations for Random Analytic Functions Universality of Correlations for Random Analytic Functions Shannon Starr February 18, 2011 Abstract We review a result obtained with Andrew Ledoan and Marco Merkli. Consider a random analytic function

More information

THE TRAVELING SALESMAN PROBLEM FOR MOVING POINTS ON A LINE

THE TRAVELING SALESMAN PROBLEM FOR MOVING POINTS ON A LINE THE TRAVELING SALESMAN PROBLEM FOR MOVING POINTS ON A LINE GÜNTER ROTE Abstract. A salesperson wants to visit each of n objects that move on a line at given constant speeds in the shortest possible time,

More information

Application 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 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 information

European Contingent Claims

European Contingent Claims European Contingent Claims Seminar: Financial Modelling in Life Insurance organized by Dr. Nikolic and Dr. Meyhöfer Zhiwen Ning 13.05.2016 Zhiwen Ning European Contingent Claims 13.05.2016 1 / 23 outline

More information

Log-linear Dynamics and Local Potential

Log-linear Dynamics and Local Potential Log-linear Dynamics and Local Potential Daijiro Okada and Olivier Tercieux [This version: November 28, 2008] Abstract We show that local potential maximizer ([15]) with constant weights is stochastically

More information

Additional Guidance 2018 ex-ante data reporting form. October 2017

Additional Guidance 2018 ex-ante data reporting form. October 2017 Additiona Guidance 2018 ex-ante data reporting form October 2017 The foowing sides compement the definitions and guidance incuded in the Ex-ante Contributions Reporting Form (hereafter Data Reporting Form)

More information

GPD-POT and GEV block maxima

GPD-POT and GEV block maxima Chapter 3 GPD-POT and GEV block maxima This chapter is devoted to the relation between POT models and Block Maxima (BM). We only consider the classical frameworks where POT excesses are assumed to be GPD,

More information

4: SINGLE-PERIOD MARKET MODELS

4: 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 information

1 Dynamic programming

1 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 information

Adaptive cubic overestimation methods for unconstrained optimization

Adaptive cubic overestimation methods for unconstrained optimization Report no. NA-07/20 Adaptive cubic overestimation methods for unconstrained optimization Coralia Cartis School of Mathematics, University of Edinburgh, The King s Buildings, Edinburgh, EH9 3JZ, Scotland,

More information

A relation on 132-avoiding permutation patterns

A relation on 132-avoiding permutation patterns Discrete Mathematics and Theoretical Computer Science DMTCS vol. VOL, 205, 285 302 A relation on 32-avoiding permutation patterns Natalie Aisbett School of Mathematics and Statistics, University of Sydney,

More information

ADDING A LOT OF COHEN REALS BY ADDING A FEW II. 1. Introduction

ADDING 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 information

Dynamic programming and efficient hedging for unit-linked insurance contracts

Dynamic programming and efficient hedging for unit-linked insurance contracts Dynamic programming and efficient hedging for unit-inked insurance contracts Johannes Morsing Johannesen Thomas Møer PFA Pension PFA Pension Sundkrogsgade 4 Sundkrogsgade 4 DK-2100 Copenhagen Ø DK-2100

More information

Multiagent Resource Allocation with Sharable Items: Simple Protocols and Nash Equilibria

Multiagent Resource Allocation with Sharable Items: Simple Protocols and Nash Equilibria Mutiagent Resource Aocation with Sharabe Items: Simpe Protocos and Nash Equiibria Stéphane Airiau Ue Endriss Institute for Logic, Language and Computation University of Amsterdam ABSTRACT We study a particuar

More information

GAME THEORY. Department of Economics, MIT, Follow Muhamet s slides. We need the following result for future reference.

GAME THEORY. Department of Economics, MIT, Follow Muhamet s slides. We need the following result for future reference. 14.126 GAME THEORY MIHAI MANEA Department of Economics, MIT, 1. Existence and Continuity of Nash Equilibria Follow Muhamet s slides. We need the following result for future reference. Theorem 1. Suppose

More information

A Decentralized Learning Equilibrium

A Decentralized Learning Equilibrium Paper to be presented at the DRUID Society Conference 2014, CBS, Copenhagen, June 16-18 A Decentralized Learning Equilibrium Andreas Blume University of Arizona Economics ablume@email.arizona.edu April

More information