Professor Presents Research on Online Research Allocation

Behind the computing tools we use every day, there is complex research behind the building blocks of them. 

The 56th Annual ACM Symposium on Theory of Computing (STOC) was held June 24-28. It covered groundbreaking research related to the theory of computing.

School of Computer Science Assistant Professor Sahil Singla, a key contributor to the conference, organized a workshop and presented a research paper. His work focuses on algorithm design, particularly algorithms with uncertain inputs.

"Our goal is to create online algorithms that can make the best decisions even without knowing future inputs," Singla said.

His workshop, Online Resource Allocation, addressed how to efficiently distribute limited resources to fulfill sequential requests while maximizing social welfare.

The allocation of online resources impacts people’s lives in many ways. The topic has several everyday applications, such as managing airplane and concert tickets, ridesharing platforms like Uber and Lyft, and online advertisements on websites like Google and Meta.

Along with the workshop, Singla published a paper at the conference titled Supermodular Approximation of Norms and Applications. The paper explores online scheduling to fulfill sequential requests while minimizing the total resources required.