Smart Markets via Computation

Publications

Conference proceedings (5)

The Competition Complexity of Auctions - A Bulow-Klemperer Result for Multi-Dimensional Bidders

Author(s): Alon Eden, Michal Feldman, Ophir Friedler, Inbal Talgam-Cohen, S. Matthew Weinberg
Published in: Proceedings of the 2017 ACM Conference on Economics and Computation - EC '17, 2017, Page(s) 343-343, ISBN 9781-450345279
Publisher: ACM Press
DOI: 10.1145/3033274.3085115

When Are Welfare Guarantees Robust?

Author(s): Tim Roughgarden and Inbal Talgam-Cohen and Jan Vondrák (author order alphabetical)
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017), 2017, Page(s) 22:1-22:23, ISBN 978-3-95977-044-6
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.22

Approximate modularity revisited

Author(s): Uriel Feige, Michal Feldman, Inbal Talgam-Cohen
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017, 2017, Page(s) 1028-1041, ISBN 9781-450345286
Publisher: ACM Press
DOI: 10.1145/3055399.3055476

A Simple and Approximately Optimal Mechanism for a Buyer with Complements - Abstract

Author(s): Alon Eden, Michal Feldman, Ophir Friedler, Inbal Talgam-Cohen, S. Matthew Weinberg
Published in: Proceedings of the 2017 ACM Conference on Economics and Computation - EC '17, 2017, Page(s) 323-323, ISBN 9781-450345279
Publisher: ACM Press
DOI: 10.1145/3033274.3085116

Oblivious Rounding and the Integrality Gap

Author(s): Uriel Feige and Michal Feldman and Inbal Talgam-Cohen
Published in: To appear in Theory of Computing - Special Issue for the APPROX/RANDOM 2016 Workshops, 2018
Publisher: Theory of Computing (endorsed by ACM SIGACT)
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2016.8