mechanism design seminar notes | week 4
Motivation Preview from problem set 2, question 4: (link to original file) This gives a reduction: [submodular welfare maximization] <= [maximize a monotone submodular function s.t. matroid constarint]. Remarks: hardness & approximation of the problem [submodular welfare maximization] >= [maximize a monotone submodular function s.t. matroid constarint] (Is it true though?). maximize monotone submodular function is hard. Because, for instance, one can reduce Partition problem to it. That’s why we started looking at submodular maximization s.t. matroid constraint in last week. To begin with, ...
