# Gagan Goel

According to our database

Collaborative distances:

^{1}, Gagan Goel authored at least 33 papers between 2007 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Budget Feasible Procurement Auctions.

Operations Research, 2018

2016

Revenue Monotone Auctions.

Encyclopedia of Algorithms, 2016

Reservation Exchange Markets for Internet Advertising.

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Core-competitive Auctions.

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014

Submodularity Helps in Nash and Nonsymmetric Bargaining Games.

SIAM J. Discrete Math., 2014

Allocating tasks to workers with matching constraints: truthful mechanisms for crowdsourcing markets.

Proceedings of the 23rd International World Wide Web Conference, 2014

Revenue monotone mechanisms for online advertising.

Proceedings of the 23rd International World Wide Web Conference, 2014

Randomized Revenue Monotone Mechanisms for Online Advertising.

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Clinching auctions beyond hard budget constraints.

Proceedings of the ACM Conference on Economics and Computation, 2014

Connectivity analysis of indoor wireless sensor networks using realistic propagation models.

Proceedings of the 17th ACM International Conference on Modeling, 2014

Ensemble Empirical Mode Decomposition for time series prediction in wireless sensor networks.

Proceedings of the International Conference on Computing, Networking and Communications, 2014

Mechanism Design for Crowdsourcing Markets with Heterogeneous Tasks.

Proceedings of the Seconf AAAI Conference on Human Computation and Crowdsourcing, 2014

Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets.

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

Clinching Auction with Online Supply.

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Mechanism design for fair division: allocating divisible items without payments.

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Positive results for mechanism design without money.

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012

Polyhedral clinching auctions and the adwords polytope.

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Fuzzy Logic Representation for Student Modelling - Case Study on Geometry.

Proceedings of the Intelligent Tutoring Systems - 11th International Conference, 2012

Matching with Our Eyes Closed.

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

A Perfect Price Discrimination Market Model with Production, and a Rational Convex Program for It.

Math. Oper. Res., 2011

Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations.

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Budget constrained auctions with heterogeneous items.

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It.

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Single-Parameter Combinatorial Auctions with Partially Public Valuations.

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Combinatorial Problems with Discounted Price Functions in Multi-agent Systems.

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009

Algorithms for budgeted auctions and multi-agent covering problems.

PhD thesis, 2009

Efficiency of (revenue-)optimal mechanisms.

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions.

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

Efficiency, Fairness and Competitiveness in Nash Bargaining Games.

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Online budgeted matching in random input models with applications to Adwords.

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP.

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Adwords Auctions with Decreasing Valuation Bids.

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Towards Topology Aware Networks.

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007