S. Matthew Weinberg
Orcid: 0000-0001-7744-795XAffiliations:
- Princeton University, NJ, USA
According to our database1,
S. Matthew Weinberg
authored at least 99 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Profitable Manipulations of Cryptographic Self-Selection are Statistically Detectable.
CoRR, 2024
Computing Optimal Manipulations in Cryptographic Self-Selection Proof-of-Stake Protocols.
CoRR, 2024
CoRR, 2024
Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation Guarantees.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
2023
q-Partitioning Valuations: Exploring the Space Between Subadditive and Fractionally Subadditive Valuations.
CoRR, 2023
Proceedings of the Web and Internet Economics - 19th International Conference, 2023
Proceedings of the Web and Internet Economics - 19th International Conference, 2023
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023
2022
Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions.
SIAM J. Comput., June, 2022
Proceedings of the Web and Internet Economics - 18th International Conference, 2022
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for All Distributions.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
2021
J. ACM, 2021
Oper. Res., 2021
Proceedings of the Web and Internet Economics - 17th International Conference, 2021
Proceedings of the Web and Internet Economics - 17th International Conference, 2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
Proceedings of the 9th International Conference on Learning Representations, 2021
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
CoRR, 2020
Separating the communication complexity of truthful and non-truthful combinatorial auctions.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020
On the (in-)approximability of Bayesian Revenue Maximization for a Combinatorial Buyer.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020
Approximately Strategyproof Tournament Rules: On Large Manipulating Sets and Cover-Consistence.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms When Demand Queries Are NP-Hard.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Decentralized Reinforcement Learning: Global Decision-Making via Local Economic Transactions.
Proceedings of the 37th International Conference on Machine Learning, 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020
2019
Games Econ. Behav., 2019
Games Econ. Behav., 2019
Proceedings of the World Wide Web Conference, 2019
Proceedings of the Web and Internet Economics - 15th International Conference, 2019
Optimal (and benchmark-optimal) competition complexity for additive buyers over independent items.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019
Proceedings of the Conference on Learning Theory, 2019
2018
ACM Trans. Economics and Comput., 2018
ACM Trans. Economics and Comput., 2018
Complement-Free Couples Must Communicate: A Hardness Result for Two-Player Combinatorial Auctions.
CoRR, 2018
Proceedings of the 27th USENIX Security Symposium, 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
2017
The Competition Complexity of Auctions: A Bulow-Klemperer Result for Multi-Dimensional Bidders.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017
2016
Encyclopedia of Algorithms, 2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016
2015
Simple Mechanisms for a Combinatorial Buyer and Applications to Revenue Monotonicity.
CoRR, 2015
Bayesian Truthful <i>Mechanisms</i> for Job Scheduling from Bi-criterion Approximation <i>Algorithms</i>.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015
Proceedings of the Second ACM Conference on Learning @ Scale, 2015
2014
Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion Approximation Algorithms.
CoRR, 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Proceedings of the Approximation, 2014
2013
Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012
Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
2011
Electron. Colloquium Comput. Complex., 2011
Electron. Colloquium Comput. Complex., 2011
2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010