Gagan Goel

Games Econ. Behav., 2020

2019

Pareto Efficient Auctions with Interest Rates.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Budget Feasible Procurement Auctions.

[BibT_eX]

[DOI]

Nima Anari

Oper. Res., 2018

2016

Revenue Monotone Auctions.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Reservation Exchange Markets for Internet Advertising.

[BibT_eX]

[DOI]

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

2015

Polyhedral Clinching Auctions and the AdWords Polytope.

[BibT_eX]

[DOI]

J. ACM, 2015

Core-competitive Auctions.

[BibT_eX]

[DOI]

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

2014

Submodularity Helps in Nash and Nonsymmetric Bargaining Games.

[BibT_eX]

[DOI]

Deeparnab Chakrabarty

SIAM J. Discret. Math., 2014

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

[BibT_eX]

[DOI]

Nima Anari

CoRR, 2014

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

[BibT_eX]

[DOI]

Adish Singla

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

Revenue monotone mechanisms for online advertising.

[BibT_eX]

[DOI]

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

Randomized Revenue Monotone Mechanisms for Online Advertising.

[BibT_eX]

[DOI]

MohammadTaghi Hajiaghayi

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

Clinching auctions beyond hard budget constraints.

[BibT_eX]

[DOI]

Proceedings of the ACM Conference on Economics and Computation, 2014

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Dimitrios Hatzinakos

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

Mechanism Design for Crowdsourcing Markets with Heterogeneous Tasks.

[BibT_eX]

[DOI]

Adish Singla

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.

[BibT_eX]

[DOI]

Nima Anari

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

2013

Clinching Auction with Online Supply.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Positive results for mechanism design without money.

[BibT_eX]

[DOI]

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

2012

Budget-Constrained Auctions with Heterogeneous Items.

[BibT_eX]

[DOI]

Theory Comput., 2012

Mechanism Design for Fair Division

[BibT_eX]

[DOI]

CoRR, 2012

Truthful Mechanisms for Proportionally Fair Allocations

[BibT_eX]

[DOI]

CoRR, 2012

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

[BibT_eX]

[DOI]

Sébastien Lallé

Vanda Luengo

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

Matching with Our Eyes Closed.

[BibT_eX]

[DOI]

Pushkar Tripathi

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.

[BibT_eX]

[DOI]

Vijay V. Vazirani

Math. Oper. Res., 2011

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

[BibT_eX]

[DOI]

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

2010

Approximability of combinatorial problems with multi-agent submodular cost functions.

[BibT_eX]

[DOI]

SIGecom Exch., 2010

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

[BibT_eX]

[DOI]

Deeparnab Chakrabarty

SIAM J. Comput., 2010

Single-Parameter Combinatorial Auctions with Partially Public Valuations.

[BibT_eX]

[DOI]

Chinmay Karande

Lei Wang

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

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

[BibT_eX]

[DOI]

Pushkar Tripathi

Lei Wang

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.

[BibT_eX]

[DOI]

PhD thesis, 2009

Optimal Approximation Algorithms for Multi-agent Combinatorial Problems with Discounted Price Functions

[BibT_eX]

[DOI]

Pushkar Tripathi

Lei Wang

CoRR, 2009

Budget Constrained Auctions with Heterogeneous Items

[BibT_eX]

[DOI]

Sreenivas Gollapudi

Kamesh Munagala

CoRR, 2009

Efficiency of (revenue-)optimal mechanisms.

[BibT_eX]

[DOI]

Gagan Aggarwal

Aranyak Mehta

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

2008

Efficiency, Fairness and Competitiveness in Nash Bargaining Games.

[BibT_eX]

[DOI]

Deeparnab Chakrabarty

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

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

[BibT_eX]

[DOI]

Aranyak Mehta

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

2007

Adwords Auctions with Decreasing Valuation Bids.

[BibT_eX]

[DOI]