|
Gagan Goel3rd year Ph.D. student in A.C.O. (Algorithms, Combinatorics and Optimization),Advisers: Vijay Vazirani and Milena Mihail, College of Computing, Georgia Institute of Technology. CV: pdf Research Interests: Algorithmic Game Theory, Algorithms and Models for the Internet and other Complex Networks, and Approximation Algorithms. Publications & Tech Reports: - Online Budgeted Matching in Random Input Models with applications to Adwords. To appear in SODA, 08 with Aranyak Mehta. - Adwords Auctions with Decreasing Valuation Bids. WINE, 07 with Aranyak Mehta. - Towards Topology Aware Networks. INFOCOM, 07. with Milena Mihail,Amin Saberi,Christos Gkantsidis. - Minimizing Flow Time on Related Machines. B.Tech Thesis, 2004. Advisors: Naveen Garg, Amit Kumar. Working Papers - On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. Submitted with Deeparnab Chakrabarty. - Computing Market Equilibrium for more general utilities. In preparation with Deeparnab Chakrabarty. - Increasing Revenue from Top Ads. In progress. Contact: - Email: gagang AT cc DOT gatech DOT edu - Office: Klaus 2116 - Phone: 678-772-3352 Links - Online book store: |
|---|