Welfare Maximization and the Supermodular Degree

Abstract

Given a set of items and a collection of players, each with a nonnegative monotone valuation set function over the items, the welfare maximization problem requires that every item be allocated to exactly one player, and one wishes to maximize the sum of values obtained by the players, as computed by applying the respective valuation function to the bundle… (More)
DOI: 10.1145/2422436.2422466

Topics

2 Figures and Tables

Statistics

0100200201520162017
Citations per Year

Citation Velocity: 47

Averaging 47 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Feige2013WelfareMA, title={Welfare Maximization and the Supermodular Degree}, author={Uriel Feige and Rani Izsak}, booktitle={Electronic Colloquium on Computational Complexity}, year={2013} }