A neural menu-generation framework produces strategy-proof assignments in constrained matching markets by trading off envy and waste through differentiable optimization.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
cs.GT 3years
2026 3roles
background 2polarities
background 2representative citing papers
A PTAS is presented for the team order problem to find an ordering achieving winning probability within epsilon of the optimum, plus tractability results for special cases and a bound on maximum-weight matching performance.
ER-k and NW-k relaxations of fairness and non-wastefulness are always compatible under hereditary constraints, with two equivalent polynomial-time algorithms to compute such matchings.
citing papers explorer
-
MenuNet: A Strategy-Proof Mechanism for Matching Markets
A neural menu-generation framework produces strategy-proof assignments in constrained matching markets by trading off envy and waste through differentiable optimization.
-
The Team Order Problem: Maximizing the Probability of Matching Being Large Enough
A PTAS is presented for the team order problem to find an ordering achieving winning probability within epsilon of the optimum, plus tractability results for special cases and a bound on maximum-weight matching performance.
-
Compatible $k$-Relaxations of Fairness and Non-Wastefulness Under Hereditary Constraints
ER-k and NW-k relaxations of fairness and non-wastefulness are always compatible under hereditary constraints, with two equivalent polynomial-time algorithms to compute such matchings.