Sushmita Gupta

Short CV: Sushmita Gupta is currently a Professor at the Institute of Mathematical Sciences. She is interested in design and analysis of algorithms. In the last few years she have focused on studying problems arising in computational social choice and algorithmic game theory from the perspective of parameterized complexity. Other interests include streaming and online algorithms. She has a Ph.D. from University of Southern Denmark, Denmark.

Title of Talk 1: An invitation to algorithmic game theory.

Synopsis: Algorithmic game theory is a fundamental topic in modern algorithm design, with far-reaching applications that span economics, mathematics, the physical sciences, and even the humanities. Emerging during the dot-com boom of the late 1990s—when online marketplaces revolutionized economic interactions—it provides an algorithmic perspective on game-theoretic problems, focusing on efficient computation with provable performance guarantees.

This talk will introduce algorithmic game theory through its real-world impact on some of society’s most consequential challenges, including resource allocation, market design, traffic routing, and contract design. By exploring these applications, we will highlight how algorithmic insights can shape decision-making in complex, strategic environments.

Title of Talk 2: Research Opportunities in Computer Science: Computational Social Choice and related fields 

Synopsis: Computational social choice is an exciting interdisciplinary field at the intersection of computer science, economics, and political science. It explores how algorithms can be designed to support fair and efficient decision-making in settings such as voting, resource allocation, and collective decision-making. With the rise of artificial intelligence, digital democracy, and decentralized systems, this field offers a wealth of research opportunities with both theoretical depth and real-world impact.

In this talk, we will survey key problems in computational social choice, highlight connections to related areas such as mechanism design, algorithmic game theory, and machine learning, and discuss open research directions. Whether you are drawn to theoretical challenges or motivated by practical applications, this talk will offer insights into how you can contribute to this growing and impactful area of computer science.  

Title of Talk 3: Graph Theory: The Key to Designing and Influencing Competitions

Synopsis: Competitions, from sports tournaments to online ranking systems and even complex decision-making processes, rely on structured formats that influence fairness, strategy, and outcomes. Graph theory provides a powerful framework for analyzing and designing these competitive structures, enabling organizers to optimize scheduling, ensure competitive fairness, maximize viewer engagement and even predict or influence results.

In this talk, we will explore how graph-theoretic concepts can be applied to the design and manipulation of competitions. We will discuss real-world applications, highlight key mathematical challenges, and examine strategic manipulations, such as seeding and scheduling biases. Whether you are interested in theoretical insights or practical implications, this talk will showcase the elegance and versatility of graph theory in shaping competitive environments.