Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding

Shaddin Dughmi, Tim Roughgarden, Qiqi Yan. Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding. Journal of the ACM, 63(4):30, 2016. [doi]

@article{DughmiRY16,
  title = {Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding},
  author = {Shaddin Dughmi and Tim Roughgarden and Qiqi Yan},
  year = {2016},
  doi = {10.1145/2908735},
  url = {http://doi.acm.org/10.1145/2908735},
  researchr = {https://researchr.org/publication/DughmiRY16},
  cites = {0},
  citedby = {0},
  journal = {Journal of the ACM},
  volume = {63},
  number = {4},
  pages = {30},
}