--%>

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 : Problem on augmented matrix Consider

    Consider the following system of linear equations.  (a) Write out t

  • Q : Formulating linear program of a

    A software company has a new product specifically designed for the lumber industry. The VP of marketing has been given a budget of $1,35,00to market the product over the quarter. She has decided that $35,000 of the budget will be spent promoting the product at the nat

  • Q : Formal logic2 It's a problem set, they

    It's a problem set, they are attached. it's related to Sider's book which is "Logic to philosophy" I attached the book too. I need it on feb22 but feb23 still work

  • Q : Explain Black–Scholes model Explain

    Explain Black–Scholes model.

  • Q : Row-echelon matrix Determine into which

    Determine into which of the following 3 kinds (A), (B) and (C) the matrices (a) to (e) beneath can be categorized:       Type (A): The matrix is in both reduced row-echelon form and row-echelon form. Type (B): The matrix

  • Q : Law of iterated expectations for

     Prove the law of iterated expectations for continuous random variables. 2. Prove that the bounds in Chebyshev's theorem cannot be improved upon. I.e., provide a distribution that satisfies the bounds exactly for k ≥1, show that it satisfies the bounds exactly, and draw its PDF. T

  • 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

  • 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 : What is the definition of a group Group

    Group: Let G be a set. When we say that o is a binary operation on G, we mean that o is a function from GxG into G. Informally, o takes pairs of elements of G as input and produces single elements of G as output. Examples are the operations + and x of