Computational cost of verifying enforceable contracts
AbstractNo abstract is available for this item.
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 Elsevier in its journal International Review of Law and Economics.
Volume (Year): 15 (1995)
Issue (Month): 2 (June)
Contact details of provider:
Web page: http://www.elsevier.com/locate/irle
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Gilboa, Itzhak, 1988. "The complexity of computing best-response automata in repeated games," Journal of Economic Theory, Elsevier, vol. 45(2), pages 342-352, August.
- Barton L. Lipman, 1992. "Limited Rationality and Endogenously Incomplete Contracts," Working Papers 858, Queen's University, Department of Economics.
- Norman, Alfred Lorn, 1987. "A Theory of Monetary Exchange," Review of Economic Studies, Wiley Blackwell, vol. 54(3), pages 499-517, July.
- Dye, Ronald A, 1985. "Costly Contract Contingencies," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 26(1), pages 233-50, February.
- Ben-porath, Elchanan, 1990. "The complexity of computing a best response automaton in repeated games with mixed strategies," Games and Economic Behavior, Elsevier, vol. 2(1), pages 1-12, March.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.