--%>
Assignment Help - homework help

competitive equilibrium

8. Halloween is an old American tradition. Kids go out dressed in costume and neighbors give them candy when they come to the door. Spike and Cinderella are brother and sister. After a long night collecting candy, they sit down as examine what they have. Spike finds that he has 40 candy bars and 20 packs of gum. His sister finds she has 30 candy bars and 40 packs of gum. Spike likes candy bars exactly twice as much as gum and would always be willing to trade two packs of gum for one candy bar. Cinderella, on the other hand, likes gum exactly twice as much as candy bars and would always be willing to trade two candy bars for one pack of gum. 

a. Illustrate this situation in an Edgeworth box. Let Spike’s origin be in the lower left, and Cinderella’s be in the upper right hand corner. Put candy bars on the horizontal axis and gum on the vertical. 

b. Now draw in indifference curves for the two agents that reflect the description given above. Indicate the endowment point, and the contract curve. Illustrate a competitive equilibrium. Is there more than one competitive equilibrium? 

#10. Ken McSubstitute and Ron O’Complement were flying to a fast food festival in Fiji when an unexpected storm forced their plane to ditch in the middle of the Pacific. Miraculously, they are washed up on a desert island. Ken finds that he has only 5 slightly wet hamburgers and 15 orders of fries in his pockets. Ron discovers he has 15 hamburgers and 5 orders of fries. Ken only cares about how much he gets to eat. His utility function is: Us(H,F) = H+F. On the other hand, Ron believes that it is uncivilized to eat hamburgers without french fries or french fries without hamburgers. His utility function is: Uc(H,F) = min(H,F). 

a. In an Edgeworth box, show the endowment point, the Pareto Opimal Allocations, and the competitive equilibrium 

b. Is the competitive equilibrium Pareto Optimal? 

   Related Questions in Mathematics

  • Q : State Fermat algorithm The basic Fermat

    The basic Fermat algorithm is as follows: Assume that n is an odd positive integer. Set c = [√n] (`ceiling of √n '). Then we consider in turn the numbers c2 - n; (c+1)2 - n; (c+2)2 - n..... until a perfect square is found. If th

    		•
  • 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 : What is Non-Logical Vocabulary

    Non-Logical Vocabulary: 1. Predicates, called also relation symbols, each with its associated arity. For our needs, we may assume that the number of predicates is finite. But this is not essential. We can have an infinite list of predicates, P

    		•
  • Q : What is Big-O hierarchy The big-O

    The big-O hierarchy: A few basic facts about the big-O behaviour of some familiar functions are very important. Let p(n) be a polynomial in n (of any degree). Then logbn is O(p(n)) and p(n) is O(an<

    		•
  • Q : State Prime number theorem Prime number

    Prime number theorem: A big deal is known about the distribution of prime numbers and of the prime factors of a typical number. Most of the mathematics, although, is deep: while the results are often not too hard to state, the proofs are often diffic

    		•
  • Q : Uniform scaling what is uniform scaling

    what is uniform scaling in computer graphic

    		•
  • Q : What is limit x tends to 0 log(1+x)/x

    What is limit x tends to 0  log(1+x)/x to the base a?

  • 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 : Elementary Logic Set & Model of a

    Prove that Elementary Logic Set is a Model of a Boolean Algebra The three Boolean operations of Logic are the three logical operations of  OR ( V ), AN

    		•
  • Q : Problem on Prime theory Suppose that p

    Suppose that p and q are different primes and n = pq. (i) Express p + q in terms of Ø(n) and n. (ii) Express p - q in terms of p + q and n. (iii) Expl

    		•