All Stories

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