Competitive Experimentation and Private Information

Size: px
Start display at page:

Download "Competitive Experimentation and Private Information"

Transcription

1 Compettve Expermentaton an Prvate Informaton Guseppe Moscarn an Francesco Squntan Omtte Analyss not Submtte for Publcaton Dervatons for te Gamma-Exponental Moel Dervaton of expecte azar rates. By Bayes rule, posteror belefs are π t,t 0( x, y) π ( z x, z j y, t t, t j t 0 ) π () (x ) (y )[ F (t )] [ F j (t 0 )] RΛ π (0 ) (x 0 ) (y 0 )[ F (t 0 )] [ F j (t 0 0 )] 0 e α β e x e y e (ζ +)t e (ζ j +)t0 RΛ e α0 0β 0 e 0 x 0 e 0 y e (ζ +)t e (ζ j +)t0 0 e (α x y+t+t0) β+ Γ (β +)(α x y + t + t 0 ) β, π t,t 0( x, y+) π ( z x, z j y, t t, t j t 0 ) π () (x )[ H(y )] [ F (t )] [ F j (t 0 )] RΛ π (0 ) (x 0 )[ H(y 0 )] [ F (t 0 )] [ F j (t 0 0 )] 0 β e (α+t+t0 x) e (α+t+t0 x y) Γ (β +) (α + t + t 0 x) β (α + t + t 0 x y) β. Takng expectatons of te azar rate wt respect to tese tree posterors yels te followng expressons: E t,t [ x, y] β + 0 α x y + t + t, 0 E t,t [ x, y ] β + 0 α x y + t + t, 0 E t,t 0 [ x, y+] (β +)(α + t + t0 x) β (α + t + t 0 x y) β (α + t + t 0 x) β (α + t + t 0 x y) β. Lemma A.3 In te Gamma-exponental moel, E t,t [ζ + x, y+] satsfes Assumptons an. Proof. We use te followng tecncal result.

