|Abstract||This paper presents a GA-based multi-agent reinforce- ment learning bidding approach (GMARLB) for perform- ing multi-agent reinforcement learning. GMARLB inte- grates reinforcement learning, bidding and genetic algo- rithms. The general idea of our multi-agent systems is as follows: There are a number of individual agents in a team, each agent of the team has two modules: Q module and CQ module. Each agent can select actions to be performed at each step, which are done by the Q module. While the CQ module determines at each step whether the agent should continue or relinquish control. Once an agent relinquishes its control, a new agent is selected by bidding algorithms. We applied GA-based GMARLB to the Backgammon game. The experimental results show GMARLB can achieve a su- perior level of performance in game-playing, outperforming PubEval, while the system uses zero built-in knowledge.|
|Keywords||No keywords specified (fix it)|
|Categories||No categories specified (fix it)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Chris Thornton (1997). Brave Mobots Use Representation: Emergence of Representation in Fight-or-Flight Learning. Minds and Machines 7 (4):475-494.
Pierre Barbaroux & Gilles Enée (2005). Spontaneous Coordination and Evolutionary Learning Processes in an Agent-Based Model. Mind and Society 4 (2):179-195.
Ron Sun, Todd Peterson & Edward Merrill, Bottom-Up Skill Learning in Reactive Sequential Decision Tasks.
Roland Mühlenbernd (2011). Learning with Neighbours. Synthese 183 (S1):87-109.
Added to index2009-06-13
Total downloads4 ( #178,434 of 548,941 )
Recent downloads (6 months)1 ( #63,511 of 548,941 )
How can I increase my downloads?