We present new results for online contention resolution schemes for the
...
We give two approximation algorithms solving the Stochastic Boolean Func...
Matching is one of the most fundamental and broadly applicable problems
...
Partially Observable Stochastic Games (POSGs), are the most general mode...
The main focus of this paper is radius-based clustering problems in the
...
We introduce a new mathematical model of multi-agent reinforcement learn...
"Nonstationarity" is a fundamental problem in cooperative multi-agent
re...
Online Bipartite Matching is a classic problem introduced by Karp, Vazir...
Consider the following Stochastic Score Classification Problem. A doctor...