The paper gives exact polynomial-time algorithms for Second Price Matching on (d,2)-regular graphs when d≥4, a 9/10 approximation for d=3, and settles the approximability of a new perfect-matching variant at (1-1/e).
On the approximability of budgeted allocations and im- proved lower bounds for submodular welfare maximization and gap.SIAM Journal on Computing, 39(6):2189–2211, 2010
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Second Price Matching with Complete Allocation and Degree Constraints
The paper gives exact polynomial-time algorithms for Second Price Matching on (d,2)-regular graphs when d≥4, a 9/10 approximation for d=3, and settles the approximability of a new perfect-matching variant at (1-1/e).