8.1 Optimization Methods - Lagrangian Duality

[@ky8920]

in 21:42, shouldn't it be 'where the set of pure strategies/set of choices is compact' instead? as mixed strategy is defined as an assignment of a probability to each pure strategy. a set of mixed strategies is a set of n-tuple in [0,1]^n

[@ky8920]

in 46:29, how comes the conclustion for weak duality here? i thought slater conditions holds imples strong duality not another way around

[@er-wl9sy]

Thanks very informative. Is it possible to get access to the assignments? It would be helpful to apply the theory on HW sets

[@juliuspfrommer9286]

Unfortunately not. At this time the assignments are only for the class at KIT.

[@robmarks6800]

Why at 12:22 does the left hand represent the player Y going first, when the order of operations would be to first let player X minimize \psi?

[@london1944]

agree, it should be the other way around

[@robmarks6800]

@@london1944 I now got the answer. The inner min is a function that is dependent on the other variable, thus it can be seen as going second.

[@london1944]

@@robmarks6800 ahhh ok that makes sense, so player Y makes a choice and then X tries to minimize psi … okok