Co-occurring keywords · papers mentioning both
Papers
Online Task Assignment with Controllable Processing Time
IJCAI 2023
Robust Learning for Smoothed Online Convex Optimization with Feedback Delay
NeurIPS 2023
Simple, Scalable and Effective Clustering via One-Dimensional Projections
NeurIPS 2023
A competitive analysis of online failure-aware assignment
UAI 2022
Augmenting Online Algorithms with ε-Accurate Predictions
NeurIPS 2022
Competitive Analysis for Multi-Commodity Ski-Rental Problem
IJCAI 2022
Equity Promotion in Online Resource Allocation
AAAI 2022
Learning Predictions for Algorithms with Predictions
NeurIPS 2022
Online Algorithms for the Santa Claus Problem
NeurIPS 2022
Online Bin Packing with Predictions
IJCAI 2022
Online Task Assignment Problems with Reusable Resources
AAAI 2022
(Optimal) Online Bipartite Matching with Degree Information
NeurIPS 2022
Scheduling with Untrusted Predictions
IJCAI 2022
Secretary Matching with Vertex Arrivals and No Rejections
AAAI 2022
The Secretary Problem with Competing Employers on Random Edge Arrivals
AAAI 2022
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback
AAAI 2021
Competitive Analysis for Two-Level Ski-Rental Problem
AAAI 2021
Fair and Efficient Online Allocations with Normalized Valuations
AAAI 2021
Online Unrelated Machine Load Balancing with Predictions Revisited
ICML 2021
Robust Online Correlation Clustering
NeurIPS 2021
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours
AAAI 2020
Clarity: Data-Driven Automatic Assessment of Product Competitiveness
AAAI 2020
Improving Online Rent-or-Buy Algorithms with Sequential Decision Making and ML Predictions
NeurIPS 2020
Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms
NeurIPS 2020
Secretary and Online Matching Problems with Machine Learned Advice
NeurIPS 2020