| 2024 | STOC | A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations. | Shahar Dobzinski, Wenzheng Li, Aviad Rubinstein, Jan Vondrk |
| 2024 | STOC | Bilateral Trade with Correlated Values. | Shahar Dobzinski, Ariel Shaulker |
| 2022 | STOC | On the hardness of dominant strategy mechanism design. | Shahar Dobzinski, Shiri Ron, Jan Vondrk |
| 2021 | STOC | The communication complexity of payment computation. | Shahar Dobzinski, Shiri Ron |
| 2019 | STOC | The communication complexity of local search. | Yakov Babichenko, Shahar Dobzinski, Noam Nisan |
| 2018 | IJCAI | Combinatorial Cost Sharing. | Shahar Dobzinski, Shahar Ovadia |
| 2016 | FOCS | Computational Efficiency Requires Simple Taxation. | Shahar Dobzinski |
| 2016 | STOC | Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders. | Shahar Dobzinski |
| 2015 | SODA | On the Complexity of Computing an Equilibrium in Combinatorial Auctions. | Shahar Dobzinski, Hu Fu, Robert D. Kleinberg |
| 2014 | ICALP | Efficiency Guarantees in Auctions with Budgets. | Shahar Dobzinski, Renato Paes Leme |
| 2014 | STOC | Economic efficiency requires interaction. | Shahar Dobzinski, Noam Nisan, Sigal Oren |
| 2014 | SAGT | Shared Resource Management via Reward Schemes. | Shahar Dobzinski, Amir Ronen |
| 2013 | SODA | Communication Complexity of Combinatorial Auctions with Submodular Valuations. | Shahar Dobzinski, Jan Vondrk |
| 2012 | SODA | Sketching valuation functions. | Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden |
| 2012 | STOC | From query complexity to computational complexity. | Shahar Dobzinski, Jan Vondrk |
| 2011 | STOC | An impossibility result for truthful combinatorial auctions with submodular valuations. | Shahar Dobzinski |
| 2011 | STOC | Optimal auctions with correlated bidders are easy. | Shahar Dobzinski, Hu Fu, Robert D. Kleinberg |
| 2009 | FOCS | On the Power of Randomization in Algorithmic Mechanism Design. | Shahar Dobzinski, Shaddin Dughmi |
| 2009 | SAGT | A Modular Approach to Roberts' Theorem. | Shahar Dobzinski, Noam Nisan |
| 2008 | FOCS | Truthful Approximation Schemes for Single-Parameter Agents. | Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden |
| 2008 | FOCS | Multi-unit Auctions with Budget Limits. | Shahar Dobzinski, Ron Lavi, Noam Nisan |
| 2008 | SAGT | Prompt Mechanisms for Online Auctions. | Richard Cole, Shahar Dobzinski, Lisa Fleischer |
| 2008 | SAGT | Is Shapley Cost Sharing Optimal? | Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan |
| 2007 | STOC | Limitations of VCG-based mechanisms. | Shahar Dobzinski, Noam Nisan |
| 2006 | SODA | An improved approximation algorithm for combinatorial auctions with submodular bidders. | Shahar Dobzinski, Michael Schapira |
| 2006 | STOC | Truthful randomized mechanisms for combinatorial auctions. | Shahar Dobzinski, Noam Nisan, Michael Schapira |
| 2005 | STOC | Approximation algorithms for combinatorial auctions with complement-free bidders. | Shahar Dobzinski, Noam Nisan, Michael Schapira |