Gagan Goel's Home Page

	Gagan Goel 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: - Efficiency, Fairness, and Competitiveness in Nash Bargaining Games. To appear in WINE, 08. with Deeparnab Chakrabarty, Vijay Vazirani, Lei Wang and Changyuan Yu.. - On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. FOCS, 08. with Deeparnab Chakrabarty. - Online Budgeted Matching in Random Input Models with applications to Adwords. 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. Thesis advisors: Naveen Garg, Amit Kumar. Working Papers - Some Computational and Game Theoretic Issues in Nash and Non-symmetric Bargaining Games. In preparation with Deeparnab Chakrabarty, Vijay Vazirani, Lei Wang, Changyuan Yu.. - Computing Market Equilibrium for heirarchical spending constraints. In preparation with Deeparnab Chakrabarty. Contact: - Email: gagang AT cc DOT gatech DOT edu - Office: Klaus 2116 - Phone: 678-772-3352 Links - Online book store: . Started by college friends of mine. Good place for sending gifts in india.

Gagan Goel

   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:
  - Efficiency, Fairness, and Competitiveness in Nash Bargaining Games. To appear in WINE, 08. with Deeparnab Chakrabarty, Vijay Vazirani, Lei Wang and Changyuan Yu..
  - On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. FOCS, 08. with Deeparnab Chakrabarty.
  - Online Budgeted Matching in Random Input Models with applications to Adwords. 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. Thesis advisors: Naveen Garg, Amit Kumar.

   Working Papers
  - Some Computational and Game Theoretic Issues in Nash and Non-symmetric Bargaining Games. In preparation with Deeparnab Chakrabarty, Vijay Vazirani, Lei Wang, Changyuan Yu..
  - Computing Market Equilibrium for heirarchical spending constraints. In preparation with Deeparnab Chakrabarty.

  Contact:
  - Email: gagang AT cc DOT gatech DOT edu
  - Office: Klaus 2116
  - Phone: 678-772-3352

  Links
  - Online book store:

. Started by college friends of mine. Good place for sending gifts in india.