All Stories

  1. Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness
  2. Learning in Budgeted Auctions with Spacing Objectives
  3. Allocating Public Goods via Dynamic Max-Min Fairness: Long-Run Behavior and Competitive Equilibria
  4. Allocating Public Goods via Dynamic Max-Min Fairness: Long-Run Behavior and Competitive Equilibria
  5. No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
  6. Allocating Public Goods via Dynamic Max-Min Fairness: Long-Run Behavior and Competitive Equilibria
  7. Robust Pseudo-Markets for Reusable Public Resources
  8. Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions