The Effects of Monopolistic Pricing in a Network Resource Allocation Game. Danielle Hinton 6.454: Graduate Seminar in Area 1 November 3, 2004
|
|
- Russell McCoy
- 5 years ago
- Views:
Transcription
1 The Effects of Monoolstc Prcng n a Network Resource Allocaton Game Danelle Hnton : Graduate Semnar n Area November 3, 2004 Introducton There s a recent body of lterature that seeks to quantfy the erformance degradaton of networks n the absence of centralzed control va game theoretc technques. Users are consdered as selfsh agents artcatng n a noncooeratve game who choose routes consstent wth the noton of a Nash Equlbrum. As we saw last week [Kh04], results by Johar and Tstslks have shown that equlbrum erformance degrades to ¾ of the socal otmum, whch could be acheved wth centralzed lannng [JoT03]. Other results by Roughgarden and Tardos [RoT00] show that f the latency of each edge s a lnear functon of ts congeston, the total latency of the routes chosen by selfsh network users s at most 4/3 tmes the mnmum ossble total latency. In the more general case where edge latency s assumed to be contnuous and non-decreasng n the edge congeston, they also rove that latency s no more than the total latency ncurred by otmally routng twce as much traffc. Whle the former models catures the decentralzed routng decsons of users, and the effects of those decsons on erformance; the lterature neglects that the networks are controlled by servce rovders whose obectve sn t oeratng at an effcent socal otmum, but rather s to mamze rofts. The ractcally motvated nuance ncororated n the work of D. Acemoglu and A. Ozdaglar s the consderaton of the effect of monoolstc rcng on congeston n unregulated networks. In Flow Control, Routng, and Performance from Servce Provder Vewont, the authors consder a two staged game where the sngle roft mamzng servce rovder sets rces antcatng the subsequent behavor of users, and then the users takng rces and latency as gven game selfshly to otmze ther own obectves. The authors develo results on the equlbrum behavor of such a network, characterze the equlbrum rces and develo nsghts nto why monooly rcng may mrove the erformance of the system. They also comare the erformance of the Monooly Equlbrum to the socal otmum (full nformaton and zero rces). In the summary whch follows, we frst outlne the network model n secton 2. In Secton 3, we characterze the Network Equlbrum. In Secton 4, we show the dervaton of the otmal monooly rcng scheme and elan ther effects on congeston. In Secton 5 we comare the erformance of the network under monoolzed rcng to the erformance n the centrally controlled, zero rced socal otmum. We conclude wth a summary of the key contrbutons of ths work. 2. Network and Game Theoretc Model
2 Danelle Hnton The network s modeled as havng I arallel lnks, and J users, where J >>. The followng arameters are used to descrbe the network and users: the flow of user on lnk l Γ I = = = ( ) = J the total flow rate of user on all lnks total flow on lnk l flow deendent latency functon whch secfes the delays n transmsson as a functon of the lnk load. -Contnuous and strctly ncreasng - l ( 0 ) = 0 as C Caacty constrant on the lnks u Γ : utlty functon ( ) ( ) rce of lnk The utlty functon s assumed to be strctly concave that s, that we are consderng elastc traffc (delay tolerant) where ncreased data rates has dmnshng returns for users. We also assume that the utlty functon s nondecreasng, and contnuously dfferentable whch allows the authors to characterze the equlbrum, and the equlbrum rces (shown here n sectons 3 and 4). For each user there s also an assocated ayoff functon whch deends not only on that user s own flows, but also on the flows of all the other users va the latency they all create on a gven lnk.. Each user acts as a rce taker and a lnk load taker, takng rces and lnk loads as gven and choosng flows to mamze ther ayoff functon: 3. Network Equlbrum I I v ( ; λ, ) = u l = = I ( ) To determne the equlbrum behavor f ths network, we consder the game between selfsh users who, gven rces, antcate the amount of congeston on all routes and choose ther own routes accordng to the noton of the Nash Equlbrum (NE). Recall that a Nash Equlbrum s a steady state of the lay of a strategc game n whch no layer can roftably devate gven the actons of the other layers. More formally: where a * A of actons, * * * ( a, a ) ( a, a ) a A = 2
3 Danelle Hnton No layer has an acton yeldng an outcome that he refers to that generated when he chooses a *, gven that every other layer chooses hs equlbrum * acton a. In the model descrbed above, we assumed that the users were both rce and latency takers that s, they take the latency of the lnks as gven. In the NE, users take nto account the effect of ther own flow on congeston. In the Wardro Equlbrum (WE), each user s flow s assumed to be small relatve the total flow on a gven lnk so that when that user swtches hs flow, there s no substantal change n the lnk latences (Wardro Prncle). As such, n the WE, users gnore the effects of ther own flow on congeston. Formally, the WE says that a vector r l, l =,2, KK, L s called a Wardro equlbrum f for each grou l, the followng holds: Let K l * K be the set of routes actually used, that s the set of classes such that: l l l ' l k K k K 0 such that B ( r) B ( r) k K k K : * l, k > k k ' *, So the rncles are fulflled because n ths state no grou can reduce the costs by swtchng from ts current aths to other ones connectng the same orgndestnaton ar. Followng HaM85, the authors rove that as the number of users becomes large, the NE converges to the WE (see 7-9). And so n ths work, the equlbrum of the network s characterzed n terms of the WE. For the model descrbed above, the Generalzed Wardro Equlbrum GWE -- generalzed because t s condtoned on a gven vector of rces -- s defned as the vector of flows of all the users =, K KK, J n the network such that for each : = arg ma v ( y ;, ), J 0 y C, The estence and the unqueness of the GWE s roved by consderng the otmzaton roblem: mamze u ( Γ ) l ( z) dz I 0 I subect to: Γ =, I = J 0, The rooston s roved as follows: Snce the obectve functon s contnuous and the feasble set s comact, ths roblem has an otmal soluton (estence of 3
4 Danelle Hnton the GWE). Snce u s strctly concave, and l s strctly ncreasng the obectve functon s a strctly concave functon of Γ and (unqueness of the flow rates and lnk loads at a GWE). Usng the essental unqueness of the equlbrum roved above, the authors are able to rove the contnuty and monotoncty of the flow rates and lnk loads whch are used later on n the characterzaton of monooly rces. The monotoncty results are qute ntutve. Flow rates beng monotonc n rces says essentally that when rces are hgher, users choose flow rates that are no hgher than the rates chosen at a lower rce. Smlarly, the monotoncty of lnk loads (Pro 2.4) n rces says formally lnk loads are monotoncally non-ncreasng n ther own rces, and monotoncally non-decreasng n other lnks rces. Intutvely, the monotoncty of lnk loads tells us that hgher rces reduce traffc on the lnk. And, a hgher rces for one lnk ncreases the traffc on the others (mlyng that for users, lnks are erfect substtutes). The authors go on to defne two lemmas whch wll be useful to n the later characterzaton of the GWE. The frst says that the effectve cost of all lnks wth ostve flow must be equal, suortng the ntutve noton from the monotncty of lnk loads that the lnks are erfect substtutes. The second characterzes the rce and roves the estence of a GWE and the corresondng flows at that rce vector. Lemma 2.: For a gven 0, let wth 0 : + l ( ) = mn + m I Proof: By the frst order necessary otmalty condtons, u ( Γ ( )) l ( ( )) 0 f u ( Γ ( )) l be the load of lnk at a GWE. Then for all ( ( )) = 0 m m m { l ( )} f 0 > 0 eqn 9 eqn0 so there ests some such that 0 and satsfes eqn 0. Snce eqn 9 also holds m, combnng eqn 9 and eqn 0 yelds: Lemma 2.2: For a gven 0,, then: m m m + l ( ) + l ( ) m let be a GWE. Let I = { > 0} and J = { Γ > 0} (a) For all I and J, : u ( Γ ) l ( ) = 0 (b) There ests a GWE ~ at ths rce vector that satsfes > 0 for all I and J. 4
5 Danelle Hnton Proof: s (a) Snce Γ > 0, then there ests some lnk s for whch > 0, and thus eqn m m m holds. By Lemma 2., we have that + l ( ) = + l ( ) snce > 0 s and > 0. Substtutng ths nto equaton roves art (a). (b) The estence of a GWE at ths rce vector s establshed by the argument that startng at any GWE, we can always construct an alternatve GWE wth the same ndvdual flow rates and lnk loads, n whch all ndvdual flows to all lnks wth mnmum effectve cost are ostve. As such, ths alternatve vector satsfes the frst order necessary and suffcent otmalty condtons and s thus a GWE at the rce vector. 4. Monoolstc Prcng The roft mamzng monoolsts sets rces on each lnk of the network wth the vector of rces whch solve the followng mamzaton roblem: I ma ( ) subect to: 0 The estence of ths otmal rce vector follows from the contnuty n of ( ). The vector * s termed the monooly equlbrum rce of the 2-stage game. The ar (*, *) defnes as the monooly equlbrum of the overall game. Some characterstcs of ths otmal rce vector are (roofs omtted):. > 0 otherwse, revenues would be decreased on that lnk, and reduce traffc and thus rofts on all other lnks. 2. > 0 otherwse, roft could be ncreased by addng traffc on ths lnk; and ths ncrease n rofts outweghs the decrease n rofts on the other lnks (see age 22 for the roof) To hel n the characterzaton of the equlbrum rces, establsh Lemma 4.3 whch shows the estence of an otmal soluton (, λ, Γ ) to the followng roblem where (,) s an ME: subect to ma I ' u ( Γ ) l ( ) = 0 u ( Γ ) l ( ) I = J Γ = 0 eqn I J {} 5
6 0, Γ 0 I, J Danelle Hnton Ths Lemma s roved by contradcton, and shows that the estence of some other feasble soluton wth a greater cost volates the noton of the soluton, λ, Γ ) corresondng to a ME (, ). (See ages 23-4 for the detaled roof). ( One of the key results of ths aer s the characterzaton of Equlbrum rces n Pro 4.8. We wll frst outlne the roof, then dscuss ts mlcatons. We assume that u () * s twce dfferentable for each, and l s contnuously dfferentable for each, and (, ) s an ME, and { Γ > 0} J. Then for I and, we have: = = ( l ) ( ) m m I + eqn 2 J u ( Γ ) '' The roof of ths Prooston uses Lagrange Multlers to solve equaton. From Lemma 4.3 (,, Γ ) s an otmal soluton to ths roblem. The Lagrangan functon for ths roblem assgns multlers λ I, µ J /, µ to each of the constrants resectvely: ' λ ( u ( Γ ) l ( ) ) + µ ( u ( Γ ) l ( ) ) + µ ( L(,, λ ) = I I J I J Γ ) Takng artal dervatves wth resect and λ yeld the followng equatons: = λ + eqn 3 µ J = λ eqn 4 λ l )'( ) ( u )( l )'( ) + = 0 eqn 5 ( µ J λ ( l )'( ) + u = 0 eqn 6 When combned, they reduce to : l )'( ) + µ = 0, ( I Takng the artal dervatve wth resect to Γ yelds: '' u ( Γ ) λ µ = 0 eqn 7 '' µ µ Γ ) = 0, J eqn 8 ( µ 6
7 Danelle Hnton Summng eqn 3 and eqn 4 overall, and combnng these wth eqn 8 and eqn 9 yelds: When these are substtuted n to eqn 6, we arrve at eqn 2. Equaton 2 shows that the roft mamzng rces for the monoolst conssts of two markus above the margnal cost of the monoolst (whch s zero n ths model). Its ths frst term ( l ) ( ) whch may work to mrove the allocaton of resources. Intutvely, snce the monoolst s aware that the user ayoff functon decreases wth both latency and rce, ths term can be nterreted as the monoolst s nterventon to reduce congeston. The second term n the equaton for the otmal monooly rcng s smlar to the standard marku term n the analyss of monooly rcng n ts consderaton of the elastcty of the utlty functon of users (whch can be translated nto a demand curve) 2. Ths term n standard economc analyss, s the source of neffcences, rasng cost and lowerng consumton below the socal otmum. 5 Performance of Network under Monoolzed Prcng versus Socal Otmum In the socal roblem, a network manager wth centralzed routng control and erfect knowledge of the user utlty functons and latency on the lnks would route traffc accordng to the otmal soluton of the followng roblem: ma J subect to: Γ = u ( Γ I = ) I, I, l ( ) I J 0, I, J Assumng the obectve roblem s concave, an equvalent characterzaton of the socal roblem s gven by the frst order condtons: 0 f 0 ' u ( Γ ) l ( ) ( l )'( ) = 0 f = 0 Recallng the frst order otmalty condtons n eqn 0, t can been seen that f each user s charged ( l ) ( ) n the case where routng s decentralzed, the allocaton n that GWE wll be equvalent to that of the socal roblem. The authors nterret ths as the margnal congeston cost whch s the rce charged to the users to nduce less selfsh behavor, modfyng users routng choces and flow selectons. In Economcs arlance, the margnal congeston cost encourages the users to nternalze the congeston eternaltes whch they gnore when actng In a comettve market, frms set rces to equal the margnal cost at some level of outut y. (See Varan, Chater 2). 2 See Varan C23.3 7
8 Danelle Hnton selfshly. Imlct n most economc models s the noton that agents make decsons wthout worryng about what the other agents are dong. All nteracton takes lace va the market, so that the agents only need to know the market rces and t s n ths case of the absence of eternalzes, that a gven market s caable of achevng effcent allocatons. The nternalzaton of an eternalty corresonds to some level of coordnaton whch should serve the nterests of the agents nvolved movng the market toward effcent allocatons. 3 The authors are then able to show the corresondence between user s total flow rate Γ under the three control/rcng schemes dscussed above: the monoolzed rcng scheme w/ decentralzed control, the GWE wth zero rces, and the socal otmum wth centralzed control. In Prooston 5.9, the authors rove (omtted here, see 35-8) that where corresonds to the GWE at 0 rces, ~ corresonds to the socal otmum, and denotes the ME, For all : Γ ~ Γ Γ Ths shows that when the rces are equal to 0, the users generate too much flow relatve to the socal otmum consstent wth the results from last week, and mentoned n the ntroducton. Monooly rcng mroves ths behavor, but t may ntroduce dstorton relatve to the socal otmum due to the flow control decsons of the users as a result of the monoolstc rcng. In the case of the routng roblem where the user has a fed amount of traffc to send, the authors demonstrate that ME acheves the socal otmum (see 29-33). 6. Conclusons Among the key contrbutons of ths work has been the develoment of a more realstc framework wthn whch the decentralzed routng choces of selfsh users as well as the roft mamzng rcng schemes of servce rovders can ontly be analyzed to characterze erformance of these networks, and to develo methods to mrove ther effcency. After develong that framework, Ozdaglar and Acemoglu then characterze the equlbrum behavor of such a network, and also characterze the monooly rces, and the flow rates and lnk loads whch result. In agreement wth earler results, when network equlbrum s analyzed wthout rcng, that network s roven to be neffcent relatve to the socal otmum. A key nsght develoed n ther work s that monoolstc rcng methods roduce an equlbrum that reduces flows below the socal otmum, but whch n some cases (routng roblem) may acheve an allocaton that s socally otmal. 3 See Varan (C3.5) 8
9 Danelle Hnton References [AcO03] Flow control, Routng and Performance from Servce Provder Vewont [BNO03] Bertsekas, D P, A Nedc and A E Ozdaglar, Conve Analyss and Otmzaton, Athena Scentfc: Belmont, [Ham85] Haure, A and Marcotte, P. On the relatonsh between Nash-Cournot and Wardro Equlbra, Networks, 25, , 985. [JoT03] Johar, R. and J. Tstskls, Network resource Allocaton and a congeston game: The sngle lnk case, Proceedngs of the 42 nd IEEE Conference on Decson and Control. Dec [Kh04] Khst, A. Effcency Loss n a Network Resource Allocaton Game. Summary. October 27, [OsR] Osborne, M J and A Rubnsten, A Course n Game Theory. MIT Press: Cambrdge, [Rot02] Roughgarden, T. and Tardos, E. How bad s selfsh routng? Journal of the ACM, vo 49, no. 2, , [Var93] Varan, H R. Intermedate Mcroeconomcs: A Modern Aroach. W. W. Norton & Comany: New York,
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 informationManaging Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration
Managng Caacty Through eward Programs on-lne comanon age Byung-Do Km Seoul Natonal Unversty College of Busness Admnstraton Mengze Sh Unversty of Toronto otman School of Management Toronto ON M5S E6 Canada
More information( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1
Problem Set 4 Suggested Solutons Problem (A) The market demand functon s the soluton to the followng utlty-maxmzaton roblem (UMP): The Lagrangean: ( x, x, x ) = + max U x, x, x x x x st.. x + x + x y x,
More informationSome Notes on Consumer Theory
Some Notes on Consumer Theory. Introducton In ths lecture we eamne the theory of dualty n the contet of consumer theory and ts use n the measurement of the benefts of rce and other changes. Dualty s not
More informationCompetition and Efficiency in Congested Markets
Competton and Effcency n Congested Markets Daron Acemoglu Department of Economcs Massachusetts Insttute of Technology Asuman E. Ozdaglar Department of Electrcal Engneerng and Computer Scence Massachusetts
More informationThe 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 informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More information(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 informationPerfect 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 informationPROBLEM 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 informationFuzzy approach to solve multi-objective capacitated transportation problem
Internatonal Journal of Bonformatcs Research, ISSN: 0975 087, Volume, Issue, 00, -0-4 Fuzzy aroach to solve mult-objectve caactated transortaton roblem Lohgaonkar M. H. and Bajaj V. H.* * Deartment of
More informationDOCUMENTOS DE TRABAJO Serie Economía
Nº 241 COMPETITION WITH ASYMMETRIC SWITCHING COSTS S. INFANTE - N. FIGUEROA - R. FISCHER DOCUMENTOS DE TRABAJO Sere Economía Cometton wth asymmetrc swtchng costs S. Infante N. Fgueroa U. de Chle R. Fscher
More informationSupplementary Material for Spectral Clustering based on the graph p-laplacian
Sulementary Materal for Sectral Clusterng based on the grah -Lalacan Thomas Bühler and Matthas Hen Saarland Unversty, Saarbrücken, Germany {tb,hen}@csun-sbde May 009 Corrected verson, June 00 Abstract
More informationIntroduction. 1. The Model
H23, Q5 Introducton In the feld of polluton regulaton the problems stemmng from the asymmetry of nformaton between the regulator and the pollutng frms have been thoroughly studed. The semnal works by Wetzman
More informationWelfare 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 informationMarket 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 informationCompetition in Parallel-Serial Networks
JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL XX, NO XX, MONTH 0XX Competton n Parallel-Seral Networs Daron Acemoglu and Asuman Ozdaglar, Member, IEEE Abstract We study the effcency mplcatons of competton
More informationConstant Best-Response Functions: Interpreting Cournot
Internatonal Journal of Busness and Economcs, 009, Vol. 8, No., -6 Constant Best-Response Functons: Interpretng Cournot Zvan Forshner Department of Economcs, Unversty of Hafa, Israel Oz Shy * Research
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationOnline 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 informationOn the Connectedness of the Solution Set for the Weak Vector Variational Inequality 1
Journal of Mathematcal Analyss and Alcatons 260, 15 2001 do:10.1006jmaa.2000.7389, avalable onlne at htt:.dealbrary.com on On the Connectedness of the Soluton Set for the Weak Vector Varatonal Inequalty
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationANSWERS TO EVEN NUMBERED EXERCISES IN CHAPTER 9
S TO EVEN NUMBERED EXERCISES IN CHAPTER 9 SECTION 9: SIMULTANEOUS ONE SHOT GAMES Exercse 9- Vckrey Bddng Game Bdder values an tem for sale at 7 (thousand) and bdder at 8 (thousand) Each must submt a sealed
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationPrice competition with capacity constraints. Consumers are rationed at the low-price firm. But who are the rationed ones?
Prce competton wth capacty constrants Consumers are ratoned at the low-prce frm. But who are the ratoned ones? As before: two frms; homogeneous goods. Effcent ratonng If p < p and q < D(p ), then the resdual
More information,, MRTS is the marginal rate of technical substitution
Mscellaneous Notes on roducton Economcs ompled by eter F Orazem September 9, 00 I Implcatons of conve soquants Two nput case, along an soquant 0 along an soquant Slope of the soquant,, MRTS s the margnal
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models
More informationSome 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 informationMicroeconomics I Undergraduate Programs
Game-theoretcal olgooly models Quantty multaneous equental tackelberg Fernando Branco 006-007 econd emester essons 8 and 9 Prce fferent. trategc Comlements omnant Frm tackelberg olgooly Equlbrum n the
More informationEndogenous timing in a mixed oligopoly consisting of a single public firm and foreign competitors. Abstract
Endogenous tmng n a mxed olgopoly consstng o a sngle publc rm and oregn compettors Yuanzhu Lu Chna Economcs and Management Academy, Central Unversty o Fnance and Economcs Abstract We nvestgate endogenous
More informationGames of Threats. Elon Kohlberg Abraham Neyman. Working Paper
Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017
More informationAdvanced Topics in Optimization. Piecewise Linear Approximation of a Nonlinear Function
Advanced Tocs n Otmzaton Pecewse Lnear Aroxmaton of a Nonlnear Functon Otmzaton Methods: M8L Introducton and Objectves Introducton There exsts no general algorthm for nonlnear rogrammng due to ts rregular
More information6. Hamilton s Equations
6. Hamlton s Equatons Mchael Fowler A Dynamcal System s Path n Confguraton Sace and n State Sace The story so far: For a mechancal system wth n degrees of freedom, the satal confguraton at some nstant
More informationAn application of generalized Tsalli s-havrda-charvat entropy in coding theory through a generalization of Kraft inequality
Internatonal Journal of Statstcs and Aled Mathematcs 206; (4): 0-05 ISS: 2456-452 Maths 206; (4): 0-05 206 Stats & Maths wwwmathsjournalcom Receved: 0-09-206 Acceted: 02-0-206 Maharsh Markendeshwar Unversty,
More informationFuzzy Set Approach to Solve Multi-objective Linear plus Fractional Programming Problem
Internatonal Journal of Oeratons Research Vol.8, o. 3, 5-3 () Internatonal Journal of Oeratons Research Fuzzy Set Aroach to Solve Mult-objectve Lnear lus Fractonal Programmng Problem Sanjay Jan Kalash
More informationMMA 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 informationEconomics 2450A: Public Economics Section 10: Education Policies and Simpler Theory of Capital Taxation
Economcs 2450A: Publc Economcs Secton 10: Educaton Polces and Smpler Theory of Captal Taxaton Matteo Parads November 14, 2016 In ths secton we study educaton polces n a smplfed verson of framework analyzed
More informationON THE EQUIVALENCE OF ORDINAL BAYESIAN INCENTIVE COMPATIBILITY AND DOMINANT STRATEGY INCENTIVE COMPATIBILITY FOR RANDOM RULES
ON THE EQUIVALENCE OF ORDINAL BAYESIAN INCENTIVE COMPATIBILITY AND DOMINANT STRATEGY INCENTIVE COMPATIBILITY FOR RANDOM RULES Madhuparna Karmokar 1 and Souvk Roy 1 1 Economc Research Unt, Indan Statstcal
More informationMixed Taxation and Production Efficiency
Floran Scheuer 2/23/2016 Mxed Taxaton and Producton Effcency 1 Overvew 1. Unform commodty taxaton under non-lnear ncome taxaton Atknson-Stgltz (JPubE 1976) Theorem Applcaton to captal taxaton 2. Unform
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationAn Analysis of Troubled Assets Reverse Auction
An Analyss of Troubled Assets Reverse Aucton Saeed Alae, Azarakhsh Malekan Unversty of Maryland Abstract. In ths paper we study the Nash-equlbrum and equlbrum bddng strateges of the Pooled Reverse Aucton
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationGame Theory Course: Jackson, Leyton-Brown & Shoham. Vickrey-Clarke-Groves Mechanisms: Definitions
Vckrey-Clarke-Groves Mechansms: Defntons Game Theory Course: Jackson, Leyton-Brown & Shoham A postve result Recall that n the quaslnear utlty settng, a drect mechansm conssts of a choce rule and a payment
More informationCOS 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 informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationDigital PI Controller Equations
Ver. 4, 9 th March 7 Dgtal PI Controller Equatons Probably the most common tye of controller n ndustral ower electroncs s the PI (Proortonal - Integral) controller. In feld orented motor control, PI controllers
More informationCS294 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 informationHow 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 informationSmooth Games, Price of Anarchy and Composability of Auctions - a Quick Tutorial
Smooth Games, Prce of Anarchy and Composablty of Auctons - a Quck Tutoral Abhshek Snha Laboratory for Informaton and Decson Systems, Massachusetts Insttute of Technology, Cambrdge, MA 02139 Emal: snhaa@mt.edu
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informatione - 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 informationThe Robustness of a Nash Equilibrium Simulation Model
8th World IMACS / MODSIM Congress, Carns, Australa 3-7 July 2009 htt://mssanz.org.au/modsm09 The Robustness of a Nash Equlbrum Smulaton Model Etaro Ayosh, Atsush Mak 2 and Takash Okamoto 3 Faculty of Scence
More informationUniqueness of Nash Equilibrium in Private Provision of Public Goods: Extension. Nobuo Akai *
Unqueness of Nash Equlbrum n Prvate Provson of Publc Goods: Extenson Nobuo Aka * nsttute of Economc Research Kobe Unversty of Commerce Abstract Ths note proves unqueness of Nash equlbrum n prvate provson
More informationSuggested solutions for the exam in SF2863 Systems Engineering. June 12,
Suggested solutons for the exam n SF2863 Systems Engneerng. June 12, 2012 14.00 19.00 Examner: Per Enqvst, phone: 790 62 98 1. We can thnk of the farm as a Jackson network. The strawberry feld s modelled
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationprinceton 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 informationQuantity Precommitment and Cournot and Bertrand Models with Complementary Goods
Quantty Precommtment and Cournot and Bertrand Models wth Complementary Goods Kazuhro Ohnsh 1 Insttute for Basc Economc Scence, Osaka, Japan Abstract Ths paper nestgates Cournot and Bertrand duopoly models
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationLecture 14: Bandits with Budget Constraints
IEOR 8100-001: Learnng and Optmzaton for Sequental Decson Makng 03/07/16 Lecture 14: andts wth udget Constrants Instructor: Shpra Agrawal Scrbed by: Zhpeng Lu 1 Problem defnton In the regular Mult-armed
More informationA 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 informationSupporting Materials for: Two Monetary Models with Alternating Markets
Supportng Materals for: Two Monetary Models wth Alternatng Markets Gabrele Camera Chapman Unversty Unversty of Basel YL Chen Federal Reserve Bank of St. Lous 1 Optmal choces n the CIA model On date t,
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationAbstract Single Crossing and the Value Dimension
Abstract Sngle Crossng and the Value Dmenson Davd Rahman September 24, 2007 Abstract When auctonng an ndvsble good wthout consumpton externaltes, abstract sngle crossng s necessary and suffcent to mplement
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationHila 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 informationLecture 7: Boltzmann distribution & Thermodynamics of mixing
Prof. Tbbtt Lecture 7 etworks & Gels Lecture 7: Boltzmann dstrbuton & Thermodynamcs of mxng 1 Suggested readng Prof. Mark W. Tbbtt ETH Zürch 13 März 018 Molecular Drvng Forces Dll and Bromberg: Chapters
More informationIn the figure below, the point d indicates the location of the consumer that is under competition. Transportation costs are given by td.
UC Berkeley Economcs 11 Sprng 006 Prof. Joseph Farrell / GSI: Jenny Shanefelter Problem Set # - Suggested Solutons. 1.. In ths problem, we are extendng the usual Hotellng lne so that now t runs from [-a,
More informationPhysics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1
P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the
More informationOnline Appendix: Reciprocity with Many Goods
T D T A : O A Kyle Bagwell Stanford Unversty and NBER Robert W. Stager Dartmouth College and NBER March 2016 Abstract Ths onlne Appendx extends to a many-good settng the man features of recprocty emphaszed
More informationVolume 29, Issue 4. Incomplete third-degree price discrimination, and market partition problem. Yann Braouezec ESILV
Volume 29, Issue 4 Incomplete thrd-degree prce dscrmnaton, and market partton problem Yann Braouezec ESILV Abstract We ntroduce n ths paper the "ncomplete" thrd-degree prce dscrmnaton, whch s the stuaton
More informationf(x,y) = (4(x 2 4)x,2y) = 0 H(x,y) =
Problem Set 3: Unconstraned mzaton n R N. () Fnd all crtcal ponts of f(x,y) (x 4) +y and show whch are ma and whch are mnma. () Fnd all crtcal ponts of f(x,y) (y x ) x and show whch are ma and whch are
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationA Cournot-Stackelberg Advertising Duopoly Derived From A Cobb-Douglas Utility Function
MDEF Workshop 01, Urbno, 0- September A Cournot-Stackelberg Advertsng Duopoly Derved From A Cobb-Douglas Utlty Functon Alna Ghrvu * and Tönu Puu** *Faculty of Economc Studes and Busness Admnstraton, Babeş-
More informationEfficiency Loss and Uniform-Price Mechanism
Proceedngs of the 47th IEEE Conference on Decson and Control Cancun, Mexco, Dec. 9-11, 28 Effcency Loss and Unform-Prce Mechansm Mchał Karpowcz*,** M.Karpowcz@elka.pw.edu.pl Krzysztof Malnowsk*,** Krzysztof.Malnowsk@nask.pl
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationWhich Separator? Spring 1
Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal
More informationCopyright (C) 2008 David K. Levine This document is an open textbook; you can redistribute it and/or modify it under the terms of the Creative
Copyrght (C) 008 Davd K. Levne Ths document s an open textbook; you can redstrbute t and/or modfy t under the terms of the Creatve Commons Attrbuton Lcense. Compettve Equlbrum wth Pure Exchange n traders
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationMaximal Margin Classifier
CS81B/Stat41B: Advanced Topcs n Learnng & Decson Makng Mamal Margn Classfer Lecturer: Mchael Jordan Scrbes: Jana van Greunen Corrected verson - /1/004 1 References/Recommended Readng 1.1 Webstes www.kernel-machnes.org
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More information12. The Hamilton-Jacobi Equation Michael Fowler
1. The Hamlton-Jacob Equaton Mchael Fowler Back to Confguraton Space We ve establshed that the acton, regarded as a functon of ts coordnate endponts and tme, satsfes ( ) ( ) S q, t / t+ H qpt,, = 0, and
More informationQuality of Routing Congestion Games in Wireless Sensor Networks
Qualty of Routng ongeston Gaes n Wreless Sensor Networs ostas Busch Lousana State Unversty Rajgoal Kannan Lousana State Unversty Athanasos Vaslaos Unv. of Western Macedona 1 Outlne of Tal Introducton Prce
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationCan the Market be Fixed? (II) Does the Market Need Fixing? The Beneficent Effects of Assigning Property Rights. The Coase Theorem
Eternaltes An eternalt occurs whenever the actvtes of one economc agent affect the actvtes of another agent n was that are not taken nto account b the operaton of the market. Eamples: One frm produces
More informationLet p z be the price of z and p 1 and p 2 be the prices of the goods making up y. In general there is no problem in grouping goods.
Economcs 90 Prce Theory ON THE QUESTION OF SEPARABILITY What we would lke to be able to do s estmate demand curves by segmentng consumers purchases nto groups. In one applcaton, we aggregate purchases
More informationStudy on Demand Response of Residential Power Customer
Journal of Power and Energy Engneerng 06 4-7 Publshed Onlne July 06 n ScRes. htt://www.scr.org/journal/jee htt://dx.do.org/0.46/jee.06.4700 Study on Demand Resonse of Resdental Power Customer Xu Cao Hayong
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationThe Small Noise Arbitrage Pricing Theory
The Small Nose Arbtrage Prcng Theory S. Satchell Trnty College Unversty of Cambrdge and School of Fnance and Economcs Unversty of Technology, Sydney December 998 Ths aer was wrtten when the Author was
More informationA NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegian Business School 2011
A NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegan Busness School 2011 Functons featurng constant elastcty of substtuton CES are wdely used n appled economcs and fnance. In ths note, I do two thngs. Frst,
More informationGames and Market Imperfections
Games and Market Imperfectons Q: The mxed complementarty (MCP) framework s effectve for modelng perfect markets, but can t handle mperfect markets? A: At least part of the tme A partcular type of game/market
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More information1 The Sidrauski model
The Sdrausk model There are many ways to brng money nto the macroeconomc debate. Among the fundamental ssues n economcs the treatment of money s probably the LESS satsfactory and there s very lttle agreement
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationAPPENDIX 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 informationDistributed Mechanism Design for Unicast Transmission
Dstrbuted Mechansm Desgn for Uncast Transmsson Nasmeh Heydarben Department of Electrcal and Computer Engneerng Unversty of Mchgan, Ann Arbor, MI, USA heydar@umch.edu Achlleas Anastasopoulos Department
More informationComparing two Quantiles: the Burr Type X and Weibull Cases
IOSR Journal of Mathematcs (IOSR-JM) e-issn: 78-578, -ISSN: 39-765X. Volume, Issue 5 Ver. VII (Se. - Oct.06), PP 8-40 www.osrjournals.org Comarng two Quantles: the Burr Tye X and Webull Cases Mohammed
More informationThe Bellman Equation
The Bellman Eqaton Reza Shadmehr In ths docment I wll rovde an elanaton of the Bellman eqaton, whch s a method for otmzng a cost fncton and arrvng at a control olcy.. Eamle of a game Sose that or states
More informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
More informationSupporting Information for: Two Monetary Models with Alternating Markets
Supportng Informaton for: Two Monetary Models wth Alternatng Markets Gabrele Camera Chapman Unversty & Unversty of Basel YL Chen St. Lous Fed November 2015 1 Optmal choces n the CIA model On date t, gven
More information