Optimal Penal Codes in Price-setting Supergames with Capacity Constraints
DOI10.2307/2297565zbMATH Open0634.90103OpenAlexW2035984424MaRDI QIDQ3773733FDOQ3773733
Authors: Val Eugene Lambson
Publication date: 1987
Published in: Review of Economic Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2297565
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
discountinginfinitely repeated gamesBertrand oligopoly games with capacity constraintsOptimal penal codesprice-setting supergames
Multistage and repeated games (91A20) Microeconomic theory (price theory and economic markets) (91B24) Economic growth models (91B62)
Cited In (18)
- Endogenous rationing, price dispersion and collusion in capacity constrained supergames
- Some results on optimal penal codes in asymmetric Bertrand supergames
- Optimal penal codes in nearly symmetric Bertrand supergames with capacity constraints
- On the feasibility of maximal collusion
- Collusion with capacity constraints under a sales maximization rationing rule
- Bounding payoffs in repeated games with private monitoring: \(n\)-player games
- Prisoners' dilemma in duopoly (super) games
- Repeated price competition with increasing marginal costs
- Optimal collusion under cost asymmetry
- The optimality of optimal punishments in Cournot supergames
- Taxation and the sustainability of collusion with asymmetric costs
- Extremal equlibria of oligopolistic supergames
- Optimal punishments in linear duopoly supergames with product differentiation
- Determination of optimal penalties for antitrust violations in a dynamic setting
- The suboptimality of optimal punishments in Cournot supergames
- A note on optimal penal codes in stochastic Bertrand supergames
- Dynamic price competition with capacity constraints and a strategic buyer
- Optimal punishments with detection lags
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)