This preview shows page 1. Sign up to view the full content.
Unformatted text preview: exist = *-1 n ( ) A n such that X -n ( -n ) u ( g c n ( , *-n ( -n )))-v g y n ( , *-n ( -n )) n > X -n ( -n ) u ( g c n ( * n ( n ) , *-n ( -n )))-v g y n ( * n ( n ) , *-n ( -n )) n this is a contradiction. Therefore, ( c n ,y n ) N n =1 can be implemented by c n = g c ( 1 ,..., N ) , y n = g y ( 1 ,..., N ) Using Revelation Principle we can restrict attention to direct mechanism and allocations that are truthfully revealing. This means that the set of implementable allocations are the 33...
View Full Document
- Fall '10