Parthe Pandit (UCSD HDSI)
Monday, January 24t, 2022, 2-3pm
Abstract: In this talk I will present an equivalence between two problems, (i) the linear complementarity problem,
and (ii) weighted independence number of a graph. This provides insights in both directions. We obtain new
approximation strategies for the max/min weighted independent set problem. We also provide a refinement of
the Nash equilibrium for the Public Goods Games, a class of games among selfish agents in a network.
Based on work with Ankur Kulkarni.
Bio: Parthe is a postdoc at the Halıcıoğlu Data Science Institute at UCSD. He got his PhD from UCLA, and undergrad from IIT Bombay. His research interests span Statistics, Optimization, and Signal Processing.