# S. Matthew Weinberg

According to our database

Collaborative distances:

^{1}, S. Matthew Weinberg authored at least 76 papers between 2010 and 2021.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Online presence:

#### On csauthors.net:

## Bibliography

2021

J. ACM, 2021

Oper. Res., 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

SIGecom Exch., 2020

J. ACM, 2020

CoRR, 2020

CoRR, 2020

CoRR, 2020

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

Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Credible, Truthful, and Two-Round (Optimal) Auctions via Cryptographic Commitments.

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

Matroid prophet inequalities and applications to multi-dimensional mechanism design.

Games Econ. Behav., 2019

Games Econ. Behav., 2019

CoRR, 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 10th Innovations in Theoretical Computer Science Conference, 2019

Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries.

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

Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity.

ACM Trans. Economics and Comput., 2018

ACM Trans. Economics and Comput., 2018

SIGecom Exch., 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

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

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

The Optimal Mechanism for Selling to a Budget Constrained Buyer: The General Case.

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

SIGecom Exch., 2016

CoRR, 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

J. Econ. Theory, 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

PhD thesis, 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

SIGecom Exch., 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