Anirban Dasgupta studies algorithms for large datasets, networks and related learning problems. His IIT Gandhinagar profile identifies large-scale data algorithms and social networks among his research interests.[ref]
He coauthored The Price of Stability for Network Design with Fair Cost Allocation by Elliot Anshelevich and others and Near-Optimal Network Design with Selfish Agents by Elliot Anshelevich and others. These works connect network optimization with individual route choices. A centrally cheap collection of paths may fail to persist if users can reduce their own payments by switching; conversely, a stable collection need not minimize the total cost.[ref]
The algorithmic challenge is to control both quantities at once: computational work required to find a network and inefficiency introduced by decentralized decisions. That is a concrete bridge between approximation guarantees and strategic behavior.
New to topics? Read the docs here!