--%>

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 : Nonlinear integer programming problem

    Explain Nonlinear integer programming problem with an example ?

  • 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 : Define Well-formed formulas or Wffs

    Wffs (Well-formed formulas): These are defined inductively by the following clauses:    (i) If  P  is an n-ary predicate and  t1, …, tn are terms, then P(t1, …, t

  • Q : Probability and Stochastic assignment

    Introduction to Probability and Stochastic Assignment 1: 1. Consider an experiment in which one of three boxes containing microchips is chosen at random and a microchip is randomly selected from the box.

  • Q : Properties of a group How can we say

    How can we say that the pair (G, o) is a group. Explain the properties which proof it.

  • 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 : Who firstly use the finite-difference

    Who firstly use the finite-difference method?

  • Q : Solve each equation by factoring A

    A college student invested part of a $25,000 inheritance at 7% interest and the rest at 6%.  If his annual interest is $1,670 how much did he invest at 6%?  If I told you the answer is $8,000, in your own words, using complete sentences, explain how you

  • 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 : Problem on Datalog for defining

    The focus is on  the use of Datalog for defining properties  and queries on graphs. (a) Assume that P is some property of graphs  definable in the Datalog. Show that P is preserved beneath extensions  and homomo