Nathaniel Grammel
4 papers · 2021–2025 · 3 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
๐
Conference Polyglot ยท Bronze
๐
Interdisciplinary Bridge ยท Bronze
๐บ๏ธ
Taxonomy Completionist
(11)
๐ฃ
Hot Topic Early Bird
Venues
Top co-authors
Research topics
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
Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience
AISTATS 2021
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes
NeurIPS 2021
PettingZoo: Gym for Multi-Agent Reinforcement Learning
NeurIPS 2021