Lunch In Theory This Thursday (12:00, 11/6, GCS 502c)

[Devansh Gupta]

Hi all,

Please join us for Lunch in Theory this Thursday, 10/30 at 12:00 in GCS 502c. 

Reminder: This week I have decided to treat everyone with pizza, so please DO NOT bring your own lunch for this talk.

This week we have an external speaker from Princeton, Gon Buzgalo, giving a talk on Game Theory. Please find the title and abstract attached.

We look forward to having you all in the talk.

Best,

Devansh

Title: The Hidden Game Problem

Abstract: This talk explores a class of games with large strategy spaces, motivated by challenges in AI alignment and multi-agent language games. We introduce the Hidden Game Problem, where each player possesses an unknown subset of strategies that consistently yield higher rewards than others. The central question is whether efficient regret minimization algorithms can be designed to discover and exploit such hidden structures, leading to equilibrium in these subgames while maintaining rationality in general. We answer this question affirmatively by developing a composition of regret minimization techniques that achieve optimal external and swap regret bounds. Our approach ensures rapid convergence to correlated equilibria in hidden subgames, leveraging the hidden game structure for improved computational efficiency.

Based on a joint work with Noah Golowich and Elad Hazan https://arxiv.org/abs/2510.03845

Bio: Gon Buzaglo is a second-year Ph.D. student in Computer Science at Princeton University, advised by Prof. Elad Hazan. His research focuses on theoretical machine learning, with current interests in AI alignment, optimization, online control, and learning in games. Before Princeton, he completed his M.Sc. at the Technion under Prof. Daniel Soudry, working on generalization in deep learning in collaboration with Prof. Nathan Srebro, and his B.Sc. in Computer Science and Physics, during which he interned with Prof. Michal Irani at the Weizmann Institute studying memorization in neural networks.