skip to main content
10.1145/1647420.1647437acmconferencesArticle/Chapter ViewAbstractPublication PagesadaConference Proceedingsconference-collections
research-article

On using Ada to solve problems in computational economics and related disciplines with concurrent, multiagent algorithms

Published:01 November 2009Publication History

ABSTRACT

Multiagent algorithms are widely used in computational economics and other social sciences to solve theoretical and practical problems. Because such algorithms are inherently concurrent and multithreaded, Ada's constructs for handling communications between concurrent processes and avoiding interference between them make the language very well suited to solving these problems, particularly given developments in multi-core CPU chip-making. This paper provides a concrete example of how Ada assists in solving problems in computational economics and related disciplines that work with multiagent systems. Solving a simple problem illustrates visualizing the agents as Ada tasks, using UML use cases and synchronization diagrams to design the communications patterns between agents, and applying protected objects and functions to avoid computational indeterminacy.

References

  1. Shoham, Y. and Leyton-Brown, K., 2009: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations, Cambridge University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Kendrick, D. A., Mercado, P. R., and Amman, H. M., 2006: Computational Economics, Princeton University Press.Google ScholarGoogle Scholar
  3. Weitzel, T., 2004: Economics of Standards in Information Networks, Physica-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Chamley, C. P., 2004: Rational Herds, Economic Models of Social Learning, Cambridge University Press.Google ScholarGoogle Scholar
  5. Tesfatsion, T., 2009: Agent-Based Computational Economics: Growing Economies from the Bottom Up, available at http://www.econ.iastate.edu/tesfatsi/ace.eduGoogle ScholarGoogle Scholar
  6. Burns, A. and A. Wellings, A., 1998:, Concurrency in Ada, 2nd ed., Cambridge University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Cormen, T. H., Leiserson, C. E., and Rivest, R. L., 1997: Introduction to Algorithms, MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Booch, G., Rumbaugh, J., and Jacobson, I., 1999: The Unified Modeling Language User Guide, Addison Wesley Longman. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Rumbaugh, J., Jacobson, I., and Booch, G., 1999: The Unified Modeling Language Reference Manual, Addison Wesley Longman. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Douglass, B. P., 1998: Real-Time UML: Developing Efficient Objects for Embedded Systems, 1st edition, Addison Wesley Longman. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Cohen, N. H., 1996: Ada as a Second Language, 2nd edition, McGraw-Hil. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Sedgewick, R., 1998: Algorithms, 2nd edition, Addison-Wesley. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Davis, R. and Smith, R. G., 1983: Negotiation as a metaphor for distributed problem solving, Artificial Intelligence, 20, 63--109.Google ScholarGoogle ScholarCross RefCross Ref
  14. Leontief, W., 1986: Input-Output Economics, 2nd edition, Oxford University Press.Google ScholarGoogle Scholar

Index Terms

  1. On using Ada to solve problems in computational economics and related disciplines with concurrent, multiagent algorithms

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)1

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!