IMSc Webinar

A logical description of strategizing in social network games

Ramit Das

IMSc

Webinar: join at https://zoom.us/j/99018916192?pwd=Vnd3YW1RbisxNlVhZGN5RXYvMVZ5Zz09 In social network games, players are connected by a social network graph, and payoffs for players are determined by choices of players in their neighbourhood. We consider improvement dynamics of such games. We propose a modal logic for reasoning about strategies in these games. Within the logic, notions like Nash equilibrium and (weak) finite improvement property are easily defined. We show that the logic is decidable and that the valid formulas admit a complete axiomatization.