Local Regularizers are Not Transductive Learners
Sky Jafar, Julian Asilis, and Shaddin Dughmi.
COLT 2025.
From Contention Resolution to Matroid Secretary and Back
Shaddin Dughmi.
SIAM Journal on Computing (SICOMP) 2025.
journal version
Proper Learnability and the Role of Unlabeled Data.
Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, and Shang-Hua Teng.
ALT 2025.
Is Transductive Learning Equivalent to PAC Learning?
Shaddin Dughmi, Yusuf Hakan Kalayci, and Grayson York.
ALT 2025.
Efficient Multi-agent Delegated Search
Curtis Bechtel and Shaddin Dughmi.
AAMAS 2025.
Transductive Learning is Compact.
Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, and Shang-Hua Teng.
NeurIPS 2024.
Open Problem: Can Local Regularization Learn All Multiclass Problems?
Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, and Shang-Hua Teng.
COLT (open problems track) 2024.
Regularization and Optimal Multiclass Learning.
Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, and Shang-Hua Teng.
COLT 2024.
Limitations of Stochastic Selection with Pairwise Independent Priors.
Shaddin Dughmi, Yusuf Hakan Kalayci, and Neel Patel.
STOC 2024.
On Supermodular Contracts and Dense Subgraphs.
Ramiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel, and Aditya Prasad.
SODA 2024.
On Sparsification of Stochastic Packing Problems.
Shaddin Dughmi, Yusuf Hakan Kalayci, and Neel Patel.
ICALP 2023.
Delegated Pandora's Box.
Curtis Bechtel, Shaddin Dughmi, and Neel Patel.
EC 2022.
Matroid Secretary is Equivalent to Contention Resolution
Shaddin Dughmi.
ITCS 2022.
proceedings version
| talk video
Delegated Stochastic Probing.
Curtis Bechtel and Shaddin Dughmi.
ITCS 2021.
proceedings version
Bayesian Repeated Zero-Sum Games with Persistent State, with Application to Security Games.
Vincent Conitzer, Yuan Deng, and Shaddin Dughmi.
WINE 2020.
The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem.
Shaddin Dughmi.
ICALP 2020.
proceedings version
| talk video
Persuasion and Incentives through the Lens of Duality.
Shaddin Dughmi, Rad Niazadeh, Alexandros Psomas, and S. Matthew Weinberg.
WINE 2019.
Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice.
Shaddin Dughmi, David Kempe, and Ruixin Qiang.
ITCS 2019.
Mitigating the Curse of Correlation in Security Games by Entropy Maximization.
Haifeng Xu, Shaddin Dughmi, Milind Tambe, and Venil Loyd Noronha.
AAMAS 2018.
On the Distortion of Voting with Multiple Representative Candidates.
Yu Cheng, Shaddin Dughmi, and David Kempe.
AAAI 2018.
Bernoulli Factories and Black-Box Reductions in Mechanism Design
Shaddin Dughmi, Jason Hartline, Robert Kleinberg, and Rad Niazadeh.
STOC 2017 and Journal of the ACM (JACM) 2021.
proceedings version
| journal version
Algorithmic Persuasion with no Externalities
Shaddin Dughmi and Haifeng Xu.
EC 2017.
Of the People: Voting is More Effective with Representative Candidates
Yu Cheng, Shaddin Dughmi, and David Kempe.
EC 2017.
Persuasion with Limited Communication
Shaddin Dughmi, David Kempe, and Ruixin Qiang.
EC 2016.
Lottery Pricing Equilibria
Shaddin Dughmi, Alon Eden, Michal Feldman, Amos Fiat, and Stefano Leonardi.
EC 2016.
Algorithmic Bayesian Persuasion
Shaddin Dughmi and Haifeng Xu.
STOC 2016 and SICOMP Special Issue for STOC 2016.
proceedings version
| journal version
Signaling in Bayesian Stackelberg Games
Haifeng Xu, Rupert Freeman, Vincent Conitzer, Shaddin Dughmi, and Milind Tambe.
AAMAS 2016.
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.
Mixture Selection, Mechanism Design, and Signaling
Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, and Shang-Hua Teng.
FOCS 2015.
Algorithmic Signaling of Features in Auction Design
Shaddin Dughmi, Nicole Immorlica, Ryan O'Donnell, and Li-Yang Tan.
SAGT 2015.
Security Games with Information Leakage: Modeling and Computation
Haifeng Xu, Albert Xin Jiang, Arunesh Sinha, Zinovi Rabinovich, Shaddin Dughmi, and Milind Tambe.
IJCAI 2015.
Exploring Information Asymmetry in Two-Stage Security Games
Haifeng Xu, Zinovi Rabinovich, Shaddin Dughmi, and Milind Tambe.
AAAI 2015.
proceedings version
Signaling in Quasipolynomial time
Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, and Shang-Hua Teng.
Manuscript.
Sampling and Representation Complexity of Revenue Maximization
Shaddin Dughmi, Li Han, and Noam Nisan.
WINE 2014.
On the Hardness of Designing Public Signals
Shaddin Dughmi.
FOCS 2014 and GEB 2018.
proceedings version
| journal version
| talk video
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.
online appendix
Constrained Signaling in Auction Design
Shaddin Dughmi, Nicole Immorlica, and Aaron Roth.
SODA 2014.
proceedings version
SIGecom article
On the Approximation of Submodular Functions
Nikhil R. Devanur, Shaddin Dughmi, Roy Schwartz, Ankit Sharma, and Mohit Singh.
Manuscript.
Combinatorial Auctions with Restricted Complements
Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, and Tim Roughgarden.
EC 2012.
proceedings version
Dynamic Pricing with Limited Supply
Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, and Aleksandrs Slivkins.
EC 2012 and TEAC 2015.
Dynamic Covering for Recommendation Systems
Ioannis Antonellis, Anish Das Sarma, and Shaddin Dughmi.
CIKM 2012.
Mechanisms for Risk Averse Agents, Without Loss
Shaddin Dughmi and Yuval Peres.
Workshop on Risk Aversion in Algorithmic Game Theory and Mechanism Design at EC 2012.
Limitations of Randomized Mechanisms for Combinatorial Auctions
Shaddin Dughmi and Jan Vondrak.
FOCS 2011 and GEB 2014.
proceedings version
| journal version
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.
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.
Posting Prices with Unknown Distributions
Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi, and Yaron Singer.
ICS 2011.
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
Truthful Assignment without Money
Shaddin Dughmi and Arpita Ghosh.
EC 2010.
proceedings version
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.
Amplified Hardness of Approximation for VCG-Based Mechanisms
Shaddin Dughmi, Hu Fu, and Robert Kleinberg.
Manuscript.
Merged with two closely related, independent discoveries into SODA 2010 paper.
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
Revenue Submodularity
Shaddin Dughmi, Tim Roughgarden, and Mukund Sundararajan.
EC 2009 and Theory of Computing 2012.
proceedings version
| journal version
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
Completeness of the Authentication Tests
Shaddin Dughmi, Joshua D. Guttman, and F. Javier Thayer.
ESORICS 2007.
Searching for Shapes in Cryptographic Protocols
Shaddin Dughmi, Joshua D. Guttman, and F. Javier Thayer.
TACAS 2007.
Skeletons and the Shapes of Bundles
Shaddin Dughmi, Joshua D. Guttman, and F. Javier Thayer.
WITS 2007.
Skeletons, Homomorphisms and Shapes: Characterizing Protocol Executions
Shaddin Dughmi, Joshua D. Guttman, and F. Javier Thayer.
MFPS 2007.