| Approximation schemes for a unit-demand buyer with independent items via symmetries P Kothari, S Singla, D Mohan, A Schvartzman, SM Weinberg 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 8* | 2019 |
| The menu complexity of “one-and-a-half-dimensional” mechanism design RR Saxena, A Schvartzman, SM Weinberg Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 8 | 2018 |
| Condorcet-consistent and approximately strategyproof tournament rules J Schneider, A Schvartzman, SM Weinberg arXiv preprint arXiv:1605.09733, 2016 | 8 | 2016 |
| The fewest clues problem ED Demaine, F Ma, A Schvartzman, E Waingarten, S Aaronson Theoretical Computer Science 748, 28-39, 2018 | 5 | 2018 |
| Coding in undirected graphs is either very helpful or not helpful at all M Braverman, S Garg, A Schvartzman 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017 | 5 | 2017 |
| Smoothed analysis of multi-item auctions with correlated values A Psomas, A Schvartzman, SM Weinberg Proceedings of the 2019 ACM Conference on Economics and Computation, 417-418, 2019 | 4 | 2019 |
| Optimal mechanism design for single-minded agents NR Devanur, K Goldner, RR Saxena, A Schvartzman, SM Weinberg Proceedings of the 21st ACM Conference on Economics and Computation, 193-256, 2020 | 3 | 2020 |
| Approximately strategyproof tournament rules: On large manipulating sets and cover-consistence A Schvartzman, SM Weinberg, E Zlatin, A Zuo arXiv preprint arXiv:1906.03324, 2019 | 3 | 2019 |
| Bounds for the Communication Complexity of Two-Player Approximate Correlated Equilibria. YK Ko, A Schvartzman Electronic Colloquium on Computational Complexity (ECCC) 24, 71, 2017 | 3 | 2017 |
| Network coding in undirected graphs is either very helpful or not helpful at all M Braverman, S Garg, A Schvartzman arXiv preprint arXiv:1608.06545, 2016 | 2 | 2016 |
| Selling Partially-Ordered Items: Exploring the Space between Single-and Multi-Dimensional Mechanism Design NR Devanur, K Goldner, RR Saxena, A Schvartzman, SM Weinberg | | 2018 |
| Bounds for the Communication Complexity of Approximate Correlated Equilibria YK Ko, A Schvartzman | | 2017 |
| The fewest clues problem M Fermi, A Schvartzman, E Waingarten, ED Demaine, S Aaronson Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016 | | 2016 |
| Maximum Cardinality Matchings in Fully Dynamic Graphs A Radhakrishnan, A Schvartzman | | 2014 |
| 18.434-FINAL PROJECT CONCENTRATION OF MEASURE A SCHVARTZMAN | | |
| CUTOFF FOR THE STAR TRANSPOSITION RANDOM WALK J NOVAK, A SCHVARTZMAN | | |
S. Matthew WeinbergAssistant Professor, Princeton UniversityVerified email at princeton.edu
