Nathaniel Grammel

According to our database1, Nathaniel Grammel authored at least 12 papers between 2016 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
The Stochastic Boolean Function Evaluation problem for symmetric Boolean functions.
Discret. Appl. Math., 2022

Algorithms for the Unit-Cost Stochastic Score Classification Problem.
Algorithmica, 2022

2021
PettingZoo: Gym for Multi-Agent Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Approximating Two-Stage Stochastic Supplier Problems.
Proceedings of the Approximation, 2021

Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints.
CoRR, 2020

Parameter Sharing For Heterogeneous Agents in Multi-Agent Reinforcement Learning.
CoRR, 2020

2019
Vertex-weighted Online Stochastic Matching with Patience Constraints.
CoRR, 2019

2018
The Stochastic Score Classification Problem.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2016
Scenario Submodular Cover.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016


  Loading...