Problem Set #2 Solutions
|
|
- Sophie Owens
- 5 years ago
- Views:
Transcription
1 4.0 Sprng 003 Page Proble Set # Solutons Proble : a) A onopolst solves the followng proble: ( Q ) Q C ( )= 00Q Q 0Q ax P Q wth frst-order condton (FOC) b) Gven the results fro part a, Q 90 Q = 0 Q P = 55 π = 4050 * = 45 * P = P = 55 * π = 05 On the other hand, a Cournot copettor, as n the punshent phases, solves the followng proble: ax 00 ( + j ) 0 wth FOC 90 j = 0 whch ples the followng best response functon: j C Due to syetry, we know that C = j ; hence, C C = j = 60 P C = 40 C π = 800 Last, suppose I decde to cheat; what uantty do I produce? I should produce the best response to what the other fr (who s not cheatng) s producng. Reeber, as long as I a cheatng, I ght as well cheat as well as possble. Hence, f I cheat, or devate fro the proposed eulbru, I should d ( 45)= P d = d π = 78.5 If I play along wth the cooperatve strategy, the PDV of y proft strea s
2 4.0 Sprng 003 Proble Set Solutons Page But, f I devate, the PDV s ( + δ + δ +...) = δ ( δ + δ +...) = δ δ The cooperatve strategy s an eulbru f δ δ δ δ ( δ ) = δ 478.5δ δ c) th a perod detecton lag, the devator can cheat for two perods. If I devate, the PDV s 3 800δ δ + 800(δ + δ +...) = 78.5( + δ ) + δ The cooperatve strategy s an eulbru f δ 78.5( + δ ) + δ δ δ )+ 800δ ( = δ δ δ d) Frs copetng n prce n a hoogeneous goods arket ths s a Bertrand gae. Frs bd the prce down to argnal cost. Hence, the only eulbru s for both frs to charge a prce eual to the argnal cost of 0. The total arket uantty s 80. e) hen both frs cooperate by settng prce to be the onopoly prce P = 55, each fr akes a proft of 05 n each perod (See Part a). In the punshent phases, frs are Bertrand copettors and ake zero proft. hat about when one fr cheats? A fr s optal cheatng strategy s to set prce eual to P ε,.e., just undercut the other fr and capture the whole arket. In ths way, the cheatng fr essentally acts as the sole onopolst and akes the entre onopoly proft of The cooperatve strategy s an eulbru f
3 4.0 Sprng 003 Proble Set Solutons Page δ δ δ Prce copetton s ore lkely to sustan a onopoly outcoe because, due to the ferce copetton nspred by prce copetton, the punshent s uch harsher. f) Frs are capacty constraned no one can produce the full arket deand at a prce eual to the argnal cost. Frs keep undercuttng the rval s prce down to argnal cost, at whch pont no fr akes proft and can beneft fro rasng ts prce. Snce nether fr can eet the full arket deand, soe consuers are forced to ether not buy or buy fro the other fr. Frs then begn agan to undercut each other back down n prce. In ths way, prces cycle up and down. Ths phenoenon, known as Edgeworth cycles, actually happens. Proble : a) The jont proft-axzaton outcoe s the sae as n part a of Proble. In the cartel, the total producton uota, allotted soehow aong the fve frs, ust be Q = Q The cartel can actually allocate the 90 unts any way t wants; evenly dvdng t aong the fve frs sees lkely. The prce s the onopoly prce of 55; profts are dstrbuted aong the fve frs n the sae way that the uanttes are. b) In the fve fr cartel, each fr akes proft 80 (=4050/5). Suppose one fr decdes not to enter nto the cartel. Let Q 4 be the total uantty produced by the four frs n the cartel. Then the non-cartel fr solves the followng proble: ax 00 ( Q 4 + ) 0 wth FOC 90 Q 4 = 0 Q 4 Knowng the non-cartel fr wll behave n ths way, the cartel axzes ts jont proft as follows: ax 00 Q 4 Q Q 4 Q 4 0Q 4 = 90 The FOC s 90 Q 4 = 0 Hence, the eulbru s Q 4 Q Q 4 4
4 4.0 Sprng 003 Proble Set Solutons Page 4 Q 4 = 45 P = 3. 5 It thus pays not to enter the cartel. non cartel π = ( P 0) = 0. 5 c) Suppose there are n frs. Let us check f an n-fr cartel s stable; does a fr have ncentve not to enter. Frs n the n-fr cartel ake proft 4050/n. Usng reasonng analogous to part b, a non-cartel fr solves the followng proble: ax 00 ( Q n + ) 0 wth FOC 90 Q n = 0 Q n Knowng the non-cartel fr wll behave n ths way, the cartel axzes ts jont proft as follows: ax 90 Q n Q n Q n The FOC s 90 Q n = 0 Hence, the eulbru s Q n Q n = 45 P = 3. 5 non cartel π = 0.5 Therefore, coparng the proft to frs nsde the n-fr cartel to the proft of the noncartel fr suggests n < 4 Stable cartel n = 4 Indfferent n > 4 Incentve to not jon Due to the syetry of the frs, there s no dfference between the (n-)-fr cartel and a sngle Stackelberg leader; look at the FOC to confr ths. th a large nuber of frs, collusve profts are heavly dluted; thus, despte the fact that a Stackelberg follower does coparatvely worse than the leader, t stll pays to hold out and gan the undsspated Stackelberg follower profts. Proble 3: a) Each fr solves the followng proble:
5 4.0 Sprng 003 Proble Set Solutons Page 5 wth FOC ax P Q C ( Q )= (P 0 )( 80 P + P j ) P 80 4P + P j + 0 = P j P = 4 Due to syetry, we know that P R = P ; hence, P R = P = 00 / 3 wth FOC π = 70 3 = b) ave knows Rah s best response functon s 00 + P = PR 4 because Rah s proft-axzaton proble has not changed; therefore, ave solves the followng proble: ax (P P ) 80 P + P 4 Therefore, 80 4P P = P = 0 P = 35 P = 35 P = R π = π R = 8. 5 ave should take advantage of the cotent strategy because t (slghtly) ncreases hs profts. Proble 4: For splcty, label the ponts at whch the players ove as nodes one through seven, nuberng the up and down, left to rght; player one oves at nodes, 4, 5, and 6, whle player two oves at nodes and 3. The two nodes connected by the dotted lne are n fact a sngle node. The dotted lne sgnfes the fact that player one does not know at whch node he was. To fnd an SPNE, we eploy backwards nducton. At node 6, player one wll choose u, whether player two had chosen U or D at node three. At node fve, player one wll choose d ; at node four, he wll choose u. Steppng back to nodes two and three, we can decde what s optal for player two knowng what player one wll do at the ensung nodes. At node three, player two wll choose U; at node two, he wll also choose U. Last,
6 4.0 Sprng 003 Proble Set Solutons Page 6 player one wll begn the gae by choosng d. e can represent the eulbru strateges for the two players as follows: ( d, u, d, u ) ( U, U ) where the frst vector s the strateges for player one and the second vector s the strateges for player two, strateges are ordered by node. Proble 5: a) Ths s analogous to the GE/estnghouse case when GE began postng all ts transacton prces. Ths s lkely to facltate colluson because t ontors the actons of the frs; colludng frs leave ontorng and detectng cheatng to the Cosson. b) The envronental polces are lkely to nhbt colluson. Colluson s enforced by the threat of future punshent,.e., the attractveness of colludng s the collusve future revenue strea. The fact that the product wll be banned n fve years truncates the possble beneft to colludng; less ncentve to collude s ore ncentve to not collude. c) Uncertanty tends to hnder colluson prarly by akng detecton ore dffcult. For exaple, a low prce ay ndcate low deand or cheatng be a fr, producng less output. d) Multarket contact s lkely to facltate colluson. It akes punshent easer; as referred to n the lecture notes, May relax ncentve constrant; transfer slack n nocheatng condton fro one arket to another to expand scope of cooperatve behavor. Proble 6: a) The ajor reason the two prces are dfferent s probably prce dscrnaton. Suppose soe consuers have uch lower search costs than others; they enjoy surfng the web bargan-huntng or are ore techno-savvy. Slarly, t ay be dscrnaton between dfferent types of consuers; college students and yuppes pay less than older adults. Busness travelers ay not search around for low prces n the sae way that pleasure travelers do. Possbly, the two roos are not really dentcal; there ay be sall dfferences between the products that we do not observe. b) The hotels ay want to prevent prces fro beng posted because t helps attract ore consuers to the lower prces. Fewer consuers pay the hgh prces relshed by the hotels. Prcelne, on the other hand, ay not want prces posted because t akes ther servce less attractve n the future. th prces ade publc, people ay be able to bargan drectly wth the hotels, or prces ay becoe standardzed at soe lower prce, akng Prcelne obsolete.
EconS 501 Micro Theory I 1 Recitation #12 Imperfect Competition
EconS 50 Mcro Theory I Rectaton # Iperfect Copetton Exercse 5.3 (NS). [ON YOUR OWN] Ths exercse analyzes Cournot copetton when frs have dfferent argnal costs. Ths departure fro dentcal frs allows the student
More informationChapter 3: Oligopoly
Notes on Chapter 3: Olgopoly Mcroeconoc Theory IV 3º - LE-: 008-009 Iñak Agurre Departaento de Fundaentos del Análss Econóco I Unversdad del País Vasco Mcroeconoc Theory IV Olgopoly Introducton.. The Cournot
More informationCournot Equilibrium with N firms
Recap Last class (September 8, Thursday) Examples of games wth contnuous acton sets Tragedy of the commons Duopoly models: ournot o class on Sept. 13 due to areer Far Today (September 15, Thursday) Duopoly
More informationPreference and Demand Examples
Dvson of the Huantes and Socal Scences Preference and Deand Exaples KC Border October, 2002 Revsed Noveber 206 These notes show how to use the Lagrange Karush Kuhn Tucker ultpler theores to solve the proble
More informationAdvanced Microeconomics (ES30025)
Advanced Mcroeconocs (ES3005) Topc Two: Olgopoly () Colluson Advanced Mcroeconocs (ES3005) Topc Two: Olgopoly () - Colluson Outlne:. Introducton. Isoproft Contours 3. Colluson 4. Olgopoly as a Repeated
More informationFermi-Dirac statistics
UCC/Physcs/MK/EM/October 8, 205 Fer-Drac statstcs Fer-Drac dstrbuton Matter partcles that are eleentary ostly have a type of angular oentu called spn. hese partcles are known to have a agnetc oent whch
More informationOptimal Marketing Strategies for a Customer Data Intermediary. Technical Appendix
Optal Marketng Strateges for a Custoer Data Interedary Techncal Appendx oseph Pancras Unversty of Connectcut School of Busness Marketng Departent 00 Hllsde Road, Unt 04 Storrs, CT 0669-04 oseph.pancras@busness.uconn.edu
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 informationXiangwen Li. March 8th and March 13th, 2001
CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an
More informationCHAPTER 6 CONSTRAINED OPTIMIZATION 1: K-T CONDITIONS
Chapter 6: Constraned Optzaton CHAPER 6 CONSRAINED OPIMIZAION : K- CONDIIONS Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based
More informationCollusive Decisions and Punishment under Demand and Cost Uncertainty
Collusve Decsons and Punshent under Deand and Cost Uncertanty Chrysovalants Aountzas Hertfordshre usness School Workng Paper (2016) The Workng Paper Seres s ntended for rapd dssenaton of research results,
More informationCOS 511: Theoretical Machine Learning
COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that
More informationImperfect Competition
Iperfect Copetton ISBN: 978-84-69-4354- Iñak Agurre 07-09 Notes on Iperfect Copetton Iñak Agurre Departaento de Fundaentos del Análss Econóco I Unversdad del País Vasco Inde Chapter. Monopoly Introducton..
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 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 information3.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 informationCHAPTER 7 CONSTRAINED OPTIMIZATION 1: THE KARUSH-KUHN-TUCKER CONDITIONS
CHAPER 7 CONSRAINED OPIMIZAION : HE KARUSH-KUHN-UCKER CONDIIONS 7. Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based unconstraned
More informationWhat is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.
(C) 998 Gerald B Sheblé, all rghts reserved Lnear Prograng Introducton Contents I. What s LP? II. LP Theor III. The Splex Method IV. Refneents to the Splex Method What s LP? LP s an optzaton technque that
More informationLK, represents the total amount of labor and capital available in the economy, P, P denote the prices
Fall 1 Econ 455 Answers - Proble Set 3 Due Noveber 8, 1 Harvey Lapan 1. Consder a spled verson o the Heckscher-Ohln odel wth the ollowng technology: To produce ood: 1 unt o labor and 3 unts o captal are
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 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 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 informationChapter 12 Lyes KADEM [Thermodynamics II] 2007
Chapter 2 Lyes KDEM [Therodynacs II] 2007 Gas Mxtures In ths chapter we wll develop ethods for deternng therodynac propertes of a xture n order to apply the frst law to systes nvolvng xtures. Ths wll be
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 informationThe oligopolistic markets
ernando Branco 006-007 all Quarter Sesson 5 Part II The olgopolstc markets There are a few supplers. Outputs are homogenous or dfferentated. Strategc nteractons are very mportant: Supplers react to each
More informationLECTURE :FACTOR ANALYSIS
LCUR :FACOR ANALYSIS Rta Osadchy Based on Lecture Notes by A. Ng Motvaton Dstrbuton coes fro MoG Have suffcent aount of data: >>n denson Use M to ft Mture of Gaussans nu. of tranng ponts If
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 informationLecture 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 informationSolutions for Homework #9
Solutons for Hoewor #9 PROBEM. (P. 3 on page 379 n the note) Consder a sprng ounted rgd bar of total ass and length, to whch an addtonal ass s luped at the rghtost end. he syste has no dapng. Fnd the natural
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationMultipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18
Multpont Analyss for Sblng ars Bostatstcs 666 Lecture 8 revously Lnkage analyss wth pars of ndvduals Non-paraetrc BS Methods Maxu Lkelhood BD Based Method ossble Trangle Constrant AS Methods Covered So
More informationLecture-24. Enzyme kinetics and Enzyme inhibition-ii
Lecture-24 Enzye knetcs and Enzye nhbton-ii Noncopette Inhbton A noncopette nhbtor can bnd wth enzye or wth enzye-substrate coplex to produce end coplex. Hence the nhbtor ust bnd at a dfferent ste fro
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng
More informationChapter 3 Describing Data Using Numerical Measures
Chapter 3 Student Lecture Notes 3-1 Chapter 3 Descrbng Data Usng Numercal Measures Fall 2006 Fundamentals of Busness Statstcs 1 Chapter Goals To establsh the usefulness of summary measures of data. The
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
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 informationCS-433: Simulation and Modeling Modeling and Probability Review
CS-433: Smulaton and Modelng Modelng and Probablty Revew Exercse 1. (Probablty of Smple Events) Exercse 1.1 The owner of a camera shop receves a shpment of fve cameras from a camera manufacturer. Unknown
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 informationPage 1. SPH4U: Lecture 7. New Topic: Friction. Today s Agenda. Surface Friction... Surface Friction...
SPH4U: Lecture 7 Today s Agenda rcton What s t? Systeatc catagores of forces How do we characterze t? Model of frcton Statc & Knetc frcton (knetc = dynac n soe languages) Soe probles nvolvng frcton ew
More informationMathematics Intersection of Lines
a place of mnd F A C U L T Y O F E D U C A T I O N Department of Currculum and Pedagog Mathematcs Intersecton of Lnes Scence and Mathematcs Educaton Research Group Supported b UBC Teachng and Learnng Enhancement
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationCS286r 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 informationAnswers Problem Set 2 Chem 314A Williamsen Spring 2000
Answers Problem Set Chem 314A Wllamsen Sprng 000 1) Gve me the followng crtcal values from the statstcal tables. a) z-statstc,-sded test, 99.7% confdence lmt ±3 b) t-statstc (Case I), 1-sded test, 95%
More informationMAE140 - Linear Circuits - Fall 13 Midterm, October 31
Instructons ME140 - Lnear Crcuts - Fall 13 Mdterm, October 31 () Ths exam s open book. You may use whatever wrtten materals you choose, ncludng your class notes and textbook. You may use a hand calculator
More informationOn 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 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 informationXII.3 The EM (Expectation-Maximization) Algorithm
XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles
More informationExcess Error, Approximation Error, and Estimation Error
E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple
More informationScattering by a perfectly conducting infinite cylinder
Scatterng by a perfectly conductng nfnte cylnder Reeber that ths s the full soluton everywhere. We are actually nterested n the scatterng n the far feld lt. We agan use the asyptotc relatonshp exp exp
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 informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
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 information1 Review From Last Time
COS 5: Foundatons of Machne Learnng Rob Schapre Lecture #8 Scrbe: Monrul I Sharf Aprl 0, 2003 Revew Fro Last Te Last te, we were talkng about how to odel dstrbutons, and we had ths setup: Gven - exaples
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 informationRecap: the SVM problem
Machne Learnng 0-70/5-78 78 Fall 0 Advanced topcs n Ma-Margn Margn Learnng Erc Xng Lecture 0 Noveber 0 Erc Xng @ CMU 006-00 Recap: the SVM proble We solve the follong constraned opt proble: a s.t. J 0
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 informationThe Fundamental Theorem of Algebra. Objective To use the Fundamental Theorem of Algebra to solve polynomial equations with complex solutions
5-6 The Fundamental Theorem of Algebra Content Standards N.CN.7 Solve quadratc equatons wth real coeffcents that have comple solutons. N.CN.8 Etend polnomal denttes to the comple numbers. Also N.CN.9,
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationWeighted Voting Systems
Weghted Votng Systems Elssa Brown Chrssy Donovan Charles Noneman June 5, 2009 Votng systems can be deceptve. For nstance, a votng system mght consst of four people, n whch three of the people have 2 votes,
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationCase A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k.
THE CELLULAR METHOD In ths lecture, we ntroduce the cellular method as an approach to ncdence geometry theorems lke the Szemeréd-Trotter theorem. The method was ntroduced n the paper Combnatoral complexty
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 informationTemperature. Chapter Heat Engine
Chapter 3 Temperature In prevous chapters of these notes we ntroduced the Prncple of Maxmum ntropy as a technque for estmatng probablty dstrbutons consstent wth constrants. In Chapter 9 we dscussed the
More informationDepartment of Electrical & Electronic Engineeing Imperial College London. E4.20 Digital IC Design. Median Filter Project Specification
Desgn Project Specfcaton Medan Flter Department of Electrcal & Electronc Engneeng Imperal College London E4.20 Dgtal IC Desgn Medan Flter Project Specfcaton A medan flter s used to remove nose from a sampled
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 informationUniversity 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 informationPhysics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum
Recall that there was ore to oton than just spee A ore coplete escrpton of oton s the concept of lnear oentu: p v (8.) Beng a prouct of a scalar () an a vector (v), oentu s a vector: p v p y v y p z v
More information8.1 Arc Length. What is the length of a curve? How can we approximate it? We could do it following the pattern we ve used before
.1 Arc Length hat s the length of a curve? How can we approxmate t? e could do t followng the pattern we ve used before Use a sequence of ncreasngly short segments to approxmate the curve: As the segments
More informationChapter One Mixture of Ideal Gases
herodynacs II AA Chapter One Mxture of Ideal Gases. Coposton of a Gas Mxture: Mass and Mole Fractons o deterne the propertes of a xture, we need to now the coposton of the xture as well as the propertes
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More information1 Definition of Rademacher Complexity
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #9 Scrbe: Josh Chen March 5, 2013 We ve spent the past few classes provng bounds on the generalzaton error of PAClearnng algorths for the
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationG = G 1 + G 2 + G 3 G 2 +G 3 G1 G2 G3. Network (a) Network (b) Network (c) Network (d)
Massachusetts Insttute of Technology Department of Electrcal Engneerng and Computer Scence 6.002 í Electronc Crcuts Homework 2 Soluton Handout F98023 Exercse 21: Determne the conductance of each network
More informationHandling Overload (G. Buttazzo, Hard Real-Time Systems, Ch. 9) Causes for Overload
PS-663: Real-Te Systes Handlng Overloads Handlng Overload (G Buttazzo, Hard Real-Te Systes, h 9) auses for Overload Bad syste desgn eg poor estaton of worst-case executon tes Sultaneous arrval of unexpected
More informationEquilibrium with Complete Markets. Instructor: Dmytro Hryshko
Equlbrum wth Complete Markets Instructor: Dmytro Hryshko 1 / 33 Readngs Ljungqvst and Sargent. Recursve Macroeconomc Theory. MIT Press. Chapter 8. 2 / 33 Equlbrum n pure exchange, nfnte horzon economes,
More informationtotal If no external forces act, the total linear momentum of the system is conserved. This occurs in collisions and explosions.
Lesson 0: Collsons, Rotatonal netc Energy, Torque, Center o Graty (Sectons 7.8 Last te we used ewton s second law to deelop the pulse-oentu theore. In words, the theore states that the change n lnear oentu
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 informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data
More informationFinal Exam Solutions, 1998
58.439 Fnal Exa Solutons, 1998 roble 1 art a: Equlbru eans that the therodynac potental of a consttuent s the sae everywhere n a syste. An exaple s the Nernst potental. If the potental across a ebrane
More informationCS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016
CS 29-128: Algorthms and Uncertanty Lecture 17 Date: October 26, 2016 Instructor: Nkhl Bansal Scrbe: Mchael Denns 1 Introducton In ths lecture we wll be lookng nto the secretary problem, and an nterestng
More informationand problem sheet 2
-8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems,
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 informationThe Impact of the Earth s Movement through the Space on Measuring the Velocity of Light
Journal of Appled Matheatcs and Physcs, 6, 4, 68-78 Publshed Onlne June 6 n ScRes http://wwwscrporg/journal/jap http://dxdoorg/436/jap646 The Ipact of the Earth s Moeent through the Space on Measurng the
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationOn the number of regions in an m-dimensional space cut by n hyperplanes
6 On the nuber of regons n an -densonal space cut by n hyperplanes Chungwu Ho and Seth Zeran Abstract In ths note we provde a unfor approach for the nuber of bounded regons cut by n hyperplanes n general
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 informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
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 informationPhysics 114 Exam 2 Fall 2014 Solutions. Name:
Physcs 114 Exam Fall 014 Name: For gradng purposes (do not wrte here): Queston 1. 1... 3. 3. Problem Answer each of the followng questons. Ponts for each queston are ndcated n red. Unless otherwse ndcated,
More informationEigenvalues of Random Graphs
Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the
More informationGravitational Acceleration: A case of constant acceleration (approx. 2 hr.) (6/7/11)
Gravtatonal Acceleraton: A case of constant acceleraton (approx. hr.) (6/7/11) Introducton The gravtatonal force s one of the fundamental forces of nature. Under the nfluence of ths force all objects havng
More informationElastic Collisions. Definition: two point masses on which no external forces act collide without losing any energy.
Elastc Collsons Defnton: to pont asses on hch no external forces act collde thout losng any energy v Prerequstes: θ θ collsons n one denson conservaton of oentu and energy occurs frequently n everyday
More informationAS-Level Maths: Statistics 1 for Edexcel
1 of 6 AS-Level Maths: Statstcs 1 for Edecel S1. Calculatng means and standard devatons Ths con ndcates the slde contans actvtes created n Flash. These actvtes are not edtable. For more detaled nstructons,
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 informationOur focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.
SSTEM MODELLIN In order to solve a control syste proble, the descrptons of the syste and ts coponents ust be put nto a for sutable for analyss and evaluaton. The followng ethods can be used to odel physcal
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
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 information