| Contextual Search via Intrinsic Volumes | 0 | 0.34 | 2022 |
| Calibrated Click-Through Auctions | 0 | 0.34 | 2022 |
| Dynamic Double Auctions: Toward First Best. | 0 | 0.34 | 2022 |
| Interactive Communication in Bilateral Trade. | 0 | 0.34 | 2022 |
| Linear Program-Based Approximation for Personalized Reserve Prices | 0 | 0.34 | 2022 |
| Corruption-Robust Contextual Search through Density Updates. | 0 | 0.34 | 2022 |
| Jointly Learning Prices and Product Features. | 0 | 0.34 | 2021 |
| Contextual Recommendations and Low-Regret Cutting-Plane Algorithms. | 0 | 0.34 | 2021 |
| Learning To Price Against A Moving Target | 0 | 0.34 | 2021 |
| Improved Revenue Bounds for Posted-Price and Second-rice Mechanisms | 1 | 0.36 | 2021 |
| Optimal Contextual Pricing and Extensions | 0 | 0.34 | 2021 |
| Auction Design for ROI-Constrained Buyers | 0 | 0.34 | 2021 |
| Non-Excludable Dynamic Mechanism Design. | 0 | 0.34 | 2021 |
| Secretaries with Advice | 0 | 0.34 | 2021 |
| Combinatorial Bernoulli factories: matchings, flows, and other polytopes | 0 | 0.34 | 2021 |
| Costly Zero Order Oracles | 0 | 0.34 | 2020 |
| Why Do Competitive Markets Converge to First-Price Auctions? | 0 | 0.34 | 2020 |
| Bandits with adversarial scaling | 0 | 0.34 | 2020 |
| Feature-Based Dynamic Pricing | 0 | 0.34 | 2020 |
| LP-based Approximation for Personalized Reserve Prices. | 0 | 0.34 | 2019 |
| Learning to Clear the Market. | 0 | 0.34 | 2019 |
| Dynamic Double Auctions - Towards First Best. | 0 | 0.34 | 2019 |
| Dynamic Contracting under Positive Commitment. | 0 | 0.34 | 2019 |
| Pareto Efficient Auctions with Interest Rates. | 0 | 0.34 | 2019 |
| Dynamic Mechanisms with Martingale Utilities. | 4 | 0.46 | 2018 |
| Stochastic bandits robust to adversarial corruptions. | 4 | 0.42 | 2018 |
| Contextual Search via Intrinsic Volumes | 0 | 0.34 | 2018 |
| Non-clairvoyant Dynamic Mechanism Design. | 0 | 0.34 | 2018 |
| On the Construction of Substitutes. | 0 | 0.34 | 2018 |
| Secretary Ranking with Minimal Inversions | 0 | 0.34 | 2018 |
| Dynamic Mechanism Design in the Field. | 0 | 0.34 | 2018 |
| Improved Approximations for Free-Order Prophets and Second-Price Auctions. | 0 | 0.34 | 2018 |
| Optimal Dynamic Auctions Are Virtual Welfare Maximizers | 0 | 0.34 | 2018 |
| Contextual Pricing for Lipschitz Buyers. | 0 | 0.34 | 2018 |
| Gross substitutability: An algorithmic survey. | 5 | 0.52 | 2017 |
| Multidimensional Binary Search for Contextual Decision-Making. | 1 | 0.35 | 2017 |
| Tight Bounds for Approximate Carathéodory and Beyond. | 0 | 0.34 | 2017 |
| Ellipsoids for contextual dynamic pricing. | 0 | 0.34 | 2017 |
| Dynamic Revenue Sharing. | 0 | 0.34 | 2017 |
| Ego-Splitting Framework: from Non-Overlapping to Overlapping Clusters. | 6 | 0.46 | 2017 |
| Computing Walrasian Equilibria: Fast Algorithms and Structural Properties. | 1 | 0.37 | 2017 |
| Where to Sell: Simulating Auctions From Learning Algorithms. | 0 | 0.34 | 2016 |
| A Field Guide to Personalized Reserve Prices. | 6 | 0.47 | 2016 |
| Optimal dynamic mechanisms with ex-post IR via bank accounts. | 3 | 0.46 | 2016 |
| Reservation Exchange Markets for Internet Advertising. | 2 | 0.44 | 2016 |
| Feature-based Dynamic Pricing. | 7 | 0.53 | 2016 |
| Dynamic Auctions with Bank Accounts. | 6 | 0.52 | 2016 |
| Computing Walrasian Equilibria: Fast Algorithms and Economic Insights | 1 | 0.38 | 2015 |
| Bounding the inefficiency of outcomes in generalized second price auctions. | 13 | 0.96 | 2015 |
| Core-competitive Auctions | 1 | 0.39 | 2015 |
