Scalability和基于遗传算法的Agent委员会优化
Scalability and Optimisation of a Committee of Agents Using Genetic Algorithm
摘要:
人口委员会的代理人,通过使用神经网络学习实现模拟股票市场。每个委员会的代理,这被视为一个球员在一个游戏中,不断适应的架构,使用遗传算法的代理进行优化。代理人委员会通过以下程序买卖股票:(1)获得股票的当前价格;(2)预测股票的未来价格;(3)以给定的价格进行交易,直到所有参与者都满意为止。股票交易是按照以下规则进行的:(1)如果玩家预期价格上涨,那么它会尝试购买股票;(2)如果它预期价格下跌,那么它会出售股票;(3)玩家参与游戏的顺序是随机的。建议的程序被实施来模拟三种股票的交易,即道琼斯、纳斯达克和标准普尔500指数。观察到的球员和代理的数量与计算时间之间的线性关系,以运行完整的模拟。同时也发现,没有一个参与者具有垄断优势。
英文摘要:
A population of committees of agents that learn by using neural networks is implemented to simulate the stock market. Each committee of agents, which is regarded as a player in a game, is optimised by continually adapting the architecture of the agents using genetic algorithms. The committees of agents buy and sell stocks by following this procedure: (1) obtain the current price of stocks; (2) predict the future price of stocks; (3) and for a given price trade until all the players are mutually satisfied. The trading of stocks is conducted by following these rules: (1) if a player expects an increase in price then it tries to buy the stock; (2) else if it expects a drop in the price, it sells the stock; (3)and the order in which a player participates in the game is random. The proposed procedure is implemented to simulate trading of three stocks, namely, the Dow Jones, the Nasdaq and the S&P 500. A linear relationship between the number of players and agents versus the computational time to run the complete simulation is observed. It is also found that no player has a monopolistic advantage.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。