activity
20192026
most citedContextual Recommendations and Low-Regret Cutting-Plane Algorithms

1 citations · 1 across the 5 of their papers we have counts for

collaborators

8 papers

cs.LG2026

Compact Conformal Subgraphs

Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala +1

Conformal prediction provides rigorous, distribution-free uncertainty guarantees, but often yields prohibitively large prediction sets in structured domains such as routing, planni…

cs.DS2025

Why is My Route Different Today? An Algorithm for Explaining Route Selection

Aaron Schild, Sreenivas Gollapudi, Anupam Gupta +2

Users of routing services like Apple Maps, Google Maps, and Waze frequently wonder why a given route is proposed. This question particularly arises when dynamic conditions like tra…

cs.DS2025

Online Distributed Queue Length Estimation

Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im +2

Queue length monitoring is a commonly arising problem in numerous applications such as queue management systems, scheduling, and traffic monitoring. Motivated by such applications,…

cs.DS2022

Online Learning and Bandits with Queried Hints

Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im +2

We consider the classic online learning and stochastic multi-armed bandit (MAB) problems, when at each step, the online policy can probe and find out which of a small number ()…

cs.GT2022

Improved Price of Anarchy via Predictions

Vasilis Gkatzelis, Kostas Kollias, Alkmini Sgouritsa +1

A central goal in algorithmic game theory is to analyze the performance of decentralized multiagent systems, like communication and information networks. In the absence of a centra…

cs.LG20211 cited

Contextual Recommendations and Low-Regret Cutting-Plane Algorithms

Sreenivas Gollapudi, Guru Guruganesh, Kostas Kollias +3

We consider the following variant of contextual linear bandits motivated by routing applications in navigational engines and recommendation systems. We wish to learn a hidden -d…