research
∙
09/15/2022
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
We present new results for online contention resolution schemes for the ...
share
research
∙
11/16/2021
The Stochastic Boolean Function Evaluation Problem for Symmetric Boolean Functions
We give two approximation algorithms solving the Stochastic Boolean Func...
research
∙
06/13/2021
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes
Matching is one of the most fundamental and broadly applicable problems ...
research
∙
09/28/2020
Agent Environment Cycle Games
Partially Observable Stochastic Games (POSGs), are the most general mode...
research
∙
08/07/2020
Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints
The main focus of this paper is radius-based clustering problems in the ...
research
∙
06/11/2020
Multi-Agent Informational Learning Processes
We introduce a new mathematical model of multi-agent reinforcement learn...
research
∙
05/27/2020
Parameter Sharing is Surprisingly Useful for Multi-Agent Deep Reinforcement Learning
"Nonstationarity" is a fundamental problem in cooperative multi-agent re...
research
∙
07/09/2019
Vertex-weighted Online Stochastic Matching with Patience Constraints
Online Bipartite Matching is a classic problem introduced by Karp, Vazir...
research
∙
06/27/2018