Nathaniel Grammel

22 papers A* 4A 2B 1Journal 14Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes.
Math. Oper. Res.
Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2025 J jnl
On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs.
Oper. Res.
Calum MacRury, Will Ma, Nathaniel Grammel
2025 J jnl
Online Matching Frameworks Under Stochastic Rewards, Product Ranking, and Unknown Patience.
Oper. Res.
Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2025 A* conf
Proportionally Fair Matching via Randomized Rounding.
AAAI
Sharmila Duppala, Nathaniel Grammel, Juan Luque, Calum MacRury, Aravind Srinivasan
2024 J jnl
Proportionally Fair Matching via Randomized Rounding.
CoRR
Sharmila Duppala, Nathaniel Grammel, Juan Luque, Calum MacRury, Aravind Srinivasan
2023 A* conf
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs.
SODA
Calum MacRury, Will Ma, Nathaniel Grammel
2022 J jnl
Algorithms for the Unit-Cost Stochastic Score Classification Problem.
Algorithmica
Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Naifeng Liu
2022 J jnl
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs.
CoRR
Calum MacRury, Will Ma, Nathaniel Grammel
2022 J jnl
The Stochastic Boolean Function Evaluation problem for symmetric Boolean functions.
Discret. Appl. Math.
Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik
2021 — conf
Approximating Two-Stage Stochastic Supplier Problems.
APPROX-RANDOM
Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2021 A conf
Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience.
AISTATS
Nathaniel Grammel, Brian Brubach, Will Ma, Aravind Srinivasan
2021 A* conf
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes.
NeurIPS
Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2021 J jnl
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes.
CoRR
Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2021 A* conf
PettingZoo: Gym for Multi-Agent Reinforcement Learning.
NeurIPS
J. 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, Praveen Ravi
2021 J jnl
The Stochastic Boolean Function Evaluation Problem for Symmetric Boolean Functions.
CoRR
Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik
2020 J jnl
Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints.
CoRR
Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2020 J jnl
Parameter Sharing For Heterogeneous Agents in Multi-Agent Reinforcement Learning.
CoRR
J. K. Terry, Nathaniel Grammel, Sanghyun Son, Benjamin Black
2019 J jnl
Vertex-weighted Online Stochastic Matching with Patience Constraints.
CoRR
Brian Brubach, Nathaniel Grammel, Aravind Srinivasan
2018 A conf
The Stochastic Score Classification Problem.
ESA
Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik
2018 J jnl
The Stochastic Score Classification Problem.
CoRR
Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik
2016 B conf
Scenario Submodular Cover.
WAOA
Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin
2016 J jnl
Scenario Submodular Cover.
CoRR
Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin