Gabriele Farina: From a Young Mathematician to a Game Theory Innovator
Growing up in a small town nestled in the hilly wine region of northern Italy, Gabriele Farina was surrounded by an environment that was far removed from the academic world. Despite neither parent having a college degree, they nurtured his curiosity, particularly in mathematics, by providing him with the textbooks he desired and supporting his decision to attend a science-oriented high school.
By the age of 14, Farina had developed a fascination that would become the cornerstone of his career. “I was fascinated very early on by the idea that a machine could make predictions or decisions so much better than humans,” he reveals. This early interest set the stage for Farina’s journey into the world of algorithms and machine learning, as he marveled at how human-made mathematics could create systems with capabilities that sometimes surpassed human intellect.
A Pioneering Start in Computer Science
At just 16, Farina demonstrated his burgeoning talent by writing code to solve a board game played with his younger sister. This early foray into algorithms foreshadowed his future achievements in game theory and decision-making systems. “I used game after game to calculate the optimal move,” Farina recalls, although his sister was notably less thrilled by these revelations.
Today, Farina serves as an assistant professor in MIT’s Department of Electrical Engineering and Computer Science (EECS) and is a senior researcher at the Laboratory for Information and Decision Systems (LIDS). His research marries concepts from game theory with machine learning, optimization, and statistics to push the boundaries of decision-making theories and algorithms.
Educational and Professional Milestones
Farina’s academic journey began at Politecnico di Milano, where he studied automation and control engineering. However, his growing interest in understanding and expanding theoretical fundamentals led him down a more theoretical path. Encouraged by his advisor, Nicola Gatti, Farina pursued a Ph.D. in computer science at Carnegie Mellon University, despite initially being unaware of what a doctorate entailed.
During his doctoral studies, Farina was recognized for his research with awards and a Facebook Fellowship in Economics and Computation. Following his doctorate, he worked at Meta’s Fundamental AI Research Labs, where he co-developed Cicero, an AI with the capacity to outperform human players in strategic games involving alliances and bluffing.
Contributions to Game Theory and AI
Farina’s work at Meta was considered a pivotal step forward in AI research. “When we developed Cicero, we designed it so that it would not agree to an alliance if it was not in its interest,” Farina remarks, pointing to the system’s ability to assess the honesty and incentives of other players.
In 2025, Farina’s groundbreaking research was recognized with the National Science Foundation CAREER Award. His work seeks to simplify and solve real-world scenarios using game theory by finding stable points or “equilibria” in complex systems more efficiently.
Farina’s research interests include scenarios with “imperfect information,” such as poker, where players strategically withhold information. “Today we live in a world where machines are much better at bluffing than humans,” Farina notes, highlighting the potential of AI in strategic reasoning.
Revolutionizing Strategic Reasoning and AI
Farina’s recent endeavors brought him back to his roots in board games. By developing cost-effective algorithms, his team achieved unprecedented success in Stratego, a game previously resistant to superhuman AI performance. Farina expresses excitement over the economical achievements and the potential for these techniques to influence future AI developments.
“We’ve seen steady progress in developing algorithms that can reason strategically,” he asserts, underscoring his anticipation for their integration into the broader AI landscape.
For further details about Gabriele Farina’s pioneering work in AI and game theory, click Here.
“`
