The communication complexity of payment computation. - Shahar Dobzinski; Shiri Ron (STOC, 2021)

On the hardness of dominant strategy mechanism design. - Shahar Dobzinski; Shiri Ron; Jan Vondrák (STOC, 2022)

On the Computational Complexity of Mechanism Design in Single-Crossing Settings. - Moshe Babaioff; Shahar Dobzinski; Shiri Ron (EC, 2023)

Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier. - Shiri Ron; Clayton Thomas; S. Matthew Weinberg; Qianfan Zhang 002 (FOCS, 2024)

Impossibilities for Obviously Strategy-Proof Mechanisms. - Shiri Ron (SODA, 2024)

On the Power of Randomization for Obviously Strategy-Proof Mechanisms. - Shiri Ron; Daniel Schoepflin 001 (AAAI, 2025)