Reducing Revenue to Welfare Maximization: Approximation Algorithms and Other Generalizations
It was recently shown in [12] that revenue optimization can be computationally efficiently reduced to welfare optimization in all multi-dimensional Bayesian auction problems with arbitrary (possibly combinatorial) feasibility constraints and independent additive bidders with arbitrary (possibly comb...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2015-11-20T17:11:02Z.
|
Subjects: | |
Online Access: | Get fulltext |