Gagan Goel is a research scientist at Google. His research interests lie in the design and analysis of algorithms and its applications to optimization, market design, and game theory. He received his Ph.D. in Algorithms, Combinatorics, and Optimization from Georgia Tech in Aug 2009. Before that he received his B.Tech. in Computer Science and Engineering from Indian Institute of Technology, Delhi in Aug 2004.
“A Perfect Price Discrimination Market Model with Production, and a Rational Convex Program for it.”, Gagan Goel, Vijay Vazirani, Math of Operations Research, vol. 36 (2011), pp. 762-782.
[mor.journal.informs.org] [pdf] [search]
“Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations”, Gagan Aggarwal, Gagan Goel, Chinmay Karande, Aranyak Mehta, SODA 2011.
[abstract] [arxiv.org] [pdf] [search]
“Efficiency of (Revenue-)Optimal Mechanisms”, Gagan Aggarwal, Gagan Goel, Aranyak Mehta, Proceedings of the 10th ACM Conference on Electronic Commerce, 2009.
[pdf] [search]
“A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for it.”, Gagan Goel, Vijay Vazirani, SAGT, 2010.
[search]
“Budget constrained auctions with heterogeneous items”, Sayan Bhattacharya, Gagan Goel, Sreenivas Gollapudi, Kamesh Munagala, STOC, 2010, pp. 379-388.
[doi.acm.org] [search]
“On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP”, Deeparnab Chakrabarty, Gagan Goel, SIAM J. Comput., vol. 39 (2010), pp. 2189-2211.
[doi] [search]
“Optimal Approximation Algorithms for Multi-agent Combinatorial Problems with Discounted Price Functions”, Gagan Goel, Pushkar Tripathi, Lei Wang, FSTTCS, 2010.
[arxiv.org] [search]
“Single Parameter Combinatorial Auctions with Partially Public Valuations”, Gagan Goel, Chinmay Karande, Lei Wang, SAGT 2010.
[arxiv.org] [search]
“Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions”, Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei Wang, FOCS, 2009, pp. 755-764.
[doi.ieeecomputersociety.org] [search]
“Efficiency, Fairness and Competitiveness in Nash Bargaining Games”, Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang, Changyuan Yu, WINE, 2008, pp. 498-505.
[doi] [search]
“On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP”, Deeparnab Chakrabarty, Gagan Goel, FOCS, 2008, pp. 687-696.
[doi] [search]
“Online budgeted matching in random input models with applications to Adwords”, Gagan Goel, Aranyak Mehta, Proc. 19th ACM-SIAM Symposium on Discrete Algorithms, 2008, pp. 982-991.
[search]
“Adwords Auctions with Decreasing Valuation Bids”, Gagan Goel, Aranyak Mehta, Internet and Network Economics (WINE), 2007, pp. 335-340.
[search]
“Towards Topology Aware Networks”, Christos Gkantsidis, Gagan Goel, Milena Mihail, Amin Saberi, INFOCOM, 2007, pp. 2591-2595.
[doi] [search]