In game theory, generalists sometimes win out over specialists

MIT researchers found that generalist algorithms can outperform specialists in imperfect-information games. The study, presented at the International Conference on Learning Representations, analyzed algorithms training neural networks for zero-sum competitions. The work challenges long-held assumptions about specialist advantages in such strategic settings.