摘要 : An alternative proof of a theorem of Aumann and Maschler, `Cav u', is presented. It characterizes the limit of the values of finitely repeated games with lack of information on one side as the concavification of the value of the g... 展开 An alternative proof of a theorem of Aumann and Maschler, `Cav u', is presented. It characterizes the limit of the values of finitely repeated games with lack of information on one side as the concavification of the value of the game where none of the players has any information. The proof is based on Fenchel duality techniques. 收起