The authors show that proportional division can perform arbitrarily badly and give an O(n log n) algorithm for the optimal mechanism in a linear-program formulation of the UGC incentive problem.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal mechanisms with budget for user generated contents
The authors show that proportional division can perform arbitrarily badly and give an O(n log n) algorithm for the optimal mechanism in a linear-program formulation of the UGC incentive problem.