All Publications and Manuscripts (chronological)

  1. The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem.
    Shaddin Dughmi. Working Paper.

  2. Persuasion and Incentives through the Lens of Duality.
    Shaddin Dughmi, Rad Niazadeh, Alexandros Psomas, and S. Matthew Weinberg. WINE 2019.

  3. Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice.
    Shaddin Dughmi, David Kempe, and Ruixin Qiang. ITCS 2019.

  4. Mitigating the Curse of Correlation in Security Games by Entropy Maximization.
    Haifeng Xu, Shaddin Dughmi, Milind Tambe, and Venil Loyd Noronha. AAMAS 2018.

  5. On the Distortion of Voting with Multiple Representative Candidates.
    Yu Cheng, Shaddin Dughmi, and David Kempe. AAAI 2018.

  6. Bernoulli Factories and Black-Box Reductions in Mechanism Design
    Shaddin Dughmi, Jason Hartline, Robert Kleinberg, and Rad Niazadeh. STOC 2017.

  7. Algorithmic Persuasion with no Externalities
    Shaddin Dughmi and Haifeng Xu. EC 2017.

  8. Of the People: Voting is More Effective with Representative Candidates
    Yu Cheng, Shaddin Dughmi, and David Kempe. EC 2017.

  9. Algorithmic Information Structure Design: A Survey
    Shaddin Dughmi. SIGecom Exchanges, 2017.

  10. Persuasion with Limited Communication
    Shaddin Dughmi, David Kempe, and Ruixin Qiang. EC 2016.

  11. Lottery Pricing Equilibria
    Shaddin Dughmi, Alon Eden, Michal Feldman, Amos Fiat, and Stefano Leonardi. EC 2016.

  12. Algorithmic Bayesian Persuasion
    Shaddin Dughmi and Haifeng Xu. STOC 2016 and SICOMP Special Issue for STOC 2016 .
    proceedings version | journal version

  13. Signaling in Bayesian Stackelberg Games
    Haifeng Xu, Rupert Freeman, Vincent Conitzer, Shaddin Dughmi, and Milind Tambe. AAMAS 2016.
    proceedings version

  14. Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding
    Shaddin Dughmi, Tim Roughgarden, and Qiqi Yan. Journal of the ACM (JACM), 2016.
    Merges STOC 11 and EC 11 papers.

  15. Mixture Selection, Mechanism Design, and Signaling
    Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, and Shang-Hua Teng. FOCS 2015.

  16. Algorithmic Signaling of Features in Auction Design
    Shaddin Dughmi, Nicole Immorlica, Ryan O'Donnell, and Li-Yang Tan. SAGT 2015.

  17. Security Games with Information Leakage: Modeling and Computation
    Haifeng Xu, Albert Xin Jiang, Arunesh Sinha, Zinovi Rabinovich, Shaddin Dughmi, and Milind Tambe. IJCAI 2015.

  18. Exploring Information Asymmetry in Two-Stage Security Games
    Haifeng Xu, Zinovi Rabinovich, Shaddin Dughmi, and Milind Tambe. AAAI 2015.
    proceedings version

  19. Signaling in Quasipolynomial time
    Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, and Shang-Hua Teng. Manuscript, 2014.

  20. Sampling and Representation Complexity of Revenue Maximization
    Shaddin Dughmi, Li Han, and Noam Nisan. WINE 2014.

  21. On the Hardness of Designing Public Signals
    Shaddin Dughmi. FOCS 2014 and GEB 2018.
    proceedings version
    | journal version | talk video

  22. Solving Zero-Sum Security Games in Discretized Spatio-Temporal Domains
    Haifeng Xu, Fei Fang, Albert Xin Jiang, Vincent Conitzer, Shaddin Dughmi, and Milind Tambe. AAAI 2014.
    proceedings version
    | online appendix

  23. Constrained Signaling in Auction Design
    Shaddin Dughmi, Nicole Immorlica, and Aaron Roth. SODA 2014.
    proceedings version SIGecom article

  24. On the Approximation of Submodular Functions
    Nikhil R. Devanur, Shaddin Dughmi, Roy Schwartz, Ankit Sharma, and Mohit Singh. Manuscript, 2013.

  25. Combinatorial Auctions with Restricted Complements
    Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, and Tim Roughgarden. EC 2012.
    proceedings version

  26. Dynamic Pricing with Limited Supply
    Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, and Aleksandrs Slivkins. EC 2012 and TEAC 2015 .

  27. Dynamic Covering for Recommendation Systems
    Ioannis Antonellis, Anish Das Sarma, and Shaddin Dughmi. CIKM 2012.

  28. Mechanisms for Risk Averse Agents, Without Loss
    Shaddin Dughmi and Yuval Peres. Presented at the workshop on risk aversion in algorithmic game theory and mechanism design, held in conjunction with EC 2012.

  29. Randomization and Computation in Strategic Settings
    Shaddin Dughmi. PhD Thesis, Stanford University, August 2011.
    Winner of the Arthur L. Samuel Thesis Award, given in recognition of the best PhD thesis in the computer science department at Stanford University.

  30. Limitations of Randomized Mechanisms for Combinatorial Auctions
    Shaddin Dughmi and Jan Vondrak. FOCS 2011 and GEB 2014.
    proceedings version
    | journal version

  31. A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
    Shaddin Dughmi. EC 2011, co-winner of the Best Student Paper Award.
    Merged with STOC 11 paper into a JACM article.

  32. From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions
    Shaddin Dughmi, Tim Roughgarden, and Qiqi Yan. STOC 2011.
    Merged with EC 11 paper into a JACM article.

  33. Posting Prices with Unknown Distributions
    Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi, and Yaron Singer. ICS 2011.

  34. Black-Box Randomized Reductions in Algorithmic Mechanism Design
    Shaddin Dughmi and Tim Roughgarden. FOCS 2010 and SICOMP special issue for FOCS 2010. .
    proceedings version
    | journal version

  35. Truthful Assignment without Money
    Shaddin Dughmi and Arpita Ghosh. EC 2010.
    proceedings version

  36. Inapproximability for VCG-Based Combinatorial Auctions
    Dave Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos Papadimitriou, Michael Schapira, Yaron Singer, and Chris Umans. SODA 2010.

  37. Amplified Hardness of Approximation for VCG-Based Mechanisms
    Shaddin Dughmi, Hu Fu, and Robert Kleinberg. Merged with two closely related, independent discoveries into Inapproximability for VCG-Based Combinatorial Auctions above.
    arXiv:0907.1948v2 [cs.GT].

  38. Submodular Functions: Extensions, Distributions, and Algorithms. A Survey.
    Shaddin Dughmi. PhD Qualifying Exam Report, Department of Computer Science, Stanford University.
    arXiv:0912.0322v4 [cs.DS].

  39. On the Power of Randomization in Algorithmic Mechanism Design
    Shahar Dobzinski and Shaddin Dughmi. FOCS 2009 and SICOMP special issue for FOCS 2009.
    proceedings version | journal version

  40. Revenue Submodularity
    Shaddin Dughmi, Tim Roughgarden, and Mukund Sundararajan. EC 2009 and Theory of Computing 2012.
    proceedings version | journal version

  41. Truthful Approximation Schemes for Single-Parameter Agents
    Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, and Tim Roughgarden. FOCS 2008 and SICOMP Special issue for FOCS 2008.
    proceedings version | journal version

  42. Completeness of the Authentication Tests
    Shaddin Dughmi, Joshua D. Guttman, and F. Javier Thayer. ESORICS 2007.

  43. Searching for Shapes in Cryptographic Protocols
    Shaddin Dughmi, Joshua D. Guttman, and F. Javier Thayer. TACAS 2007.

  44. Skeletons and the Shapes of Bundles
    Shaddin Dughmi, Joshua D. Guttman, and F. Javier Thayer. WITS 2007.

  45. Skeletons, Homomorphisms and Shapes: Characterizing Protocol Executions
    Shaddin Dughmi, Joshua D. Guttman, and F. Javier Thayer. MFPS 2007.