1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.GT2022★ 1 cited
Multiagent MST Cover: Pleasing All Optimally via A Simple Voting Rule
Bo Li, Xiaowei Wu, Chenyang Xu +1
Given a connected graph on whose edges we can build roads to connect the nodes, a number of agents hold possibly different perspectives on which edges should be selected by assigni…
cs.DS2021
Using Predicted Weights for Ad Delivery
Thomas Lavastida, Benjamin Moseley, R. Ravi +1
We study the performance of a proportional weights algorithm for online capacitated bipartite matching modeling the delivery of impression ads. The algorithm uses predictions on th…
cs.LG2020
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing
Thomas Lavastida, Benjamin Moseley, R. Ravi +1
We propose a new model for augmenting algorithms with predictions by requiring that they are formally learnable and instance robust. Learnability ensures that predictions can be ef…