--%>

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 : Define Big-O notation Big-O notation :

    Big-O notation: If f(n) and g(n) are functions of a natural number n, we write f(n) is O(g(n)) and we say f is big-O of g if there is a constant C (independent of n) such that f

  • Q : Problem on reduced row-echelon The

    The augmented matrix from a system of linear equations has the following reduced row-echelon form. 280_row echelon method.jpg

  • Q : Abstract Algebra let a, b, c, d be

    let a, b, c, d be integers. Prove the following statements: (a) if a|b and b|c. (b) if a|b and ac|bd. (c) if d|a and d|b then d|(xa+yb) for any x, y EZ

  • Q : Graph Theory is the n-Dimensional Qn

    is the n-Dimensional Qn Hamiltonian? Prove tour answer

  • Q : Mathematical Method for Engineers The

     The function is clearly undefined at , but despite all of this the function does have a limit as approaches 0. a) Use MATLAB and ezplot to sketch for , and use the zoom on facility to guess the . You need to include you M-file, outp

  • 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 independently developed

    Who independently developed a model for simply pricing risky assets?

  • 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 : 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 : Logic and math The homework is attached

    The homework is attached in the first two files, it's is related to Sider's book, which is "Logic for philosophy" I attached this book too, it's the third file.