MoL-2017-22: Wang, Shuai (2017) Turing Learning with Nash Memory. [Report]
Preview |
Text
MoL-2017-22.text.pdf Download (9MB) | Preview |
Abstract
Turing Learning is a method for the reverse engineering of agent behaviors. This approach was inspired by the Turing test where a machine can pass if its behaviour is indistinguishable from that of a human. Nash memory is a memory mechanism for coevolution. It guarantees monotonicity in convergence. This thesis explores the integration of such memory mechanism with Turing Learning for faster learning of agent behaviors. We employ the Enki robot simulation platform and learns the aggregation behavior of epuck robots. Our experiments indicate that using Nash memory can reduce the computation time by 35.4% and results in faster convergence for the aggregation game. In addition, we present TuringLearner, the first Turing Learning platform. Keywords: Turing Learning, Nash Memory, Game Theory, Multi-agent System.
| Item Type: | Report |
|---|---|
| Report Nr: | MoL-2017-22 |
| Series Name: | Master of Logic Thesis (MoL) Series |
| Year: | 2017 |
| Subjects: | Computation Logic |
| Depositing User: | Dr Marco Vervoort |
| Date Deposited: | 12 Oct 2017 14:32 |
| Last Modified: | 12 Oct 2017 14:38 |
| URI: | https://eprints.illc.uva.nl/id/eprint/1559 |
Actions (login required)
 |
View Item |
