If you made any changes in Pure these will be visible here soon.

Fingerprint Dive into the research topics where Matt Weinberg is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 2 Similar Profiles

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Projects

Research Output

  • 761 Citations
  • 15 h-Index
  • 39 Conference contribution
  • 5 Article
  • 1 Conference article

Approximately strategyproof tournament rules: On large manipulating sets and cover-consistence

Schvartzman, A., Weinberg, S. M., Zlatin, E. & Zuo, A., Jan 2020, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Vidick, T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 3. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 151).

Princeton University

Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Implementation in advised strategies: Welfare guarantees from posted-price mechanisms when demand queries are NP-hard

    Cai, L., Thomas, C. & Matthew Weinberg, S., Jan 2020, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Vidick, T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 61. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 151).

    Princeton University

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 1 Scopus citations

    New query lower bounds for submodular function minimization

    Graur, A., Pollner, T., Ramaswamy, V. & Matthew Weinberg, S., Jan 2020, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Vidick, T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 64. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 151).

    Princeton University

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Optimal single-choice prophet inequalities from samples

    Rubinstein, A., Wang, J. Z. & Matthew Weinberg, S., Jan 2020, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Vidick, T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 60. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 151).

    Princeton University

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Separating the communication complexity of truthful and non-truthful combinatorial auctions

    Assadi, S., Khandeparkar, H., Saxena, R. R. & Weinberg, S. M., Jun 8 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 1073-1085 13 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Princeton University

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access