Bounding the menu-size of approximately optimal auctions via optimal-transport duality

Yannai A. Gonczarowski. Bounding the menu-size of approximately optimal auctions via optimal-transport duality. In Ilias Diakonikolas, David Kempe 0001, Monika Henzinger, editors, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. pages 123-131, ACM, 2018. [doi]

@inproceedings{Gonczarowski18,
  title = {Bounding the menu-size of approximately optimal auctions via optimal-transport duality},
  author = {Yannai A. Gonczarowski},
  year = {2018},
  doi = {10.1145/3188745.3188786},
  url = {http://doi.acm.org/10.1145/3188745.3188786},
  researchr = {https://researchr.org/publication/Gonczarowski18},
  cites = {0},
  citedby = {0},
  pages = {123-131},
  booktitle = {Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018},
  editor = {Ilias Diakonikolas and David Kempe 0001 and Monika Henzinger},
  publisher = {ACM},
}