e - c o m p a n i o n

Similar documents
The Order Relation and Trace Inequalities for. Hermitian Operators

MMA and GCMMA two methods for nonlinear optimization

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

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

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

The lower and upper bounds on Perron root of nonnegative irreducible matrices

Solutions to exam in SF1811 Optimization, Jan 14, 2015

APPENDIX A Some Linear Algebra

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

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

A FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX

MATH Homework #2

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Eigenvalues of Random Graphs

First day August 1, Problems and Solutions

COS 521: Advanced Algorithms Game Theory and Linear Programming

Quantum Mechanics for Scientists and Engineers. David Miller

Some modelling aspects for the Matlab implementation of MMA

763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Convexity preserving interpolation by splines of arbitrary degree

2.3 Nilpotent endomorphisms

Singular Value Decomposition: Theory and Applications

Mixed Taxation and Production Efficiency

The Second Anti-Mathima on Game Theory

Lecture 6/7 (February 10/12, 2014) DIRAC EQUATION. The non-relativistic Schrödinger equation was obtained by noting that the Hamiltonian 2

3.2. Cournot Model Cournot Model

Linear Approximation with Regularization and Moving Least Squares

LECTURE 9 CANONICAL CORRELATION ANALYSIS

However, since P is a symmetric idempotent matrix, of P are either 0 or 1 [Eigen-values

Perfect Competition and the Nash Bargaining Solution

The Expectation-Maximization Algorithm

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

The Prncpal Component Transform The Prncpal Component Transform s also called Karhunen-Loeve Transform (KLT, Hotellng Transform, oregenvector Transfor

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

CSCE 790S Background Results

Hila Etzion. Min-Seok Pang

Linear Algebra and its Applications

The Minimum Universal Cost Flow in an Infeasible Flow Network

6.854J / J Advanced Algorithms Fall 2008

Chat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

PHYS 705: Classical Mechanics. Canonical Transformation II

Norm Bounds for a Transformed Activity Level. Vector in Sraffian Systems: A Dual Exercise

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

Randić Energy and Randić Estrada Index of a Graph

ψ = i c i u i c i a i b i u i = i b 0 0 b 0 0

Vapnik-Chervonenkis theory

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

NOTES ON SIMPLIFICATION OF MATRICES

ρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

Complete subgraphs in multipartite graphs

The internal structure of natural numbers and one method for the definition of large prime numbers

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities

The Geometry of Logit and Probit

Price competition with capacity constraints. Consumers are rationed at the low-price firm. But who are the rationed ones?

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

On the correction of the h-index for career length

By Samuel Schechter. (1) H = i-î -1 with 1 ^ i,j g n. [a, b,j

Math 217 Fall 2013 Homework 2 Solutions

Estimation: Part 2. Chapter GREG estimation

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

Problem Set 9 Solutions

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

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

Vector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13

Quantum Mechanics I - Session 4

SL n (F ) Equals its Own Derived Group

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

Edge Isoperimetric Inequalities

On the Multicriteria Integer Network Flow Problem

Effects of Ignoring Correlations When Computing Sample Chi-Square. John W. Fowler February 26, 2012

THE Hadamard product of two nonnegative matrices and

PHYS 215C: Quantum Mechanics (Spring 2017) Problem Set 3 Solutions

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES

On the symmetric character of the thermal conductivity tensor

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

Foundations of Arithmetic

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

PHYS 705: Classical Mechanics. Calculus of Variations II

PROBLEM SET 7 GENERAL EQUILIBRIUM

The exam is closed book, closed notes except your one-page cheat sheet.

A Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function

1 GSW Iterative Techniques for y = Ax

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper

Transcription:

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 by Jonathan Kluberg and Georga Peraks, Operatons Research, http://dxdoorg/0287/opre007

Appendx A Proof of Lemma Lemma In a market wth dfferentated substtute products, a sngle product per frm and separate capacty constrants for each product, colludng frms always sell less quantty of each product than f they compete freely: Proof To prove ths lemma we frst formulate the olgopoly problem OP under capacty constrants It can be wrtten as: max d d st { p B d 0 d C d where B denotes the row of matrx B correspondng to frm } Usng notaton Γ = dagb, the correspondng OP KKT condtons are: λ OP C = 0 p B Γ λ OP + µ OP = 0 λ OP 0 C d µ OP = 0 µ OP 0 0 Smlarly, we wrte down the monopoly problem MP under capacty constrants max d st d { p B d} 0 d C d The correspondng MP KKT condtons are: λ MP T C = 0 p 2B λ MP + µ MP = 0 λ MP 0 C d µ MP T = 0 µ MP 0 0 Step : We wll prove that µ OP = 0 Let us consder the problem that gnores the constrant 0 Ths suggests we gnore µ OP and the KKT condtons of problem OP become: p B + Γ λ OP = 0 or = B + Γ p λ OP

wth B + Γ beng an nverse M-Matrx see [] There are two cases to dstngush Ether λ OP > 0, n whch case: = C > 0 Or λ OP = 0, = B + Γ p λ OP = + }{{} p λ OP p p n λ OP n B + Γ B d = I + MΓ + p d > 0 Snce M s an M-matrx, so s I +MΓ see [] Hence I +MΓ has non-negatve elements, and the last nequalty follows from d > 0 Hence, t s always the case that that 0 As a result, µ OP = 0 0 even wthout ncludng ths constrant e the constrant Step 2: Smlarly, we now show that µ MP = 0 Followng a smlar thought process as before, we frst consder the problem that gnores µ MP s, gnores the constrant 0 Then the KKT condtons of problem MP become: that p 2B λ MP = 0 or = /2 M p λ MP Ether λ MP > 0, n whch case: = C > 0 Or λ MP = 0, = /2 M p λ MP = + }{{} p λ MP p p n λ MP n /2 M p /2 d > 0 Step 3: Characterzaton of Let K = {Set of actve constrants for the olgopoly problem} = { =,, n, λ OP > 0} We denote by K c the complement set of K and by H AB and u A the restrctons of matrx H and

vector u to rows ndexed by A and columns ndexed by B Snce K s the set of actve capacty d OP constrants for problem OP, K ck = = K c K c Snce µ OP = 0, the olgopoly KKT condtons become: p B + Γ λ OP = 0 Restrctng attenton to the set K c n off-dagonal block matrces: of nactve constrants λop K c = 0 and notng that Γ dsappears p K c B K c K c K B + Γ K c K c dop K c = 0 Usng the relaton p K c = B K c d, we get: B + Γ K c K c dop K c = B K c K d K + B K c K c B + Γ K c K c dop K c = B K c K d K c K + B K c K c d K c B K c K c K d K c 2 Clearly, on K we have: K = c K K Hence, to prove the lemma above, we only need to show: K c dmp K c Step 4: Characterzaton of Let K 2 = {Set of actve constrants for the monopoly problem} = { =,, n, λ MP > 0} We denote by K2 c the complement set of K 2 Snce K 2 s the set of actve capacty constrants for problem MP, = ck2 K c 2 Snce µ MP = 0, the monopoly KKT condtons become: p 2 B λ MP = 0 Restrctng attenton to the set K c 2 of nactve constrants λmp K c 2 = 0: p K c 2 2 B K c 2 = 0 3 Wthout loss of generalty, we now assume K 2 K and hence K2 c Kc If there were constrants n K 2 \ K, we smply remove them We show that wthout these constrants K c whch proves that capacty constrants cannot be actve on K c dop K c as they are not actve on dop K c

Restrctng further 3 to K c Kc 2 and splttng varables accordng to K K c, we get: ck2 p K c 2 B K c K Usng the relaton p K c = B K c d, we get: K \K 2 2 B K c K c dmp K c = B K c K d K + B K c K c 2 B K c K c dmp K c = B K c K 2 B K c K c d K 2 c K 2 2 K \K 2 dmp K c = 0 d K c 2 B K c K + B K c K c ck2 K \K 2 d K c 4 Step 5: As shown n, for all K c 2, dmp /2 d In partcurlar: 2 K \K 2 d K \K 2 c K \K 2 5 2 K c d K c 6 On the other hand, combnng 2 and 4, we have: B + Γ K c K c dop K c B K c K d K c K = 2 B K c K c B + Γ K c K c dop K c = 2 B K c K c dmp K c + B K c K B + Γ K c K c dop K c 2 B K c K c dmp K c B K ck d K 2 c K 2 2 2 ck2 c K2 2 K \K 2 c K \K 2 dmp K c 0 usng 5 K \K 2 7 Fnally, let s assume there exst K c K c, let s expand the -th row of 7: such that dop < Denotng {s,, s f } the ndces of b s 0 b sf K c }{{} d K c + 2 b OP d }{{} < b s 0 b sf 2 K c }{{} d K c + 2 b usng 6 Snce all the coeffcents b are non-negatve, ths s a contradcton We ust showed that K c dop K c, leadng to dmp

B Proof of Step for Theorem 3 Ignorng µ SP, the KKT condtons of problem SP become: p B d SP λ SP = 0 or d SP = M p λ SP Ether λ SP > 0, n whch case: d SP = C > 0 Or λ SP = 0, d SP = M p λ SP = + }{{} d SP d > 0 p λ SP p p n λ SP n M p C Calculatons for Theorem 4 In the unform case, matrx M can be wrtten as: α α α M = = + αi αh α α α + α nα 0 0 0 + α = 0 0 0 + α T Invertng M, we get matrx B: B = = = + α I α + α H [ I + + α + α [ I + α + α + α α + α nα H ] + α n + H ] Ths allows us to compute: Γ = dagb = + 2 α nα + α + α nα I

On the other hand, dagonalzng B as we dd wth M: +α nα 0 0 0 +α B = 0 0 0 +α We are now able to compute the dverse component of the surplus rato 2+3α nα +α 0 0 2+3α 2nα 0 +α nα I + MΓ = 0 2+3α 2nα 0 0 +α nα I + MΓ = T +α 2+3α nα 0 0 0 +α nα 2+3α 2nα 0 0 0 +α nα 2+3α 2nα Let s call d the vector whose components are the egenvectors of M, and [ ρ, ρ 2 ] the two egenvalues of: I + ΓM Γ I + MΓ ρ = +α+2α nα 2+3α nα 2 +α nα ρ 2 = +α nα+2α nα 2+3α 2nα 2 +α The rato of profts becomes: D Proof of Lemma ΠOP ΠMP = 4 ρ d 2 + ρ n 2 d =2 2 d +α nα 2 + n d +α =2 2 Lemma For a symmetrc nverse M-matrx B and a vector d wth all component postve, the followng nequalty holds: where r s the market power d 2 B + r nm d 2 B Bdag Proof Snce B s an nverse M-matrx, Ostrowsk shows n [3] that: T T B kl r kl B and B kl = B kl r Bkl kl

Introducng r = max kl r kl, we have: B kl r B Bkl kl Hence, we can wrte: d 2 B dt = d T r B r B Bkl B Bkl kl kl Bnm nm rb r r B Bkl kl rbnm nm B Bkl kl d d + dt rb 0 We denote the dagonal matrx correspondng to the dagonal of matrx B by: Γ = dagb,, B nm nm We obtan: d 2 B r d T Γ Snce H = Γ d + r d T Γd 0 rb nm nm d has two egenvalues 0 and nm, we have dt Hd nm d 2 for all d d 2 B r nm d T Γd + r d T Γd + r nm d 2 B Bdag E Dervaton of olgopoly varatonal nequalty At a Nash equlbrum soluton, the optmzaton problem facng a sngle frm s: B max d p d d B m 8 st d K

Ths problem s a maxmzaton of a concave obectve functon over a convex set, t s a convex problem A general convex problem of the form: max x st F x x K wth a concave obectve F x s equvalent see [2], [4] to the varatonal nequalty problem: Fnd x 0 K : F x 0 x x 0 0 x K Applyng ths to 8, we obtan for each frm : Fnd K : { p + B + B } T d 0 d K where B denotes the rows of matrx B correspondng to frm Now, snce the constrant set of each frm s ndependent of the quanttes chosen by other frms, t s equvalent to satsfy every one of these varatonal nequalttes for frm or to satsfy the sum of these nequaltes Clearly, f satsfes all these nequaltes t satsfes the sum of the nequaltes On the other hand f satsfes the sum of the nequaltes, by choosng d = d, for all d K, t s easy to check that t wll satsfy every varatonal nequalty separately as well The sum of these nequaltes s exactly the varatonal nequalty used n ths paper: Fnd K : { p + B + B Bdag } T d d OP 0 d K References [] C R Johnson, Inverse M-Matrces, Lnear Algebra and ts Applcatons, vol 47, 95-26, 982 [2] O Mancno and G Stampaccha, Convex programmng and varatonal nequaltes, Journal of Optmzaton Theory and Applcaton, vol 9, 3-23, 972 [3] A M Ostrowsk, Note on Bounds for Determnants wth Domnant Prncpal Dagonal, Proceedngs of the Amercan Mathematcal Socety, vol 3, No, pp 26-30, 952 [4] R M Rockafellar, Convex Functons, Monotone Operators, and Varatonal Inequaltes, Theory and Applcatons of Monotone Operators, Proceedngs of the NATO Advanced Study Insttute, Vence, Italy, 968 Edzon Oders, Gubbo, Italy, 968