作者: Jacob W. Crandall , Michael A. Goodrich , Asad Ahmed
DOI:
关键词:
摘要: Automated agents for electricity markets, social networks, and other distributed networks must repeatedly interact with intelligent agents, often without observing associates' actions or payoffs (i.e., minimal information). Given this reality, our goal is to create algorithms that learn effectively in repeated games played information. As applications of machine learning, the success a learning algorithm depends on its bias. To better understand what biases are most successful, we analyze previously published multi-agent (MAL) algorithms. We then describe new adapts successful bias from literature information environments. Finally, compare performance ten