Nathaniel Grammel
4 papers · 2021–2025 · 3 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+1 more ↓ Show less ↑
π Conference Polyglot (3) π Interdisciplinary Bridge πΊοΈ Taxonomy Completionist (13) π§ Keyword Pioneer π£ Hot Topic Early Bird
π
Cross-Pollinator
(15)
Conferences
NIPS (2)
AAAI (1)
AISTATS (1)
Top co-authors
Keywords
approximation algorithm
(2)
combinatorial optimization
(2)
bipartite matching
(1)
randomized rounding
(1)
bipartite graph
(1)
graph algorithm
(1)
fairness constraint
(1)
matching algorithm
(1)
proportional representation
(1)
multi-agent environment
(1)
contention resolution
(1)
stochastic matching
(1)
proportional fair matching
(1)
contention resolution scheme
(1)
agent environment cycle
(1)
parallel environment
(1)
game model
(1)
prophet secretary
(1)
patience constraint
(1)
multi-agent reinforcement learning
(1)
Papers
Proportionally Fair Matching via Randomized Rounding
AAAI 2025
PettingZoo: Gym for Multi-Agent Reinforcement Learning
NIPS 2021
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes
NIPS 2021
Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience
AISTATS 2021