Can good learners always compensate for poor learners?

Keith Sullivan, Liviu Panait, Gabriel Balan, Sean Luke
2006 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems - AAMAS '06  
Can a good learner compensate for a poor learner when paired in a coordination game? Previous work has given an example where a special learning algorithm (FMQ) is capable of doing just that when paired with a specific less capable algorithm even in games which stump the poorer algorithm when paired with itself. In this paper, we argue that this result is not general. We give a straightforward extension to the coordination game in which FMQ cannot compensate for the lesser algorithm. We also
more » ... vide other problematic pairings, and argue that another highquality algorithm cannot do so either.
doi:10.1145/1160633.1160777 dblp:conf/atal/SullivanPBL06 fatcat:ozlb5yo2zbedhbspaeknsajaze