IDEAS home Printed from https://ideas.repec.org/a/eee/irlaec/v15y1995i2p127-140.html
   My bibliography  Save this article

Computational cost of verifying enforceable contracts

Author

Listed:
  • Holm, Hakan J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Holm, Hakan J., 1995. "Computational cost of verifying enforceable contracts," International Review of Law and Economics, Elsevier, vol. 15(2), pages 127-140, June.
  • Handle: RePEc:eee:irlaec:v:15:y:1995:i:2:p:127-140
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0144-8188(94)00012-J
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. Barton L. Lipman, 1992. "Limited Rationality and Endogenously Incomplete Contracts," Working Paper 858, Economics Department, Queen's University.
    3. Alfred Lorn Norman, 1987. "A Theory of Monetary Exchange," Review of Economic Studies, Oxford University Press, vol. 54(3), pages 499-517.
    4. 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-250, February.
    5. K. J. Arrow, 1964. "The Role of Securities in the Optimal Allocation of Risk-bearing," Review of Economic Studies, Oxford University Press, vol. 31(2), pages 91-96.
    6. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Håkan J. Holm, 2004. "Rights and Decentralized Computation," Metroeconomica, Wiley Blackwell, vol. 55(2‐3), pages 290-317, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sung, Shao-Chin & Dimitrov, Dinko, 2010. "Computational complexity in additive hedonic games," European Journal of Operational Research, Elsevier, vol. 203(3), pages 635-639, June.
    2. Olivier Compte & Andrew Postlewaite, 2007. "Effecting Cooperation," PIER Working Paper Archive 09-019, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 29 May 2009.
    3. João E. Gata, 2019. "Controlling Algorithmic Collusion: short review of the literature, undecidability, and alternative approaches," Working Papers REM 2019/77, ISEG - Lisbon School of Economics and Management, REM, Universidade de Lisboa.
    4. Luca Anderlini & Leonardo Felli, "undated". "Costly Coasian Contracts," Penn CARESS Working Papers c5b2efc4326ca8bb8162440d6, Penn Economics Department.
    5. Mehrdad Vahabi, 1999. "From Walrasian General Equilibrium to Incomplete Contracts: Making Sense of Institutions," Post-Print halshs-03704424, HAL.
    6. Compte, Olivier & Postlewaite, Andrew, 2015. "Plausible cooperation," Games and Economic Behavior, Elsevier, vol. 91(C), pages 45-59.
    7. Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 593-611, August.
    8. D. Sgroi & D. J. Zizzo, 2002. "Strategy Learning in 3x3 Games by Neural Networks," Cambridge Working Papers in Economics 0207, Faculty of Economics, University of Cambridge.
    9. Itzhak Gilboa & Ehud Kalai & Eitan Zemel, 1989. "The Complexity of Eliminating Dominated Strategies," Discussion Papers 853, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    10. Toru Suzuki, 2020. "Efficiently Imprecise Contracts," Working Paper Series 2020/07, Economics Discipline Group, UTS Business School, University of Technology, Sydney.
    11. Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    12. Stephan Schosser & Bodo Vogt, 2015. "What automaton model captures decision making? A call for finding a behavioral taxonomy of complexity," FEMM Working Papers 150010, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    13. Oliveira, Fernando S., 2010. "Limitations of learning in automata-based systems," European Journal of Operational Research, Elsevier, vol. 203(3), pages 684-691, June.
    14. Jakub Dargaj & Jakob Grue Simonsen, 2020. "A Complete Characterization of Infinitely Repeated Two-Player Games having Computable Strategies with no Computable Best Response under Limit-of-Means Payoff," Papers 2005.13921, arXiv.org, revised Jun 2020.
    15. Oliver Compte & Andrew Postlewaite, 2010. "Plausible Cooperation, Fourth Version," PIER Working Paper Archive 15-006, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 23 Jan 2015.
    16. Sgroi, Daniel & Zizzo, Daniel John, 2009. "Learning to play 3×3 games: Neural networks as bounded-rational players," Journal of Economic Behavior & Organization, Elsevier, vol. 69(1), pages 27-38, January.
    17. Mukoyama, Toshihiko, 2021. "MIT shocks imply market incompleteness," Economics Letters, Elsevier, vol. 198(C).
    18. Nabil I. Al-Najjar & Luca Anderlini & Leonardo Felli, 2006. "Undescribable Events," Review of Economic Studies, Oxford University Press, vol. 73(4), pages 849-868.
    19. Athanasoulis, S. & Shiller, R.J., 1995. "World Income Components: Measuring and Exploting International Risk Sharing Opportunities," Papers 725, Yale - Economic Growth Center.
    20. Mas-Colell, Andreu & Zame, William R., 1996. "The existence of security market equilibrium with a non-atomic state space," Journal of Mathematical Economics, Elsevier, vol. 26(1), pages 63-84.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:irlaec:v:15:y:1995:i:2:p:127-140. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/irle .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.