AlgoIL #1: At the intersection of graph algorithms and game theory

AlgoIL is happy to announce our first meetup :)

We are thrilled to host Shay Palachy as our very first speaker, who will talk to us about the exciting intersection of graph algorithms and game theory.

The talk will be in hebrew, and will assume background equivalent to undergraduate-level graph theory and algorithms.

Agenda:

18:00 - Gathering and snacks

18:30 - Opening words

18:40 - Shay Palachy - Computing Nash equilibria in graphical games

Abstract: Graphical games are a type of mathematically formalized games played over a graph, where players payoffs only depend on the actions of their neighbours. In this talk we will give a short introduction to general game theory and to graphical games in particular, and then go on to examine three algorithms for computing Nash equilibria in graphical games.

About Shay: Shay (http://www.shaypalachy.com/) works as the Lead Data Scientist of Zencity (http://zencity.io/) while finishing his M.Sc. in Computer Science at HUJI. In his spare time he also heads some data science community initiatives, like DataHack (http://datahack-il.com/), NLPH (https://github.com/NLPH/NLPH) and the DataTalks meetup series (https://www.meetup.com/DataHack/).

Thank you Taboola for the generous hospitality :)