We are pleased to invite you to the next Research Seminar with  Oleksii Ignatenko,  Professor at Ukrainian Catholic University, and lecturer at Kyiv-Mohyla Academy.

Seminar topic: Machine learning methods applications in repeated Prisoners' dilemma tournaments

Prisoner's dilemma is the most known and investigated 2x2 game in Game Theory. Rationality demands players to defect, while general common sense implicates that wasting resources is bad for everyone. This gap between an ideal rationality-based theoretical framework and real behavior inspired many ideas on how "to solve" a prisoner's dilemma. In the late 1970s and early 1980s, Robert Axelrod proposed a series of game theory competitions using computers, later called the "Axelrod tournaments." Axelrod invited academics to submit computer programs that would compete against each other in a round-robin format, with each pair of strategies playing multiple rounds of the Prisoner's Dilemma. The AT fundamentally changed how researchers understood the evolution of cooperation. Still, the exact reasons why Tit-for-Tat was the winner and how to predict winners for tournaments with other sample strategies remain unclear. 
The study of iterated prisoner's dilemma (IPD) contests is a noteworthy area of research. In real-world cases, interactions are not short-term but ongoing and repetitive, and every choice has a specific outcome for those involved. We will try to investigate the result of tournaments as a black-box model. We perform simulations, gather data and train models to predict the result. Then we are trying to explain the result, using additional context variables and talk about general usage of machine learning methods for such problems. 

    Date: November 11th
    Time: 18:00 Kyiv time

Registration is at the link: https://forms.office.com/e/cehQZSrMDQ?origin=lprLink
All registered participants will receive a link to the event.

See you soon!