I am a PhD student working in the area of applied algorithms. I am being advised by Mike Saks. I also work with S Muthukrishnan, Liviu Iftode and Rebecca Wright.
My Primary research interest is algorithms. I think it is very fruitful to apply algorithmic techniques to real world problems. Currently, i am looking at applications in the following fields.
When we design graph algorithms and apply them to problems on the internet, the input to these algorithms comes from self-interested agents. These agents have economic incentives to give false inputs such that the outcome (though not optimal) is better for them. How should we design algorithms taking these economic incentives that agents have and still achieve optimal solutions.
I am looking at a specific definition of privacy called differential privacy. Releasing data in a private manner reduces the utility of the data. I want to quantify this privacy-utility trade-off and device algorithms for private release of data such that the utility is not diminished.
Do people on online social networks behave strategically ? How does their behavior evolve with different parameters the age in the social network, reaction to other peoples behavior ?
Motivated by ads on the Internet and other scenarios, we study cardinal auctions in which we let bidders specify not only their bid but also the number of items that will be sold via the auction. There are two natural auctions for this setting, one based on Vickrey-Clarke-Groves (VCG), and the other based on minimum pay property (MPP). We perform detailed analyses of VCG vs MPP for efficiency as well as revenue in equilibrium, for risk neutral and risk averse bidders, and show PoA type results.
We use the direction of links in directed online social networks, to find hierarchy in it. We propose a new measure of heirarchy in directed networks and give an efficient algorithm to calculate this measure for gneral directed graphs. We use this to show how hierarchy emerges in directed online social networks for different networks including YouTube, Flickr, delicious, curated lists on Twitter etc.
We study the spread of news in a Social Network when the users are strategic and show that news propagation follows a threshold phenomenon: “high-quality” news spreads throughout the network while “low quality” news spreads to very few nodes in the network.
We give a differentially private mechanism to release the result of any fixed count query(one that counts the number of rows in a database that fit a particular requirement). The output is universally optimal for all minimax information consumers. Additionally, we show how to release query results at multiple levels of privacy in a collusion-resistant manner.
In this we study the Turnpike Reconstruction Problem. We give a new algorithm that solves this problem for the case of unique distances. We also give an approach using algebriac number theory to solve the general case.
Helped with the Topics in Game Theory, Combinatorial Optimization, Discrete Structures, Programming Methodology courses at Rutgers University.
Worked with real time search team to predict interesting news from posts social networks
Worked with the Networking Team : Implemented the IPSec Protocol for the Network Stack developed on a new Chip Multiprocessor.
You can find my previous web-page here.
Mangesh Gupte — firstname@cs.university.edu — 732-993-4771
Texture from :