| Publication | Date of Publication | Type |
|---|
| Mechanism design for crowdsourcing: an optimal 1-1/e competitive budget-feasible mechanism for large markets | 2025-08-05 | Paper |
| Matching with our eyes closed | 2025-05-05 | Paper |
Clinching auctions with online supply
Games and Economic Behavior | 2020-10-26 | Paper |
Budget feasible procurement auctions
Operations Research | 2020-10-12 | Paper |
Clinching auctions with online supply
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Reservation exchange markets for internet advertising | 2017-12-19 | Paper |
| Online vertex-weighted bipartite matching and single-bid budgeted allocations | 2017-09-29 | Paper |
Online vertex-weighted bipartite matching and single-bid budgeted allocations
(available as arXiv preprint) | 2017-09-29 | Paper |
Polyhedral clinching auctions and the AdWords polytope
Journal of the ACM | 2016-03-24 | Paper |
Randomized revenue monotone mechanisms for online advertising
Web and Internet Economics | 2015-01-07 | Paper |
Budget constrained auctions with heterogeneous items
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Submodularity helps in Nash and nonsymmetric bargaining games
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Polyhedral clinching auctions and the adwords polytope
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Budget-constrained auctions with heterogeneous items
Theory of Computing | 2012-09-27 | Paper |
| Combinatorial problems with discounted price functions in multi-agent systems | 2012-08-29 | Paper |
A perfect price discrimination market model with production, and a rational convex program for it
Mathematics of Operations Research | 2012-05-24 | Paper |
On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP
SIAM Journal on Computing | 2011-01-17 | Paper |
Single-parameter combinatorial auctions with partially public valuations
Algorithmic Game Theory | 2010-10-19 | Paper |
A perfect price discrimination market model with production, and a (rational) convex program for it
Algorithmic Game Theory | 2010-10-19 | Paper |
| scientific article; zbMATH DE number 5764830 (Why is no real title available?) | 2010-08-06 | Paper |
Efficiency, Fairness and Competitiveness in Nash Bargaining Games
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Adwords Auctions with Decreasing Valuation Bids
Lecture Notes in Computer Science | 2008-04-15 | Paper |
