Skip to main content

Can a Free Market Be Complete?

  • Conference paper
  • First Online:
Decision Economics: Complexity of Decisions and Decisions for Complexity (DECON 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1009))

Included in the following conference series:

  • 390 Accesses

Abstract

We adopt an algorithmic approach in characterizing complete markets and complete contracts. We define a free market to be a market where private ownership is positively valued by market members. In an economy with zero transaction costs, if the market is algorithmically complete, ownership will be worthless. Accordingly, the market can be either free or complete, but not both. For the same reason, the market can be either efficient or complete, but not both.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    This is in accordance with the Church–Turing thesis that states that any intuitively computable task can be performed by a suitable TM.

  2. 2.

    A Turing Machine is total if it executes the code and halts over a “halting state,” i.e. it does not come to abrupt halt nor goes on an infinite computation [7].

  3. 3.

    We of course require that our formal background, represented by our theory, include enough arithmetic. Axioms for \(+\) and \(\times \) plus the so–called trichotomy axiom suffices.

  4. 4.

    For similar theorems see [2].

References

  1. Bernhardt, C.: Turing’s Vision: The Birth of Computer Science. MIT Press, Cambridge (2016)

    MATH  Google Scholar 

  2. Chaitin, G., da Costa, N., Doria, F.A.: Gödel’s Way. CRC Press, Boca Raton (2012)

    MATH  Google Scholar 

  3. Hart, O.: An economist’s perspective on the theory of the firm. Columbia Law Rev. 89, 1757–74 (1989)

    Article  Google Scholar 

  4. Hart, O.: Incomplete contracts and control, prize lecture. www.nobelprize.org (2016)

    Google Scholar 

  5. Moore, J.: Introductory remarks on Grossman and Hart (1986). In: Aghion, P., Dewatripont, M., Legros, P., Zingales, L. (eds.) The Impact of Incomplete Contracts on Economics. Oxford University Press, Oxford, England (2016)

    Google Scholar 

  6. Reiter, E., Johnson, C.M.: Limits to Computation: An Introduction to the Undecidable and the Intractable. CRC Press, Boca Raton (2013)

    MATH  Google Scholar 

  7. Singh, A.: Elements of Computation Theory. Springer, Heidelberg (2009)

    Book  Google Scholar 

  8. Tirole, J.: Incomplete contracts: where do we stand? Econometrica 67, 741–781 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sami Al-Suwailem .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Al-Suwailem, S., Doria, F.A. (2020). Can a Free Market Be Complete?. In: Bucciarelli, E., Chen, SH., Corchado, J. (eds) Decision Economics: Complexity of Decisions and Decisions for Complexity. DECON 2019. Advances in Intelligent Systems and Computing, vol 1009. Springer, Cham. https://doi.org/10.1007/978-3-030-38227-8_27

Download citation

Publish with us

Policies and ethics