IDEAS home Printed from https://ideas.repec.org/a/spr/joecth/v7y1996i2p237-66.html
   My bibliography  Save this article

A Lower Bound on Computational Complexity Given by Revelation Mechanisms

Author

Listed:
  • Mount, Kenneth R
  • Reiter, Stanley

Abstract

This paper establishes a lower bound on the computational complexity of smooth functions between smooth manifolds. It generalizes one for finite (Boolean) functions obtained (by Arbib and Spira [2]) by counting variables. Instead of a counting procedure, which cannot be used in the infinite case, the dimension of the message space of a certain type of revelation mechanism proves the bound. It also provides an intrinsic measure of the number of variables on which the function depends. This measure also gives a lower bound on computational costs associated with realizing or implementing the function by a decentralized mechanism, or by a game form.

Suggested Citation

  • Mount, Kenneth R & Reiter, Stanley, 1996. "A Lower Bound on Computational Complexity Given by Revelation Mechanisms," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 7(2), pages 237-266, February.
    • Handle: RePEc:spr:joecth:v:7:y:1996:i:2:p:237-66
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Jordan, J. S., 1982. "The competitive allocation process is informationally efficient uniquely," Journal of Economic Theory, Elsevier, vol. 28(1), pages 1-18, October.
    2. Reichelstein, Stefan, 1984. "Incentive compatibility and informational requirements," Journal of Economic Theory, Elsevier, vol. 34(1), pages 32-51, October.
    3. Reichelstein, Stefan & Reiter, Stanley, 1988. "Game Forms with Minimal Message Spaces," Econometrica, Econometric Society, vol. 56(3), pages 661-692, May.
    4. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
    5. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
    6. Mount, Kenneth & Reiter, Stanley, 1974. "The informational size of message spaces," Journal of Economic Theory, Elsevier, vol. 8(2), pages 161-192, June.
    7. Kenneth R. Mount & Stanley Reiter, 1983. "On the Existence of a Locally Stable Dynamic Process With a Statically Minimal Message Space," Discussion Papers 550, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    8. Chen, Pengyuan, 1992. "A lower bound for the dimension of the message space of the decentralized mechanisms realizing a given goal," Journal of Mathematical Economics, Elsevier, vol. 21(3), pages 249-270.
    9. Sonnenschein, Hugo, 1974. "An Axiomatic Characterization of the Price Mechanism," Econometrica, Econometric Society, vol. 42(3), pages 425-433, May.
    10. Stefan Reichelstein, 1981. "On the Informational Requirements for the Implementation of Social Choice Rules," Discussion Papers 507, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    11. Saari, Donald G & Simon, Carl P, 1978. "Effective Price Mechanisms," Econometrica, Econometric Society, vol. 46(5), pages 1097-1125, September.
    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. Van Zandt, Timothy, 2003. "Real-Time Hierarchical Resource Allocation with Quadratic Costs," CEPR Discussion Papers 4022, C.E.P.R. Discussion Papers.
    2. Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Tierney, Ryan, 2021. "Simple Social Choice Rules for Exchange," Discussion Papers on Economics 4/2021, University of Southern Denmark, Department of Economics.
    4. Marschak, Thomas, 2006. "Organization Structure," MPRA Paper 81518, University Library of Munich, Germany.
    5. Mehmet Barlo & Nuh Aygün Dalkıran, 2022. "Computational implementation," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 605-633, December.

    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. Ilya Segal, 2004. "The Communication Requirements of of Social Choice Rules and Supporting Budget Sets," Economics Working Papers 0039, Institute for Advanced Study, School of Social Science.
    2. Segal, Ilya, 2007. "The communication requirements of social choice rules and supporting budget sets," Journal of Economic Theory, Elsevier, vol. 136(1), pages 341-378, September.
    3. J. Jordan, 2009. "Communication complexity and stability of equilibria in economies and games," Review of Economic Design, Springer;Society for Economic Design, vol. 13(1), pages 115-135, April.
    4. Marschak, Thomas, 2006. "Organization Structure," MPRA Paper 81518, University Library of Munich, Germany.
    5. Ken Urai & Hiromi Murakami, 2015. "An Axiomatic Characterization of the Price-Money Message Mechanism," Discussion Papers in Economics and Business 15-31-Rev., Osaka University, Graduate School of Economics, revised Mar 2016.
    6. Ken Urai & Hiromi Murakami, 2015. "An Axiomatic Characterization of the Price-Money Message Mechanism," Discussion Papers in Economics and Business 15-31, Osaka University, Graduate School of Economics.
    7. Scott E. Page, 2008. "Uncertainty, Difficulty, and Complexity," Journal of Theoretical Politics, , vol. 20(2), pages 115-149, April.
    8. Ken Urai & Hiromi Murakami, 2016. "Local Independence, Monotonicity and Axiomatic Characterization of Price-Money Message Mechanism," Discussion Papers in Economics and Business 16-08, Osaka University, Graduate School of Economics.
    9. Leonid Hurwicz, 1994. "Economic design, adjustment processes, mechanisms, and institutions," Review of Economic Design, Springer;Society for Economic Design, vol. 1(1), pages 1-14, December.
    10. Ken Urai & Hiromi Murakami, 2017. "Local Independence, Monotonicity, Incentive Compatibility and Axiomatic Characterization of Price-Money Message Mechanism," Discussion Papers in Economics and Business 17-08, Osaka University, Graduate School of Economics.
    11. Nisan, Noam & Segal, Ilya, 2006. "The communication requirements of efficient allocations and supporting prices," Journal of Economic Theory, Elsevier, vol. 129(1), pages 192-224, July.
    12. Calsamiglia, Xavier & Kirman, Alan, 1993. "A Unique Informationally Efficient and Decentralized Mechanism with Fair Outcomes," Econometrica, Econometric Society, vol. 61(5), pages 1147-1172, September.
    13. Kohzo Shiraishi & Ken Urai & Hiromi Murakami, 2018. "Stability and Universal Implementability of the Price Mechanism," Discussion Papers in Economics and Business 18-16, Osaka University, Graduate School of Economics.
    14. Blume, Lawrence & Easley, David & Kleinberg, Jon & Kleinberg, Robert & Tardos, Éva, 2015. "Introduction to computer science and economic theory," Journal of Economic Theory, Elsevier, vol. 156(C), pages 1-13.
    15. Kohzo Shiraishi & Ken Urai & Hiromi Murakami, 2016. "Universality and Efficiency of Price Mechanism based on an Expansion Possibility of Economies," Discussion Papers in Economics and Business 16-10, Osaka University, Graduate School of Economics.
    16. Sylvain Béal, 2010. "Perceptron versus automaton in the finitely repeated prisoner’s dilemma," Theory and Decision, Springer, vol. 69(2), pages 183-204, August.
    17. David Baron & Ehud Kalai, 1990. "Dividing a Cake by Majority: The Simplest Equilibria," Discussion Papers 919, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    18. Tian, Guoqiang, 2004. "On the Informational Requirements of Decentralized Pareto-Satisfactory Mechanisms in Economies with Increasing Returns," MPRA Paper 41226, University Library of Munich, Germany, revised Oct 2006.
    19. Gilboa Itzhak & Schmeidler David, 1994. "Infinite Histories and Steady Orbits in Repeated Games," Games and Economic Behavior, Elsevier, vol. 6(3), pages 370-399, May.
    20. Lu Hong & Scott Page, 1994. "Reducing informational costs in endowment mechanisms," Review of Economic Design, Springer;Society for Economic Design, vol. 1(1), pages 103-117, December.

    More about this item

    JEL classification:

    • C51 - Mathematical and Quantitative Methods - - Econometric Modeling - - - Model Construction and Estimation
    • E32 - Macroeconomics and Monetary Economics - - Prices, Business Fluctuations, and Cycles - - - Business Fluctuations; Cycles
    • O11 - Economic Development, Innovation, Technological Change, and Growth - - Economic Development - - - Macroeconomic Analyses of Economic Development
    • O47 - Economic Development, Innovation, Technological Change, and Growth - - Economic Growth and Aggregate Productivity - - - Empirical Studies of Economic Growth; Aggregate Productivity; Cross-Country Output Convergence

    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:spr:joecth:v:7:y:1996:i:2:p:237-66. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.