| Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources | 0 | 0.34 | 2022 |
| Transparency and Control in Platforms for Networked Markets. | 0 | 0.34 | 2022 |
| Full surplus extraction from samples | 0 | 0.34 | 2021 |
| Learning Utilities and Equilibria in Non-Truthful Auctions | 0 | 0.34 | 2020 |
| Report-Sensitive Spot-Checking in Peer-Grading Systems. | 0 | 0.34 | 2020 |
| Limitations Of Incentive Compatibility On Discrete Type Spaces | 0 | 0.34 | 2020 |
| Simultaneous auctions without complements are (almost) efficient | 0 | 0.34 | 2020 |
| Transparency and Control in Platforms for Networked Markets. | 0 | 0.34 | 2019 |
| Efficient Computation of Optimal Auctions via Reduced Forms | 1 | 0.41 | 2019 |
| The Vickrey Auction with a Single Duplicate Bidder Approximates the Optimal Revenue. | 0 | 0.34 | 2019 |
| Allocation for Social Good: Auditing Mechanisms for Utility Maximization | 1 | 0.35 | 2019 |
| Report-Sensitive Spot-checking in Peer Grading Systems | 0 | 0.34 | 2019 |
| The Value of Information Concealment. | 0 | 0.34 | 2018 |
| Third-Party Data Providers Ruin Simple Mechanisms | 0 | 0.34 | 2018 |
| Approximately optimal auctions for correlated bidders | 2 | 0.41 | 2015 |
| Randomization Beats Second Price as a Prior-Independent Auction | 7 | 0.55 | 2015 |
| Optimal auctions for correlated buyers with sampling | 2 | 0.41 | 2014 |
| Approximate revenue maximization in interdependent value settings | 10 | 0.54 | 2014 |
| Visual Contact Angle Estimation and Traction Control for Mobile Robot in Rough-Terrain | 4 | 0.45 | 2014 |
| On the complexity of computing an equilibrium in combinatorial auctions | 15 | 0.66 | 2014 |
| The Simple Economics of Approximately Optimal Auctions | 21 | 0.96 | 2013 |
| Simultaneous auctions are (almost) efficient | 46 | 1.46 | 2013 |
| Cost-recovering bayesian algorithmic mechanism design | 1 | 0.36 | 2013 |
| Prior-independent auctions for risk-averse agents | 20 | 1.19 | 2013 |
| Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication. | 4 | 0.41 | 2013 |
| Bayesian optimal auctions via multi- to single-agent reduction | 35 | 2.28 | 2012 |
| Sketching valuation functions | 11 | 0.61 | 2012 |
| Ad auctions with data | 9 | 0.78 | 2012 |
| Conditional equilibrium outcomes via ascending price processes with applications to combinatorial auctions with item bidding | 24 | 1.30 | 2012 |
| Optimal auctions with correlated bidders are easy | 39 | 3.02 | 2011 |
| Inapproximability for VCG-based combinatorial auctions | 30 | 1.33 | 2010 |
| Truthfulness via Proxies | 7 | 0.55 | 2010 |
| Amplified Hardness of Approximation for VCG-Based Mechanisms | 3 | 0.44 | 2009 |
| Identifications of conserved 7-mers in 3'-UTRs and microRNAs in Drosophila. | 16 | 0.39 | 2007 |
| Prediction of Kinase-Specific Phosphorylation Sites by One-Class SVMs | 2 | 0.42 | 2007 |
