Optimal Penal Codes in Price-setting Supergames with Capacity Constraints
From MaRDI portal
Publication:3773733
Recommendations
- Optimal penal codes in nearly symmetric Bertrand supergames with capacity constraints
- Some results on optimal penal codes in asymmetric Bertrand supergames
- Optimal punishments in linear duopoly supergames with product differentiation
- The suboptimality of optimal punishments in Cournot supergames
- The optimality of optimal punishments in Cournot supergames
Cited in
(18)- Determination of optimal penalties for antitrust violations in a dynamic setting
- Optimal penal codes in nearly symmetric Bertrand supergames with capacity constraints
- Some results on optimal penal codes in asymmetric Bertrand supergames
- A note on optimal penal codes in stochastic Bertrand supergames
- Repeated price competition with increasing marginal costs
- The optimality of optimal punishments in Cournot supergames
- Collusion with capacity constraints under a sales maximization rationing rule
- Optimal punishments with detection lags
- Optimal punishments in linear duopoly supergames with product differentiation
- Prisoners' dilemma in duopoly (super) games
- Taxation and the sustainability of collusion with asymmetric costs
- Bounding payoffs in repeated games with private monitoring: \(n\)-player games
- Optimal collusion under cost asymmetry
- On the feasibility of maximal collusion
- Dynamic price competition with capacity constraints and a strategic buyer
- Endogenous rationing, price dispersion and collusion in capacity constrained supergames
- The suboptimality of optimal punishments in Cournot supergames
- Extremal equlibria of oligopolistic supergames
This page was built for publication: Optimal Penal Codes in Price-setting Supergames with Capacity Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773733)