Optimal Penal Codes in Price-Setting Supergames with Capacity Constraints
AbstractOptimal penal codes are constructed for a class of infinity-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. Copyright 1987 by The Review of Economic Studies Limited.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Wiley Blackwell in its journal Review of Economic Studies.
Volume (Year): 54 (1987)
Issue (Month): 3 (July)
Contact details of provider:
Web page: http://www.blackwellpublishing.com/journal.asp?ref=0034-6527
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum).
If references are entirely missing, you can add them using this form.