Unformatted text preview: ³ θ T  π ( θ T ) > ´ . Deﬁne allocation as θ tmeasurable functions c t : D→ R T + y t : D→ R T + Allocation is feasible if X Θ ∈ D T X t =1 Rt c t ( θ T ) π ( θ T ) ≤ X Θ ∈ D T X t =1 Rt y t ( θ T ) π ( θ T ) Deﬁne a mechanism as set of actions A ⊂ Q T t =1 X t and outcome functions g : A × Δ( A )→ R 2 T + and g t ( a,μ ) = g t ( a ,μ ) if a t = a t and X ( a t +1 ,...,a T ) μ (¯ a t ,a t +1 ,...,a T ) = X ( a t +1 ,...,a T ) μ (¯ a t ,a t +1 ,...,a T ) ∀ ¯ a t in which μ,μ ∈ Δ( A ) are measure of actions chosen. 34...
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
 wong
 Calculus

Click to edit the document details