The Competition Complexity of Auctions - A Bulow-Klemperer Result for Multi-Dimensional Bidders
(si apre in una nuova finestra)
Autori:
Alon Eden, Michal Feldman, Ophir Friedler, Inbal Talgam-Cohen, S. Matthew Weinberg
Pubblicato in:
Proceedings of the 2017 ACM Conference on Economics and Computation - EC '17, 2017, Pagina/e 343-343, ISBN 9781-450345279
Editore:
ACM Press
DOI:
10.1145/3033274.3085115
When Are Welfare Guarantees Robust?
(si apre in una nuova finestra)
Autori:
Tim Roughgarden and Inbal Talgam-Cohen and Jan Vondrák
(author order alphabetical)
Pubblicato in:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017), 2017, Pagina/e 22:1-22:23, ISBN 978-3-95977-044-6
Editore:
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI:
10.4230/LIPIcs.APPROX-RANDOM.2017.22
Approximate modularity revisited
(si apre in una nuova finestra)
Autori:
Uriel Feige, Michal Feldman, Inbal Talgam-Cohen
Pubblicato in:
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017, 2017, Pagina/e 1028-1041, ISBN 9781-450345286
Editore:
ACM Press
DOI:
10.1145/3055399.3055476
A Simple and Approximately Optimal Mechanism for a Buyer with Complements - Abstract
(si apre in una nuova finestra)
Autori:
Alon Eden, Michal Feldman, Ophir Friedler, Inbal Talgam-Cohen, S. Matthew Weinberg
Pubblicato in:
Proceedings of the 2017 ACM Conference on Economics and Computation - EC '17, 2017, Pagina/e 323-323, ISBN 9781-450345279
Editore:
ACM Press
DOI:
10.1145/3033274.3085116
Oblivious Rounding and the Integrality Gap
(si apre in una nuova finestra)
Autori:
Uriel Feige and Michal Feldman and Inbal Talgam-Cohen
Pubblicato in:
To appear in Theory of Computing - Special Numero for the APPROX/RANDOM 2016 Workshops, 2018
Editore:
Theory of Computing (endorsed by ACM SIGACT)
DOI:
10.4230/LIPIcs.APPROX-RANDOM.2016.8
