House Markets with Matroid and Knapsack Constraints
From MaRDI portal
Publication:4598284
DOI10.4230/LIPIcs.ICALP.2016.141zbMath1390.91225OpenAlexW2530727501MaRDI QIDQ4598284
Publication date: 19 December 2017
Full work available at URL: https://dblp.uni-trier.de/db/conf/icalp/icalp2016.html#KrystaZ16
approximation algorithmsmatching under preferencesalgorithmic mechanism designmatroid and knapsack constraints
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68)
Related Items (2)
Budget feasible mechanisms on matroids ⋮ Envy-free matchings with one-sided preferences and matroid constraints
This page was built for publication: House Markets with Matroid and Knapsack Constraints