--%>
Assignment Help - homework help

Problem on inverse demand curves

In differentiated-goods duopoly business, with inverse demand curves:

P1 = 10 – 5Q1 – 2Q2
P2 = 10 – 5Q2 – 2Q1

and per unit costs for each and every firm equal to 1.

a) For a Cournot game - recommend Firm 1’s best response function? Determine the Nash equilibrium?

b) For a Stackelburg game - what is the Firm 1’s best response function? Determine the Nash equilibrium?

   Related Questions in Mathematics

  • Q : Ordinary Differential Equation or ODE

    What is an Ordinary Differential Equation (ODE)?

    		•
  • Q : Where would we be without stochastic

    Where would we be without stochastic or Ito^ calculus?

    		•
  • Q : Set Theory & Model of a Boolean Algebra

    II. Prove that Set Theory is a Model of a Boolean Algebra The three Boolean operations of Set Theory are the three set operations of union (U), intersection (upside down U), and complement ~.  Addition is set

    		•
  • Q : Who derived the Black–Scholes Equation

    Who derived the Black–Scholes Equation?

    		•
  • Q : Probability assignments 1. Smith keeps

    1. Smith keeps track of poor work. Often on afternoon it is 5%. If he checks 300 of 7500 instruments what is probability he will find less than 20substandard? 2. Realtors estimate that 23% of homes purchased in 2004 were considered investment properties. If a sample of 800 homes sold in 2

    		•
  • Q : Area Functions & Theorem Area Functions

    Area Functions 1. (a) Draw the line y = 2t + 1 and use geometry to find the area under this line, above the t - axis, and between the vertical lines t = 1 and t = 3. (b) If x > 1, let A(x) be the area of the region that lies under the line y = 2t + 1 between t

    		•
  • Q : Explain Black–Scholes model Explain

    Explain Black–Scholes model.

    		•
  • Q : Explain Factorisation by trial division

    Factorisation by trial division: The essential idea of factorisation by trial division is straightforward. Let n be a positive integer. We know that n is either prime or has a prime divisor less than or equal to √n. Therefore, if we divide n in

    		•
  • Q : Numerical Analysis Hi, I was wondering

    Hi, I was wondering if there is anyone who can perform numerical analysis and write a code when required. Thanks

    		•
  • Q : State Measuring complexity Measuring

    Measuring complexity: Many algorithms have an integer n, or two integers m and n, as input - e.g., addition, multiplication, exponentiation, factorisation and primality testing. When we want to describe or analyse the `easiness' or `hardness' of the a

    		•