Question

Consider the following house allocation problem: pl: B>A> p2 : CA p3: C>B ili Find a priority order (if any) for the serial dictatorship algorithm such that the final outcome is (p1 - A, p2-B, p3-C). Explain.

Answer 1

In Dictatorship Algorithm

> Each of the agents gets the priority.

> Agents pick or choose the outcomes according to their priority.

As here in this case P1 = B have the more priority as compared to the A and then with C.

And in P2 = C has the highest priority then it comes to A then at the last it comes to B.

And in P3 = C has the highest priority then it comes to B then at the last it comes A.

Here compaing all P1 , P2 , and P3 then Highest priority is of C and the lowest priority is of A.

Calculation = let highesr priority = 3 point , middle = 2 point , last = 1 point.

so here C = 7  point in total

B = 6 point in total

A = 5 point in total

So the priority order will be ( C > B > A ) .