All Stories

  1. Online Smoothed Demand Management
  2. Learning to Allocate Reusable Resources under Stochastic Rewards and Durations
  3. Green Bin Packing
  4. Heterogeneous Multi-agent Multi-armed Bandit on Stochastic Block Models
  5. Learning to Allocate Reusable Resources under Stochastic Rewards and Durations
  6. Online Smoothed Demand Management
  7. A Unified Framework for Online Combinatorial Allocation of Reusable Resources under Endogenous Deterioration
  8. Heterogeneous Multi-agent Multi-armed Bandit on Stochastic Block Models
  9. Green Bin Packing
  10. A Unified Framework for Online Combinatorial Allocation of Reusable Resources under Endogenous Deterioration
  11. Learning to Allocate Reusable Resources under Stochastic Rewards and Durations
  12. Green Bin Packing
  13. BOLA360: Near-optimal View and Bitrate Adaptation for 360-degree Video Streaming
  14. Heterogeneous Multi-agent Multi-armed Bandit on Stochastic Block Models
  15. Multi-objective Evolutionary Learning for Near Pareto-Optimal Optimization of Solar Deployment
  16. NIVM: Real-time View Morphing via Neural Implicit Function
  17. Carbon- and Precedence-Aware Scheduling for Data Processing Clusters
  18. Dynamic Incentive Allocation for City-Scale Deep Decarbonization
  19. Toward Environmentally Equitable AI
  20. Combinatorial Logistic Bandits
  21. Asynchronous Multi-Agent Bandits: Fully Distributed vs. Leader-Coordinated Algorithms
  22. Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
  23. Online Fair Allocation of Reusable Resources
  24. Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
  25. Online Fair Allocation of Reusable Resources
  26. Asynchronous Multi-Agent Bandits: Fully Distributed vs. Leader-Coordinated Algorithms
  27. Combinatorial Logistic Bandits
  28. Online Fair Allocation of Reusable Resources
  29. Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
  30. Asynchronous Multi-Agent Bandits: Fully Distributed vs . Leader-Coordinated Algorithms
  31. SODA: An Adaptive Bitrate Controller for Consistent High-Quality Video Streaming
  32. Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
  33. The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
  34. BONES: Near-Optimal Neural-Enhanced Video Streaming
  35. The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
  36. BONES: Near-Optimal Neural-Enhanced Video Streaming
  37. Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
  38. LACS: Learning-Augmented Algorithms for Carbon-Aware Resource Scaling with Uncertain Demand
  39. Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
  40. A Holistic Approach for Equity-aware Carbon Reduction of the Ridesharing Platforms
  41. BONES: Near-Optimal Neural-Enhanced Video Streaming
  42. BOLA360
  43. The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
  44. Quantifying the Decarbonization Potential of Flexible Load
  45. Trade-off Analysis in Learning-augmented Algorithms with Societal Design Criteria
  46. Quantum Best Arm Identification
  47. The Online Knapsack Problem with Departures
  48. The Online Knapsack Problem with Departures
  49. Near-optimal Online Algorithms for Joint Pricing and Scheduling in EV Charging Networks
  50. Equitable Network-Aware Decarbonization of Residential Heating at City Scale
  51. The Online Knapsack Problem with Departures
  52. Hierarchical Learning Algorithms for Multi-scale Expert Problems
  53. Competitive Algorithms for Online Multidimensional Knapsack Problems
  54. Hierarchical Learning Algorithms for Multi-scale Expert Problems
  55. Competitive Algorithms for Online Multidimensional Knapsack Problems
  56. Hierarchical Learning Algorithms for Multi-scale Expert Problems
  57. Competitive Bidding Strategies for Online Linear Optimization with Inventory Management Constraints
  58. Competitive Algorithms for Online Multidimensional Knapsack Problems
  59. Online peak-aware energy scheduling with untrusted advice
  60. Online Peak-Aware Energy Scheduling with Untrusted Advice
  61. Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
  62. Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
  63. Ride Substitution Using Electric Bike Sharing
  64. Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
  65. Online Linear Optimization with Inventory Management Constraints
  66. Emission-aware Energy Storage Scheduling for a Greener Grid
  67. Online Linear Optimization with Inventory Management Constraints