2 Teorem A. Let q : Λ < n < +,ntegrablentsfrst argument an fferentable n te remanng n arguments, wt R Λ q(, θ) (0, ). Ten te c..f. efne by: ϕ(l, θ) R L q(, θ) RΛ q 0, θ 0 for every L, s stocastcally strctly ncreasng n every component of θ f q(, θ) s log-supermoular n (, θ ),.e. f log q(, θ)/ θ s strctly ncreasng n. Proof We want to sow tat for every L, usng te clam reas Z Λ R 0 > L q(, θ) θ RΛ q(, θ) Z q(, θ) θ log q(, θ) q(, θ) θ RΛ q 0, > θ 0 R L q(, θ) R L θ RΛ q(, θ) q(, θ) R Λ θ R θ) q(, Λ Z log q(, θ) q(, θ θ) Z L q(, θ) log q(, θ) q(, θ) θ R L q 0, θ 0 Asuffcent conton for te latter nequalty s tat te RHS be strctly ncreasng n L. Snce te RHS s fferentable n L, tsuffces tat 0 < Z L log q(, θ) q(, θ) L θ R L q 0, θ 0 log q(l, θ) q(l, θ) θ R L q 0, q(l, θ) θ 0 or log q(l, Z θ) L > θ Z L log q(, θ) q(, θ) θ R L q 0, θ 0 log q(, θ) q(, θ) θ R L q 0,. θ 0 But, snce R L q(, θ) L q ( 0,, ts follows from te assumpton tat te LHS s strctly θ) 0 ncreasng n. It now suffces to sow tat for every x, y, t, t 0, te c..f. assocate wt te posteror belefs π t,t 0 ( x, y+) are stocastcally strctly ecreasng n t an n t 0 an strctly ncreasng n x an n y. We prove all tese results as corollares of Teorem A. Let θ (x, y, t, t 0 ), q(, θ)π () (x )[ H (y )] [ F (t )] [ F (t 0 )],

3 Snce te expressons log q(, θ) t ϕ(l, θ) Z L π t,t 0 ( x, y+). f (t ) F (t ), log q(, θ) t 0 f (t0 ) F (t 0 ) log q(, θ) x 0 (x ) (x ), log q(, θ) (y ) y H (y ) ex e x are strctly monotonc n, all monotoncty results follow from Teorem A. lm t E t,t 0 [ x, y+] 0 follows from: Te lmt lm τ π τ,τ ( >ε x, y+) lm τ R ε R e α β e x e y e τ e 0 α0 0β 0 e 0 x e 0. 0 y e 0 τ 0 Lemma A.4 In te Gamma-exponental moel, Et,t [ζ + x, y+] satsfes Assumpton 3. Proof. It s mmeate to verfy tat t E t,t [ζ 0 + x, y+] x E t,t [ζ 0 + x, y+], as t can be apprecate wt te cange of varable q α +t x, an φ (q, y, β) (β +) q β (q y) β q β (q y) β t E t,t [ζ 0 + x, y+] φ q q t φ q, x E t,t [ζ 0 + x, y+] φ q q x φ q Hence, settng G just a bt larger tan an tus G 0 < / satsfes te nequalty n Assumpton 3. For te frst nequalty, we sow tat t s strct at G 0 / an terefore, by contnuty, for G 0 slgtly larger: y E t,t 0 [ζ + x, y+] < t E t,t 0 [ζ + x, y+] x E t,t 0 [ζ + x, y+]. Algebra yels x E t,t 0 [ζ + x, y+] (β +) (β +) (α +t x) β 3 (α +t x y) β 3 (α +t x) β (α +t x y) β (β +) (α +t x) β +(α +t x y) β (α +t x) β (α +t x y) β 3

4 y E t,t [ζ 0 + x, y+] (β +)(α +t x y) β 3 (α +t x) β (α +t x y) β +(β +)(α +t x y) β (α +t x) β (α +t x y) β (β +) (α +t x) β (α +t x y) β. Hence, x E t,t [ζ 0 + x, y+] + y E t,t [ζ 0 + x, y+] (β +) (α +t x) β 3 (α +t x) β (α +t x y) β (β +) (α +t x) β (α +t x) β (α +t x y) β (β +) (α +t x) β (α +t x y) β (α + t + t 0 x) β (β +) (α + t + t 0 x) β (α + t + t 0 x y) β (α + t + t 0 x) β 3 (β +) (α + t + t 0 x) β (α + t + t 0 x y) β q β β 3 q (β +) (β +) q β β (q y) q β (q y) β We want ts quantty to be strctly negatve. Ts s so f te followng ervatve s strctly postve for all β,y: Ã! q β β β q β (q y) β q β q β q β (q y) β ln q + q β ln q (q y) β ln (q y) + β q β β (q y) q β (q y) β q β (q y) β + β q β (q y) β ln q + q β ln q (q y) β ln (q y) q β (q y) β +(q y) β β (ln q ln (q y)) : χ (β,y) Note tat for y<0 q β χ (β,y) y β ln q ln (q y) β (q y) β+ (y q)(q y) β (q y) ln q) β (ln < 0, β β+ (q y) (q y) β+ 4

5 wle χ (β,0) q β q β + q β β (ln q ln (q)) 0, χ(β, ) q β q β + β q y q β > 0. So nee χ (β,0) > 0 for all β,y. (q y) β +β(ln(q y) ln q) (q y) β Lemma A.5 In te Gamma-exponental moel, tere exsts a unque monotonc fferentable equlbrum. Proof. Proceeng by contracton, suppose tat for some x, y tere exst two optmal stoppng tmes as frst qutter. We can reprase ts as follows: for some τ, tere exst sgnals (x, y) 6 (x 0,y 0 ) suc tat q A E τ,τ [ x, y+],q B E τ,τ [ y, x+],q A E τ,τ [ x 0,y 0 +], q B E τ,τ [ y 0,x 0 +]. Note tat we can take (x, y) < 0, an (x 0,y 0 ) < 0 by contnuty of V,t (τ x) /τ tτ an V,t (τ y) /τ tτ. Smple manpulatons of Eq. (6) ten yel: q A (β +)(α +τ x y)) (β+) (α +τ x y)) (β+) q A (β +)(α +τ x) (β+) (α +τ x) (β+) Conser te functons q B (β +)(α +τ x y)) (β+) (α +τ x y)) (β+) q B (β +)(α +τ y) (β+) (α +τ y) (β+). ϕ (ξ) q (β +)(α +τ ξ) (β+) (α +τ ξ) (β+) for A, B. Note tat ϕ 0 (ξ) q (β +)+ξ α τ, s contnuous n ξ, as at most one zero, ξ 0 α +τ q (β +), an as te same sgn as ξ ξ 0. So, suppose tat x 0 <x.te contons ϕ A (x) ϕ A (x + y) an ϕ A (x 0 )ϕ A (x 0 + y 0 ) requre x 0 + y 0 >x+ y, an ence y 0 >y.but ten, te conton ϕ B (x) ϕ B (x + y) an ϕ B (x 0 )ϕ B (x 0 + y 0 ) requre tat x 0 + y 0 <x+ y, an we ave a contracton. A smlar contracton s obtane wen supposng tat x 0 >x. Te Bnary Pror Moel Suppose tat te prze arrves accorng to an exponental process of ntensty,.e. wt F (t ) e t. Te pror s concentrate on two ponts: p 0 Pr( ) Pr ( 0 ) were > 0 > 0. Contonal on, te prvate sgnal s strbute as Pr (z z ) e z for z 0. Terefore te posteror belef of s π t,t 0 (x, y) p 0 e t e t 0 e x e y ( p 0 ) e 0t e 0t 0 e 0x 0 e 0y + p 0 e t e t 0 e x e y [+q (p 0, 0,,t,t 0,x,y)] 5

6 were q (p 0, 0,,t,t 0,x,y) p 0 e ( 0 )(t+t 0 x y) p 0 0 So E t,t [ρ 0 (τ ) x, y] 0q (p 0, 0,,t,t 0,x,y)+ q (p 0, 0,,t,t 0,x,y)+. Ts s fferentable n x, y, t, t 0. Snce q s ecreasng n x, y an ncreasng n t, t 0 an te expecte azar rate s ecreasng n q, ten te expecte azar rate s ncreasng n x, y an ecreasng n t, t 0. Next E t,t [ρ 0 (τ ) x, y ] 0q (p 0, 0,,t,t 0,x,y)+ q (p 0, 0,,t,t 0,x,y)+ were q (p 0, 0,,t,t 0,x,y) p 0 e ( 0 )(t+t 0 x y) 0 p 0 Ts as te same propertes as E t,t [ρ 0 (τ ) x, y] w.r. to x, y, t, t 0. Fnally E t,t [ρ 0 (τ ) x, y+] 0q + (p 0, 0,,t,t 0,x,y)+ q + (p 0, 0,,t,t 0,x,y)+. were q + (p 0, 0,,t,t 0,x,y) p 0 e ( 0 )(t+t 0 x) e0y p 0 e y 0 Ts as te same propertes as E t,t 0 [ρ (τ ) x, y] w.r. to x, t, t 0.Because q 0 q + 0 q + (q +) < 0, e ( 0 )(t+t 0 x y) ecreases n x an y an ncreases n t, because e 0 y e y e y 0 0 e y 0 ( e y ) y e y ( e y ) an y e y e ey ( e y +y) ( e y ) e y e y 0e y0 e y 0, > 0, tfollowstatassumptonsanaresatsfe. Because x E t,t [ρ (t ) x, y+] t E t,t [ρ (t ) x, y+], settng G 0 /, te nequaltes n Assumpton 3 are satsfe agan f: 0 < y E t,t [ρ (t ) x, y+] < x E t,t [ρ (t ) x, y+] 6

