Co-occurring keywords · papers mentioning both
Papers
Fair and Efficient Balanced Allocation for Indivisible Goods
AAAI 2026
Learn to Match with No Regret: Reinforcement Learning in Markov Matching Markets
NeurIPS 2022
Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising
IJCAI 2020
Learning Latent Permutations with Gumbel-Sinkhorn Networks
ICLR 2018
Sparse PCA via Bipartite Matchings
NeurIPS 2015
A Graphical Transformation for Belief Propagation: Maximum Weight Matchings and Odd-Sized Cycles
NeurIPS 2013
Inferring rankings under constrained sensing
NeurIPS 2008