Will Ma
9 papers · 2020–2024 · 2 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 Β· Silver
πΊοΈ
Taxonomy Completionist
(25)
π£
Hot Topic Early Bird
ποΈ
Keyword Collector
(51)
Venues
Top co-authors
Research topics
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
Fair Secretaries with Unfair Predictions
NeurIPS 2024
Promoting Fairness Among Dynamic Agents in Online-Matching Markets under Known Stationary Arrival Distributions
NeurIPS 2024
Sample Complexity of Posted Pricing for a Single Item
NeurIPS 2024
Beyond IID: data-driven decision-making in heterogeneous environments
NeurIPS 2022
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
NeurIPS 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
NeurIPS 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
NeurIPS 2020