| Publication | Date of Publication | Type |
|---|
| The average-value allocation problem | 2025-10-06 | Paper |
| Prior-independent auctions for heterogeneous bidders | 2024-11-28 | Paper |
| Autobidding with constraints | 2020-06-30 | Paper |
Is Shapley cost sharing optimal?
Games and Economic Behavior | 2018-07-12 | Paper |
Online stochastic matching with unequal probabilities
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | 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 |
Designing markets for daily deals
Web and Internet Economics | 2015-01-12 | Paper |
Biobjective online bipartite matching
Web and Internet Economics | 2015-01-07 | Paper |
On earthmover distance, metric labeling, and 0-extension
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Online graph edge-coloring in the random-order arrival model
Theory of Computing | 2014-10-06 | Paper |
Online bipartite matching with unknown distributions
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| A 1.43-competitive online graph edge coloring algorithm in the random order arrival model | 2014-05-22 | Paper |
Online matching and ad allocation
Foundations and Trends in Theoretical Computer Science | 2014-01-15 | Paper |
Design is as easy as optimization
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Pricing commodities
Theoretical Computer Science | 2011-02-21 | Paper |
On the Fourier spectrum of symmetric Boolean functions
Combinatorica | 2010-08-13 | Paper |
| scientific article; zbMATH DE number 5764830 (Why is no real title available?) | 2010-08-06 | Paper |
On earthmover distance, metric labeling, and 0-extension
SIAM Journal on Computing | 2010-04-29 | Paper |
Beyond Moulin mechanisms
Games and Economic Behavior | 2009-08-27 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
A note on approximate Nash equilibria
Theoretical Computer Science | 2009-04-29 | Paper |
Design Is as Easy as Optimization
Automata, Languages and Programming | 2009-03-12 | Paper |
AdWords and generalized online matching
Journal of the ACM | 2008-12-21 | Paper |
Inapproximability results for combinatorial auctions with submodular utility functions
Algorithmica | 2008-09-12 | Paper |
Is Shapley Cost Sharing Optimal?
Algorithmic Game Theory | 2008-05-02 | Paper |
Adwords Auctions with Decreasing Valuation Bids
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations
Approximation and Online Algorithms | 2008-02-20 | Paper |
An auction-based market equilibrium algorithm for a production model
Theoretical Computer Science | 2007-06-13 | Paper |
Caching with Expiration Times for Internet Applications
Internet Mathematics | 2006-05-09 | Paper |
Posted price profit maximization for multicast by approximating fixed points
Journal of Algorithms | 2006-04-28 | Paper |
| Learning symmetric k-juntas in time n^o(k) | 2005-04-12 | Paper |
| scientific article; zbMATH DE number 2119709 (Why is no real title available?) | 2004-11-29 | Paper |