7 Te frst nequalty s alreay verfe. Te secon nequalty follows because: e ( 0 )(t x) e 0y e ( 0 )(t x) e 0y x e y y e y 0e y 0 e y 0 e y 0 e y + e y 0 e y ( e y ) e ( 0 )(t x) ( 0 ) e 0y e y e( 0 )(t x) e y 0 0 ( e y ) ( e y ) < 0 Fnally, te followng 0 < c <p 0 +( p 0 ) 0 b s suffcent but not even necessary to satsfy Assumpton 4. Specalzng Propostons an 3, player, observng sgnal x anuponobservngtat te opponentasleftattmeτ, wll leave te race at tme: an were log σ, (x, τ) max τ,x+ g j (τ) τ + K + 0 K σ,(x, 0) max 0,x+ x j + K ª 0 log Ã! c b p 0 c b 0 p 0 0 s a measure of te pror bas n favor of. From Proposton 5, we obtan te stoppng tme of a player wt sgnal x, contonal on te opponent j stll beng n te game s: ( "!#) Ã e σ 0,j (σ, (x)) σ,(x) max 0, x + K +( 0 ) log e 0σ,j (σ, (x) ) In te symmetrc payoff moel gj σ, (x) σ (σ (x)) x, so we obtan a close-form soluton for te frst quttng tme: ½ σ (x) max 0, x + K +( 0 ) log e x e 0x ¾. Fnally, from Proposton 7, we obtan tat n any equlbrum of te publc nformaton game, for every par of sgnals x, y, tefrst frm quts te race at tme T (x, y) (x + y + Q) an were Q T (x, y) x + y + Q T, Ã ( 0 ) log c /b p 0 c /b 0 p 0 0!. 7

Stanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7

Stanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7 Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

MATH 281A: Homework #6

MATH 281A: Homework #6 MATH 28A: Homework #6 Jongha Ryu Due date: November 8, 206 Problem. (Problem 2..2. Soluton. If X,..., X n Bern(p, then T = X s a complete suffcent statstc. Our target s g(p = p, and the nave guess suggested

More information

On a nonlinear compactness lemma in L p (0, T ; B).

On a nonlinear compactness lemma in L p (0, T ; B). On a nonlnear compactness lemma n L p (, T ; B). Emmanuel Matre Laboratore de Matématques et Applcatons Unversté de Haute-Alsace 4, rue des Frères Lumère 6893 Mulouse E.Matre@ua.fr 3t February 22 Abstract

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

Problem Set 4: Sketch of Solutions

Problem Set 4: Sketch of Solutions Problem Set 4: Sketc of Solutons Informaton Economcs (Ec 55) George Georgads Due n class or by e-mal to quel@bu.edu at :30, Monday, December 8 Problem. Screenng A monopolst can produce a good n dfferent

More information

Non-negative Matrices and Distributed Control

Non-negative Matrices and Distributed Control Non-negatve Matrces an Dstrbute Control Yln Mo July 2, 2015 We moel a network compose of m agents as a graph G = {V, E}. V = {1, 2,..., m} s the set of vertces representng the agents. E V V s the set of

More information

Chapter 2 Transformations and Expectations. , and define f

Chapter 2 Transformations and Expectations. , and define f Revew for the prevous lecture Defnton: support set of a ranom varable, the monotone functon; Theorem: How to obtan a cf, pf (or pmf) of functons of a ranom varable; Eamples: several eamples Chapter Transformatons

More information

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

Online Appendix. t=1 (p t w)q t. Then the first order condition shows that

Online Appendix. t=1 (p t w)q t. Then the first order condition shows that Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate

More information

Math 702 Midterm Exam Solutions

Math 702 Midterm Exam Solutions Math 702 Mdterm xam Solutons The terms measurable, measure, ntegrable, and almost everywhere (a.e.) n a ucldean space always refer to Lebesgue measure m. Problem. [6 pts] In each case, prove the statement

More information

Exercise Solutions to Real Analysis

Exercise Solutions to Real Analysis xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there

More information

On Pfaff s solution of the Pfaff problem

On Pfaff s solution of the Pfaff problem Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.

More information

PROBLEM SET 7 GENERAL EQUILIBRIUM

PROBLEM SET 7 GENERAL EQUILIBRIUM PROBLEM SET 7 GENERAL EQUILIBRIUM Queston a Defnton: An Arrow-Debreu Compettve Equlbrum s a vector of prces {p t } and allocatons {c t, c 2 t } whch satsfes ( Gven {p t }, c t maxmzes βt ln c t subject

More information

Hila Etzion. Min-Seok Pang

Hila Etzion. Min-Seok Pang RESERCH RTICLE COPLEENTRY ONLINE SERVICES IN COPETITIVE RKETS: INTINING PROFITILITY IN THE PRESENCE OF NETWORK EFFECTS Hla Etzon Department of Technology and Operatons, Stephen. Ross School of usness,

More information

k t+1 + c t A t k t, t=0

k t+1 + c t A t k t, t=0 Macro II (UC3M, MA/PhD Econ) Professor: Matthas Kredler Fnal Exam 6 May 208 You have 50 mnutes to complete the exam There are 80 ponts n total The exam has 4 pages If somethng n the queston s unclear,

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

Visualization of 2D Data By Rational Quadratic Functions

Visualization of 2D Data By Rational Quadratic Functions 7659 Englan UK Journal of Informaton an Computng cence Vol. No. 007 pp. 7-6 Vsualzaton of D Data By Ratonal Quaratc Functons Malk Zawwar Hussan + Nausheen Ayub Msbah Irsha Department of Mathematcs Unversty

More information

Lecture 4. Instructor: Haipeng Luo

Lecture 4. Instructor: Haipeng Luo Lecture 4 Instructor: Hapeng Luo In the followng lectures, we focus on the expert problem and study more adaptve algorthms. Although Hedge s proven to be worst-case optmal, one may wonder how well t would

More information

How Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists *

How Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists * How Strong Are Weak Patents? Joseph Farrell and Carl Shapro Supplementary Materal Lcensng Probablstc Patents to Cournot Olgopolsts * September 007 We study here the specal case n whch downstream competton

More information

Solutions Homework 4 March 5, 2018

Solutions Homework 4 March 5, 2018 1 Solutons Homework 4 March 5, 018 Soluton to Exercse 5.1.8: Let a IR be a translaton and c > 0 be a re-scalng. ˆb1 (cx + a) cx n + a (cx 1 + a) c x n x 1 cˆb 1 (x), whch shows ˆb 1 s locaton nvarant and

More information

COMP4630: λ-calculus

COMP4630: λ-calculus COMP4630: λ-calculus 4. Standardsaton Mcael Norrs Mcael.Norrs@ncta.com.au Canberra Researc Lab., NICTA Semester 2, 2015 Last Tme Confluence Te property tat dvergent evaluatons can rejon one anoter Proof

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

A MULTIDIMENSIONAL ANALOGUE OF THE RADEMACHER-GAUSSIAN TAIL COMPARISON

A MULTIDIMENSIONAL ANALOGUE OF THE RADEMACHER-GAUSSIAN TAIL COMPARISON A MULTIDIMENSIONAL ANALOGUE OF THE RADEMACHER-GAUSSIAN TAIL COMPARISON PIOTR NAYAR AND TOMASZ TKOCZ Abstract We prove a menson-free tal comparson between the Euclean norms of sums of nepenent ranom vectors

More information

TR/95 February Splines G. H. BEHFOROOZ* & N. PAPAMICHAEL

TR/95 February Splines G. H. BEHFOROOZ* & N. PAPAMICHAEL TR/9 February 980 End Condtons for Interpolatory Quntc Splnes by G. H. BEHFOROOZ* & N. PAPAMICHAEL *Present address: Dept of Matematcs Unversty of Tabrz Tabrz Iran. W9609 A B S T R A C T Accurate end condtons

More information

GENERIC CONTINUOUS SPECTRUM FOR MULTI-DIMENSIONAL QUASIPERIODIC SCHRÖDINGER OPERATORS WITH ROUGH POTENTIALS

GENERIC CONTINUOUS SPECTRUM FOR MULTI-DIMENSIONAL QUASIPERIODIC SCHRÖDINGER OPERATORS WITH ROUGH POTENTIALS GENERIC CONTINUOUS SPECTRUM FOR MULTI-DIMENSIONAL QUASIPERIODIC SCHRÖDINGER OPERATORS WITH ROUGH POTENTIALS YANG FAN AND RUI HAN Abstract. We stuy the mult-mensonal operator (H xu) n = m n = um + f(t n

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

MAT 578 Functional Analysis

MAT 578 Functional Analysis MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these

More information

Market structure and Innovation

Market structure and Innovation Market structure and Innovaton Ths presentaton s based on the paper Market structure and Innovaton authored by Glenn C. Loury, publshed n The Quarterly Journal of Economcs, Vol. 93, No.3 ( Aug 1979) I.

More information

Lecture 21: Numerical methods for pricing American type derivatives

Lecture 21: Numerical methods for pricing American type derivatives Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)

More information

First day August 1, Problems and Solutions

First day August 1, Problems and Solutions FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve

More information

Module 17: Mechanism Design & Optimal Auctions

Module 17: Mechanism Design & Optimal Auctions Module 7: Mechansm Desgn & Optmal Auctons Informaton Economcs (Ec 55) George Georgads Examples: Auctons Blateral trade Producton and dstrbuton n socety General Setup N agents Each agent has prvate nformaton

More information

Genericity of Critical Types

Genericity of Critical Types Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f

More information

Randomness and Computation

Randomness and Computation Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually

More information

Field and Wave Electromagnetic. Chapter.4

Field and Wave Electromagnetic. Chapter.4 Fel an Wave Electromagnetc Chapter.4 Soluton of electrostatc Problems Posson s s an Laplace s Equatons D = ρ E = E = V D = ε E : Two funamental equatons for electrostatc problem Where, V s scalar electrc

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

Information Acquisition in Auctions: Sealed Bids vs. Open Bids

Information Acquisition in Auctions: Sealed Bids vs. Open Bids Informaton Acquston n Auctons: Seale Bs vs. Open Bs Ángel Hernano-Vecana Unversa e Alcante Uner Revson, Do Not Crculate Aprl 1, 2005 Abstract Ths paper stues the ncentves of a ber to acqure nformaton n

More information

A MULTIDIMENSIONAL ANALOGUE OF THE RADEMACHER-GAUSSIAN TAIL COMPARISON

A MULTIDIMENSIONAL ANALOGUE OF THE RADEMACHER-GAUSSIAN TAIL COMPARISON A MULTIDIMENSIONAL ANALOGUE OF THE RADEMACHER-GAUSSIAN TAIL COMPARISON PIOTR NAYAR AND TOMASZ TKOCZ Abstract We prove a menson-free tal comparson between the Euclean norms of sums of nepenent ranom vectors

More information

338 A^VÇÚO 1n ò Lke n Mancn (211), we make te followng assumpton to control te beavour of small jumps. Assumpton 1.1 L s symmetrc α-stable, were α (,

338 A^VÇÚO 1n ò Lke n Mancn (211), we make te followng assumpton to control te beavour of small jumps. Assumpton 1.1 L s symmetrc α-stable, were α (, A^VÇÚO 1n ò 1oÏ 215c8 Cnese Journal of Appled Probablty and Statstcs Vol.31 No.4 Aug. 215 Te Speed of Convergence of te Tresold Verson of Bpower Varaton for Semmartngales Xao Xaoyong Yn Hongwe (Department

More information

A Discrete Approach to Continuous Second-Order Boundary Value Problems via Monotone Iterative Techniques

A Discrete Approach to Continuous Second-Order Boundary Value Problems via Monotone Iterative Techniques Internatonal Journal of Dfference Equatons ISSN 0973-6069, Volume 12, Number 1, pp. 145 160 2017) ttp://campus.mst.edu/jde A Dscrete Approac to Contnuous Second-Order Boundary Value Problems va Monotone

More information

Not-for-Publication Appendix to Optimal Asymptotic Least Aquares Estimation in a Singular Set-up

Not-for-Publication Appendix to Optimal Asymptotic Least Aquares Estimation in a Singular Set-up Not-for-Publcaton Aendx to Otmal Asymtotc Least Aquares Estmaton n a Sngular Set-u Antono Dez de los Ros Bank of Canada dezbankofcanada.ca December 214 A Proof of Proostons A.1 Proof of Prooston 1 Ts roof

More information

Infinitely Split Nash Equilibrium Problems in Repeated Games

Infinitely Split Nash Equilibrium Problems in Repeated Games Infntely Splt ash Equlbrum Problems n Repeated Games Jnlu L Department of Mathematcs Shawnee State Unversty Portsmouth, Oho 4566 USA Abstract In ths paper, we ntroduce the concept of nfntely splt ash equlbrum

More information

REAL ANALYSIS I HOMEWORK 1

REAL ANALYSIS I HOMEWORK 1 REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α

More information

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space. Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

(1 ) (1 ) 0 (1 ) (1 ) 0

(1 ) (1 ) 0 (1 ) (1 ) 0 Appendx A Appendx A contans proofs for resubmsson "Contractng Informaton Securty n the Presence of Double oral Hazard" Proof of Lemma 1: Assume that, to the contrary, BS efforts are achevable under a blateral

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

Exercises of Chapter 2

Exercises of Chapter 2 Exercses of Chapter Chuang-Cheh Ln Department of Computer Scence and Informaton Engneerng, Natonal Chung Cheng Unversty, Mng-Hsung, Chay 61, Tawan. Exercse.6. Suppose that we ndependently roll two standard

More information

Implementation and Detection

Implementation and Detection 1 December 18 2014 Implementaton and Detecton Htosh Matsushma Department of Economcs Unversty of Tokyo 2 Ths paper consders mplementaton of scf: Mechansm Desgn wth Unqueness CP attempts to mplement scf

More information

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

General viscosity iterative method for a sequence of quasi-nonexpansive mappings Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,

More information

e - c o m p a n i o n

e - c o m p a n i o n OPERATIONS RESEARCH http://dxdoorg/0287/opre007ec e - c o m p a n o n ONLY AVAILABLE IN ELECTRONIC FORM 202 INFORMS Electronc Companon Generalzed Quantty Competton for Multple Products and Loss of Effcency

More information

Another converse of Jensen s inequality

Another converse of Jensen s inequality Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout

More information

Pricing and Resource Allocation Game Theoretic Models

Pricing and Resource Allocation Game Theoretic Models Prcng and Resource Allocaton Game Theoretc Models Zhy Huang Changbn Lu Q Zhang Computer and Informaton Scence December 8, 2009 Z. Huang, C. Lu, and Q. Zhang (CIS) Game Theoretc Models December 8, 2009

More information

CS294 Topics in Algorithmic Game Theory October 11, Lecture 7

CS294 Topics in Algorithmic Game Theory October 11, Lecture 7 CS294 Topcs n Algorthmc Game Theory October 11, 2011 Lecture 7 Lecturer: Chrstos Papadmtrou Scrbe: Wald Krchene, Vjay Kamble 1 Exchange economy We consder an exchange market wth m agents and n goods. Agent

More information

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

Online Appendix for Supporting New Product or Service Introductions: Location, Marketing, and Word of Mouth

Online Appendix for Supporting New Product or Service Introductions: Location, Marketing, and Word of Mouth Onlne Appendx for Supportng New Product or Servce Introductons: Locaton, Maretng, and Word of Mouth Vahdeh Sadat Abed, Oded Berman, mtry Krass A1 - Customer Purchase Process; Faclty Choce & Assgnment Compatblty

More information

CS286r Assign One. Answer Key

CS286r Assign One. Answer Key CS286r Assgn One Answer Key 1 Game theory 1.1 1.1.1 Let off-equlbrum strateges also be that people contnue to play n Nash equlbrum. Devatng from any Nash equlbrum s a weakly domnated strategy. That s,

More information

A SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION. Contents

A SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION. Contents A SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION BOTAO WU Abstract. In ths paper, we attempt to answer the followng questons about dfferental games: 1) when does a two-player,

More information

Large-Scale Data-Dependent Kernel Approximation Appendix

Large-Scale Data-Dependent Kernel Approximation Appendix Large-Scale Data-Depenent Kernel Approxmaton Appenx Ths appenx presents the atonal etal an proofs assocate wth the man paper [1]. 1 Introucton Let k : R p R p R be a postve efnte translaton nvarant functon

More information

Exam 1 Solutions. x(x 2) (x + 1)(x 2) = x

Exam 1 Solutions. x(x 2) (x + 1)(x 2) = x Eam Solutions Question (0%) Consider f() = 2 2 2 2. (a) By calculating relevant its, determine te equations of all vertical asymptotes of te grap of f(). If tere are none, say so. f() = ( 2) ( + )( 2)

More information

Hidden Markov Models

Hidden Markov Models Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,

More information

Math 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions

Math 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,

More information

The EM Algorithm (Dempster, Laird, Rubin 1977) The missing data or incomplete data setting: ODL(φ;Y ) = [Y;φ] = [Y X,φ][X φ] = X

The EM Algorithm (Dempster, Laird, Rubin 1977) The missing data or incomplete data setting: ODL(φ;Y ) = [Y;φ] = [Y X,φ][X φ] = X The EM Algorthm (Dempster, Lard, Rubn 1977 The mssng data or ncomplete data settng: An Observed Data Lkelhood (ODL that s a mxture or ntegral of Complete Data Lkelhoods (CDL. (1a ODL(;Y = [Y;] = [Y,][

More information

CSCE 790S Background Results

CSCE 790S Background Results CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each

More information

Modelli Clamfim Equazioni differenziali 22 settembre 2016

Modelli Clamfim Equazioni differenziali 22 settembre 2016 CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 22 settembre 2016 professor Danele Rtell danele.rtell@unbo.t 1/22? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp

More information

Digital Signal Processing

Digital Signal Processing Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over

More information

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities Supplementary materal: Margn based PU Learnng We gve the complete proofs of Theorem and n Secton We frst ntroduce the well-known concentraton nequalty, so the covarance estmator can be bounded Then we

More information

Lecture XVII. Abstract We introduce the concept of directional derivative of a scalar function and discuss its relation with the gradient operator.

Lecture XVII. Abstract We introduce the concept of directional derivative of a scalar function and discuss its relation with the gradient operator. Lecture XVII Abstract We introduce te concept of directional derivative of a scalar function and discuss its relation wit te gradient operator. Directional derivative and gradient Te directional derivative

More information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

Y. Guo. A. Liu, T. Liu, Q. Ma UDC

Y. Guo. A. Liu, T. Liu, Q. Ma UDC UDC 517. 9 OSCILLATION OF A CLASS OF NONLINEAR PARTIAL DIFFERENCE EQUATIONS WITH CONTINUOUS VARIABLES* ОСЦИЛЯЦIЯ КЛАСУ НЕЛIНIЙНИХ ЧАСТКОВО РIЗНИЦЕВИХ РIВНЯНЬ З НЕПЕРЕРВНИМИ ЗМIННИМИ Y. Guo Graduate School

More information

3.2. Cournot Model Cournot Model

3.2. Cournot Model Cournot Model Matlde Machado Assumptons: All frms produce an homogenous product The market prce s therefore the result of the total supply (same prce for all frms) Frms decde smultaneously how much to produce Quantty

More information

1 Matrix representations of canonical matrices

1 Matrix representations of canonical matrices 1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:

More information

Explicit bounds for the return probability of simple random walk

Explicit bounds for the return probability of simple random walk Explct bouns for the return probablty of smple ranom walk The runnng hea shoul be the same as the ttle.) Karen Ball Jacob Sterbenz Contact nformaton: Karen Ball IMA Unversty of Mnnesota 4 Ln Hall, 7 Church

More information

Perfect Competition and the Nash Bargaining Solution

Perfect Competition and the Nash Bargaining Solution Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange

More information

Some modelling aspects for the Matlab implementation of MMA

Some modelling aspects for the Matlab implementation of MMA Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton

More information

Math Spring 2013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, (1/z) 2 (1/z 1) 2 = lim

Math Spring 2013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, (1/z) 2 (1/z 1) 2 = lim Mat 311 - Spring 013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, 013 Question 1. [p 56, #10 (a)] 4z Use te teorem of Sec. 17 to sow tat z (z 1) = 4. We ave z 4z (z 1) = z 0 4 (1/z) (1/z

More information

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium? APPLIED WELFARE ECONOMICS AND POLICY ANALYSIS Welfare Propertes of General Equlbrum What can be sad about optmalty propertes of resource allocaton mpled by general equlbrum? Any crteron used to compare

More information

SELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table:

SELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table: SELECTED PROOFS DeMorgan s formulas: The frst one s clear from Venn dagram, or the followng truth table: A B A B A B Ā B Ā B T T T F F F F T F T F F T F F T T F T F F F F F T T T T The second one can be

More information

Lecture 3: Probability Distributions

Lecture 3: Probability Distributions Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the

More information

Supplement to Clustering with Statistical Error Control

Supplement to Clustering with Statistical Error Control Supplement to Clusterng wth Statstcal Error Control Mchael Vogt Unversty of Bonn Matthas Schmd Unversty of Bonn In ths supplement, we provde the proofs that are omtted n the paper. In partcular, we derve

More information

p(z) = 1 a e z/a 1(z 0) yi a i x (1/a) exp y i a i x a i=1 n i=1 (y i a i x) inf 1 (y Ax) inf Ax y (1 ν) y if A (1 ν) = 0 otherwise

p(z) = 1 a e z/a 1(z 0) yi a i x (1/a) exp y i a i x a i=1 n i=1 (y i a i x) inf 1 (y Ax) inf Ax y (1 ν) y if A (1 ν) = 0 otherwise Dustn Lennon Math 582 Convex Optmzaton Problems from Boy, Chapter 7 Problem 7.1 Solve the MLE problem when the nose s exponentally strbute wth ensty p(z = 1 a e z/a 1(z 0 The MLE s gven by the followng:

More information

Affine and Riemannian Connections

Affine and Riemannian Connections Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons

More information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

Adaptive Kernel Estimation of the Conditional Quantiles

Adaptive Kernel Estimation of the Conditional Quantiles Internatonal Journal of Statstcs and Probablty; Vol. 5, No. ; 206 ISSN 927-7032 E-ISSN 927-7040 Publsed by Canadan Center of Scence and Educaton Adaptve Kernel Estmaton of te Condtonal Quantles Rad B.

More information

Matrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD

Matrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Chapter 7 Channel Capacity and Coding

Chapter 7 Channel Capacity and Coding Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

More information

University of California, Davis Date: June 22, 2009 Department of Agricultural and Resource Economics. PRELIMINARY EXAMINATION FOR THE Ph.D.

University of California, Davis Date: June 22, 2009 Department of Agricultural and Resource Economics. PRELIMINARY EXAMINATION FOR THE Ph.D. Unversty of Calforna, Davs Date: June 22, 29 Department of Agrcultural and Resource Economcs Department of Economcs Tme: 5 hours Mcroeconomcs Readng Tme: 2 mnutes PRELIMIARY EXAMIATIO FOR THE Ph.D. DEGREE

More information

MATH1151 Calculus Test S1 v2a

MATH1151 Calculus Test S1 v2a MATH5 Calculus Test 8 S va January 8, 5 Tese solutions were written and typed up by Brendan Trin Please be etical wit tis resource It is for te use of MatSOC members, so do not repost it on oter forums

More information

ECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006)

ECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006) ECE 534: Elements of Informaton Theory Solutons to Mdterm Eam (Sprng 6) Problem [ pts.] A dscrete memoryless source has an alphabet of three letters,, =,, 3, wth probabltes.4,.4, and., respectvely. (a)

More information

THE CARTIER ISOMORPHISM. These are the detailed notes for a talk I gave at the Kleine AG 1 in April Frobenius

THE CARTIER ISOMORPHISM. These are the detailed notes for a talk I gave at the Kleine AG 1 in April Frobenius THE CARTIER ISOMORPHISM LARS KINDLER Tese are te detaled notes for a talk I gave at te Klene AG 1 n Aprl 2010. 1. Frobenus Defnton 1.1. Let f : S be a morpsm of scemes and p a prme. We say tat S s of caracterstc

More information

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1 C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned

More information

The Finite Element Method: A Short Introduction

The Finite Element Method: A Short Introduction Te Fnte Element Metod: A Sort ntroducton Wat s FEM? Te Fnte Element Metod (FEM) ntroduced by engneers n late 50 s and 60 s s a numercal tecnque for solvng problems wc are descrbed by Ordnary Dfferental

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

Introduction. - The Second Lyapunov Method. - The First Lyapunov Method

Introduction. - The Second Lyapunov Method. - The First Lyapunov Method Stablty Analyss A. Khak Sedgh Control Systems Group Faculty of Electrcal and Computer Engneerng K. N. Toos Unversty of Technology February 2009 1 Introducton Stablty s the most promnent characterstc of

More information

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Solutions to exam in SF1811 Optimization, Jan 14, 2015 Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable

More information