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
This note was uploaded on 12/10/2011 for the course MAT 121 taught by Professor Wong during the Fall '10 term at SUNY Stony Brook.
- Fall '10