Difference between revisions of "Agent-based computational economics"

From Simulace.info
Jump to: navigation, search
(→‎Learning)
(→‎Learning)
Line 23: Line 23:
  
 
===Learning===
 
===Learning===
−
In order to capture dynamic nature of real markets agents must be able to learn which means change their behavior according to the situations they encounter. (zdroj) Agents in ACE can use various types of learning algorithms. Selection of an algorithm can fundamentally influence the results of the simulation<ref>TESFATSION, Leigh. Modeling Economies as Complex Adaptive Systems. Agent-Based Computational Economics: Modeling Economies as Complex Adaptive Systems [online]. 2010-03-24, 2010-03-24 [cit. 2012-06-18]. Dostupné z: http://www2.econ.iastate.edu/classes/econ308/tesfatsion/ACETutorial.pdf</ref>. Roth-Elev algorithm is one of the possible choices:
+
In order to capture dynamic nature of real markets agents must be able to learn which means change their behavior according to the situations they encounter. (zdroj) Agents in ACE can use various types of learning algorithms. Selection of an algorithm can fundamentally influence the results of the simulation<ref>TESFATSION, Leigh. Modeling Economies as Complex Adaptive Systems. Agent-Based Computational Economics: Modeling Economies as Complex Adaptive Systems [online]. 2010-03-24, 2010-03-24 [cit. 2012-06-18]. Available at: http://www2.econ.iastate.edu/classes/econ308/tesfatsion/ACETutorial.pdf</ref>. Roth-Elev algorithm is one of the possible choices:
  
−
# Initialize action propensities to an initial
+
# Initialize action propensities to an initial propensity value.
−
propensity value.
+
# Generate choice probabilities for all actions using current propensities.
−
# Generate choice probabilities for all actions
+
# Choose an action according to the current choice probability distribution.
−
using current propensities.
+
# Update propensities for all actions using the reward (profits) for the last chosen action.
−
# Choose an action according to the current
 
−
choice probability distribution.
 
−
# Update propensities for all actions using the
 
−
reward (profits) for the last chosen action.
 
 
# Repeat from step 2.
 
# Repeat from step 2.
  

Revision as of 17:04, 18 June 2012


Resarch

Main pillars of ACE resarch[1]:

  • Empirical
  • Normative
  • Qualitativ insight and theory generation
  • Methodological advancement

Empirical

This area area stands for explaining possible reasons for observed regularities.


Computational world models

In order for agents to operate in computational worlds, methods and protocols are required. These methods and protocols enable interactions between agents themselves, between agents and the world or artificial institutions e.g. market.[2] In double auction model, agents can have following methods: 

getWorldEventSchedule(clock time);
getWorldProtocols (collusion, insolvency);
getMarketProtocols (posting, matching, trade, settlement);

Learning

In order to capture dynamic nature of real markets agents must be able to learn which means change their behavior according to the situations they encounter. (zdroj) Agents in ACE can use various types of learning algorithms. Selection of an algorithm can fundamentally influence the results of the simulation[3]. Roth-Elev algorithm is one of the possible choices:

  1. Initialize action propensities to an initial propensity value.
  2. Generate choice probabilities for all actions using current propensities.
  3. Choose an action according to the current choice probability distribution.
  4. Update propensities for all actions using the reward (profits) for the last chosen action.
  5. Repeat from step 2.

Other computing methods

  • Linear Equations and Iterative Methods (Currently empty)
  • Optimization
  • Nonlinear Equations
  • Approximation
  • Numerical Integration and Differentiation
  • Monte Carlo and Simulation Methods (Currently empty)
  • Quasi-Monte Carlo Methods (Currently empty)
  • Finite Difference Methods (Currently empty)
  • Projection Methods for Functional Equations (Currently empty)
  • Numerical Dynamic Programming (Currently empty)
  • Regular Perturbations of Simple Systems (Currently empty)
  • Regular Perturbations in Multidimensional Systems (Currently empty)
  • Advanced Asymptotic Methods (Currently empty)
  • Solution Methods for Perfect Foresight Models (Currently empty)
  • Solving Rational Expectations Models

References

  1. ↑ TESFATSION, Leigh. Agent-Based Computational Economics: Growing Economies from the Bottom Up. IOWA STATE UNIVERSITY. Agent-Based Computational Economics [online]. 2012-05-02, 2012-05-02 [cit. 2012-06-18]. Dostupné z: http://www2.econ.iastate.edu/tesfatsi/ace.htm
  2. ↑ TESFATSION, Leigh. Modeling Economies as Complex Adaptive Systems. Agent-Based Computational Economics: Modeling Economies as Complex Adaptive Systems [online]. 2010-03-24, 2010-03-24 [cit. 2012-06-18]. Dostupné z: http://www2.econ.iastate.edu/classes/econ308/tesfatsion/ACETutorial.pdf
  3. ↑ TESFATSION, Leigh. Modeling Economies as Complex Adaptive Systems. Agent-Based Computational Economics: Modeling Economies as Complex Adaptive Systems [online]. 2010-03-24, 2010-03-24 [cit. 2012-06-18]. Available at: http://www2.econ.iastate.edu/classes/econ308/tesfatsion/ACETutorial.pdf
Retrieved from "http://www.simulace.info/index.php?title=Agent-based_computational_economics&oldid=1179"