Michal Feldman (Tel Aviv University), IIAS' Bruno Memorial Award Laureate, just gave a captivating talk on algorithmic game theory at LSE.

Her presentation, hosted by the London School of Economics Mathematics Department, shed light on the pragmatic shift towards approximation over steadfast optimality, challenging conventional paradigms.

In her talk, Michal Feldman provides a comprehensive overview of algorithmic game theory's evolution, emphasizing its increasing relevance in today's digitally driven landscape. Departing from traditional views, she advocates for approximation as a realistic approach in navigating the complexities of real-world scenarios.

Drawing upon examples from auction theory and online decision-making, Michal demonstrates how approximation can yield practical solutions to intricate problems. Despite acknowledging the challenges posed by human irrationality, she suggests leveraging insights from behavioral economics to refine existing models.

The full video is available here: https://youtu.be/e5U2aoDp40U