Will Ma
9 papers · 2020–2024 · 2 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
π Cross-Pollinator (9) π§ Keyword Pioneer π Conference Polyglot (2) π Interdisciplinary Bridge πΊοΈ Taxonomy Completionist (26)
π£
Hot Topic Early Bird
ποΈ
Keyword Collector
(51)
Conferences
NIPS (7)
AISTATS (2)
Top co-authors
Keywords
online algorithm
(3)
bipartite matching
(2)
sample complexity
(1)
convex relaxation
(1)
linear programming
(1)
algorithm design
(1)
bipartite graph
(1)
welfare maximization
(1)
neural network verification
(1)
approximation algorithm
(1)
revenue optimization
(1)
secretary problem
(1)
learning-augmented algorithm
(1)
fair allocation
(1)
posted pricing
(1)
distributionally robust optimization
(1)
revenue maximization
(1)
auction mechanism
(1)
mechanism design
(1)
combinatorial optimization
(1)
Papers
Promoting Fairness Among Dynamic Agents in Online-Matching Markets under Known Stationary Arrival Distributions
NIPS 2024
Sample Complexity of Posted Pricing for a Single Item
NIPS 2024
Fair Secretaries with Unfair Predictions
NIPS 2024
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
NIPS 2022
Beyond IID: data-driven decision-making in heterogeneous environments
NIPS 2022
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
NIPS 2021
Reaping the Benefits of Bundling under High Production Costs
AISTATS 2021
The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification
NIPS 2020