|
Research Area: Econ and Social Sys |
Profile
Arpita obtained her B.Tech from IIT Bombay in 2001, and her Ph.D. from Stanford University in 2006. For her thesis, she worked on network design problems, where she used convex optimization to design fast random walks on graphs. She joined Yahoo! Research in July 2006, where she has been working on problems in algorithmic game theory and mechanism design, particularly in the context of online auctions. In her spare time, she is an enthusiastic photographer.
Recent Publications, Projects and News
- Optimal Envy-free Pricing with Metric Substitutability Ning Chen; Arpita Ghosh; Sergei Vassilvitskii, ACM Conference on Electronic Commerce (EC'08), 2008 [view abstract]
- Externalities in Online Advertising Arpita Ghosh; Mohammad Mahdian, 17th International World Wide Web Conference (WWW), 2008 [view abstract]
- Charity Auctions on Social Networks Arpita Ghosh; Mohammad Mahdian, SODA 2008, 2008 [view abstract]
- Cost of Conciseness in Sponsored Search Auctions Abrams, Zoe ; Ghosh, Arpita ; Vee, Erik, Proc. 3rd International Workshop on Internet and Network Economics (WINE), 2007 [view abstract]
- Computing Optimal Bundles for Sponsored Search Ghosh, Arpita ; Nazerzadeh, Hamid ; Sundararajan, Mukund, Proc. 3rd International Workshop on Internet and Network Economics (WINE), 2007 [view abstract]
- Auctions with Revenue Guarantees for Sponsored Search Abrams, Zoe ; Ghosh, Arpita, Proc. 3rd International Workshop on Internet and Network Economics (WINE), 2007 [view abstract]
- The Discoverability of the Web Dasgupta, A. ; Ghosh, A. ; Kumar, R. ; Olston, C. ; Pandey, S. ; Tomkins, A., Proceedings of the Sixteenth International World Wide Web Conference (WWW), 2007 [view abstract]
- Minimizing Effective Resistance of a Graph Ghosh, Arpita ; Boyd, Stephen ; Saberi, Amin, To appear in SIAM Review, Problems and Techniques section, 2007 [view abstract]
- Designing Well-connected Networks via Convex Optimization (PhD Thesis) Ghosh, Arpita, Stanford University, 2006 [view abstract]
- Randomized Gossip Algorithms Boyd, Stephen ; Ghosh, Arpita ; Prabhakar, Balaji ; Shah, Devavrat, IEEE Transactions on Information Theory, Special issue of IEEE Transactions on Information Theory and IEEE/ACM Transactions on Networking, 2006 [view abstract]
- Upper Bounds on Algebraic Connectivity via Convex Optimization Ghosh, Arpita ; Boyd, Stephen, Linear Algebra and its Applications, 2006 [view abstract]
- Growing Well-Connected Graphs Ghosh, Arpita ; Boyd, Stephen, Proc.45th IEEE Conference on Decision and Control (CDC'06), 2006 [view abstract]
- Gossip Algorithms: Design, Analysis, and Applications Boyd, Stephen ; Ghosh, Arpita ; Prabhakar, Balaji ; Shah, Devavrat, IEEE Infocom, 2005 [view abstract]
- Optimal One-bit Quantization Magnani, Alessandro ; Ghosh, Arpita ; Gray, Robert M., IEEE Data Compression Conference (DCC), 2005 [view abstract]
- Variable Resolution Information Dissemination Ghosh, Arpita ; Greene, Dan ; Huang, Qingfeng ; Liu, Julia, Proc. IEEE Conference on Sensor and Ad Hoc Communications and Networks (SECON), 2005
- SIFT: A low complexity scheduler for the Internet Psounis, Konstantinos ; Ghosh, Arpita ; Prabhakar, Balaji ; Wang, Gang, Proc. 43rd Allerton Conference on Computing, Communication and Control, 2005
- Mixing Times of Random Walks on Geometric Random Graphs Boyd, Stephen ; Ghosh, Arpita ; Prabhakar, Balaji ; Shah, Devavrat, Proc. SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO 2005), 2005 [view abstract]