3 citations · 5 across the 12 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DC2025
Distributed MIS Algorithms for Rational Agents using Games
Nithin Salevemula, Shreyas Pai
We study the problem of computing a Maximal Independent Set (MIS) in distributed networks where each node is a rational agent whose payoff depends on whether it joins the MIS. Clas…
cs.DC2025
Message Optimality and Message-Time Trade-offs for APSP and Beyond
Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan +2
Round complexity is an extensively studied metric of distributed algorithms. In contrast, our knowledge of the \emph{message complexity} of distributed computing problems and its r…