Optimal Penal Codes in Price-setting Supergames with Capacity Constraints
为带有折现的无限重复博弈构建了最优惩罚码，可解释为产能约束下的伯特兰寡头博弈，发现通过可信惩罚可将企业逼至安全水平。
Optimal penal codes are constructed for a class of infinitely repeated games with discounting. These games can be interpreted as Bertrand oligopoly games with capacity constraints. No particular rationing rule is adopted; weak restrictions are imposed on the firms' sales functions instead. Models adopting the commonly used rationing rules are special cases of the general framework studied here. It is found that firms can be driven to their security levels by credible punishments.