34 citations · 150 across the 33 of their papers we have counts for
4 papers · 1 filter
Improved Approximation Algorithms for Stochastic-Matching Problems
Marek Adamczyk, Brian Brubach, Fabrizio Grandoni +3
We consider the Stochastic Matching problem, which is motivated by applications in kidney exchange and online dating. In this problem, we are given an undirected graph. Each edge i…
Robust Identifiability in Linear Structural Equation Models of Causal Inference
Karthik Abinav Sankararaman, Anand Louis, Navin Goyal
In this work, we consider the problem of robust parameter estimation from observational data in the context of linear structural equation models (LSEMs). LSEMs are a popular and we…
Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship
Abishek Sankararaman, Soumya Basu, Karthik Abinav Sankararaman
Online learning in a two-sided matching market, with demand side agents continuously competing to be matched with supply side (arms), abstracts the complex interactions under parti…
Bandits with Knapsacks beyond the Worst-Case
Karthik Abinav Sankararaman, Aleksandrs Slivkins
Bandits with Knapsacks (BwK) is a general model for multi-armed bandits under supply/budget constraints. While worst-case regret bounds for BwK are well-understood, we present thre…