Scenario Submodular Cover. - Nathaniel Grammel; Lisa Hellerstein; Devorah Kletenik; Patrick Lin 001 (WAOA, 2016)

The Stochastic Score Classification Problem. - Dimitrios Gkenosis; Nathaniel Grammel; Lisa Hellerstein; Devorah Kletenik (ESA, 2018)

Vertex-weighted Online Stochastic Matching with Patience Constraints. - Brian Brubach; Nathaniel Grammel; Aravind Srinivasan (CoRR, 2019)

Parameter Sharing For Heterogeneous Agents in Multi-Agent Reinforcement Learning. - Justin K. Terry; Nathaniel Grammel; Sanghyun Son 003; Benjamin Black (CoRR, 2020)

Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints. - Brian Brubach; Nathaniel Grammel; David G. Harris 001; Aravind Srinivasan; Leonidas Tsepenekas; Anil Vullikanti (CoRR, 2020)

Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience. - Nathaniel Grammel; Brian Brubach; Will Ma; Aravind Srinivasan (AISTATS, 2021)

Approximating Two-Stage Stochastic Supplier Problems. - Brian Brubach; Nathaniel Grammel; David G. Harris 001; Aravind Srinivasan; Leonidas Tsepenekas; Anil Vullikanti (APPROX-RANDOM, 2021)

Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. - Brian Brubach; Nathaniel Grammel; Will Ma; Aravind Srinivasan (NeurIPS, 2021)

PettingZoo: Gym for Multi-Agent Reinforcement Learning. - Justin K. Terry; Benjamin Black; Nathaniel Grammel; Mario Jayakumar; Ananth Hari; Ryan Sullivan; Luis S. Santos; Clemens Dieffendahl; Caroline Horsch; Rodrigo Perez-Vicente; Niall L. Williams; Yashas Lokesh; et al. (NeurIPS, 2021)

Algorithms for the Unit-Cost Stochastic Score Classification Problem. - Nathaniel Grammel; Lisa Hellerstein; Devorah Kletenik; Naifeng Liu (Algorithmica, 2022)

The Stochastic Boolean Function Evaluation problem for symmetric Boolean functions. - Dimitrios Gkenosis; Nathaniel Grammel; Lisa Hellerstein; Devorah Kletenik (Discret. Appl. Math., 2022)

Proportionally Fair Matching via Randomized Rounding. - Sharmila Duppala; Nathaniel Grammel; Juan Luque; Calum MacRury; Aravind Srinivasan (AAAI, 2025)

Online Matching Frameworks Under Stochastic Rewards, Product Ranking, and Unknown Patience. - Brian Brubach; Nathaniel Grammel; Will Ma; Aravind Srinivasan (Oper. Res., 2025)

On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. - Calum MacRury; Will Ma; Nathaniel Grammel (Oper. Res., 2025)