Shaddin Dughmi

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 47

Top Topics

Combinatorial Auctions

Mechanism Design

Top Venues

Publications

Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel
Limitations of Stochastic Selection Problems with Pairwise Independent Priors. STOC (2024)
Ramiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel, Aditya Prasad
On Supermodular Contracts and Dense Subgraphs. SODA (2024)
Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng
Open Problem: Can Local Regularization Learn All Multiclass Problems? COLT (2024)
Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng
Learnability is a Compact Property. CoRR (2024)
Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng
Regularization and Optimal Multiclass Learning. COLT (2024)
Shaddin Dughmi, Yusuf Hakan Kalayci, Grayson York
Is Transductive Learning Equivalent to PAC Learning? CoRR (2024)
Ramiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel, Aditya Prasad
On Supermodular Contracts and Dense Subgraphs. CoRR (2023)
Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel
On Sparsification of Stochastic Packing Problems. ICALP (2023)
Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng
Regularization and Optimal Multiclass Learning. CoRR (2023)
Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel
Limitations of Stochastic Selection Problems with Pairwise Independent Priors. CoRR (2023)
Curtis Bechtel, Shaddin Dughmi, Neel Patel
Delegated Pandora's box. CoRR (2022)
Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel
On Sparsification of Stochastic Packing Problems. CoRR (2022)
Curtis Bechtel, Shaddin Dughmi, Neel Patel
Delegated Pandora's Box. EC (2022)
Shaddin Dughmi
Matroid Secretary Is Equivalent to Contention Resolution. ITCS (2022)
Shaddin Dughmi, Haifeng Xu
Algorithmic Bayesian Persuasion. SIAM J. Comput. 50 (3) (2021)
Shaddin Dughmi
Matroid Secretary is Equivalent to Contention Resolution. CoRR (2021)
Curtis Bechtel, Shaddin Dughmi
Delegated Stochastic Probing. ITCS (2021)
Shaddin Dughmi, Jason D. Hartline, Robert D. Kleinberg, Rad Niazadeh
Bernoulli Factories and Black-box Reductions in Mechanism Design. J. ACM 68 (2) (2021)
Vincent Conitzer, Yuan Deng, Shaddin Dughmi
Bayesian Repeated Zero-Sum Games with Persistent State, with Application to Security Games. WINE (2020)
Shaddin Dughmi
The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem. ICALP (2020)
Curtis Bechtel, Shaddin Dughmi
Delegated Stochastic Probing. CoRR (2020)
Shaddin Dughmi, David Kempe, Ruixin Qiang
Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice. ITCS (2019)
Shaddin Dughmi
The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem. CoRR (2019)
Shaddin Dughmi
On the hardness of designing public signals. Games Econ. Behav. 118 (2019)
Shaddin Dughmi, Rad Niazadeh, Alexandros Psomas, S. Matthew Weinberg
Persuasion and Incentives Through the Lens of Duality. CoRR (2019)
Shaddin Dughmi, Katrina Ligett, Brendan Lucier
Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2014-2015. Games Econ. Behav. 118 (2019)
Shaddin Dughmi, Rad Niazadeh, Alexandros Psomas, S. Matthew Weinberg
Persuasion and Incentives Through the Lens of Duality. WINE (2019)
Yu Cheng, Shaddin Dughmi, David Kempe
On the Distortion of Voting With Multiple Representative Candidates. AAAI (2018)
Shaddin Dughmi, David Kempe, Ruixin Qiang
Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice. CoRR (2018)
Haifeng Xu, Shaddin Dughmi, Milind Tambe, Venil Loyd Noronha
Mitigating the Curse of Correlation in Security Games by Entropy Maximization. AAMAS (2018)
Yu Cheng, Shaddin Dughmi, David Kempe
Of the People: Voting Is More Effective with Representative Candidates. CoRR (2017)
Yu Cheng, Shaddin Dughmi, David Kempe
On the Distortion of Voting with Multiple Representative Candidates. CoRR (2017)
Shaddin Dughmi, Jason D. Hartline, Robert Kleinberg, Rad Niazadeh
Bernoulli factories and black-box reductions in mechanism design. STOC (2017)
Shaddin Dughmi, Jason D. Hartline, Robert D. Kleinberg, Rad Niazadeh
Bernoulli Factories and Black-Box Reductions in Mechanism Design. CoRR (2017)
Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi, Yaron Singer
Posting Prices with Unknown Distributions. ACM Trans. Economics and Comput. 5 (2) (2017)
Haifeng Xu, Milind Tambe, Shaddin Dughmi, Venil Loyd Noronha
The Curse of Correlation in Security Games and Principle of Max-Entropy. CoRR (2017)
Shaddin Dughmi, Jason D. Hartline, Robert Kleinberg, Rad Niazadeh
Bernoulli factories and black-box reductions in mechanism design. SIGecom Exch. 16 (1) (2017)
Shaddin Dughmi, Haifeng Xu
Algorithmic Persuasion with No Externalities. EC (2017)
Yu Cheng, Shaddin Dughmi, David Kempe
Of the People: Voting Is More Effective with Representative Candidates. EC (2017)
Shaddin Dughmi
Algorithmic information structure design: a survey. SIGecom Exch. 15 (2) (2017)
Shaddin Dughmi, Alon Eden, Michal Feldman, Amos Fiat, Stefano Leonardi
Lottery Pricing Equilibria. EC (2016)
Shaddin Dughmi, Tim Roughgarden, Qiqi Yan
Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding. J. ACM 63 (4) (2016)
Shaddin Dughmi, David Kempe, Ruixin Qiang
Persuasion with Limited Communication. EC (2016)
Shaddin Dughmi, Haifeng Xu
Private Bayesian Persuasion with Monotone Submodular Objectives. CoRR (2016)
Shaddin Dughmi, David Kempe, Ruixin Qiang
Persuasion with Limited Communication. CoRR (2016)
Shaddin Dughmi, Haifeng Xu
Algorithmic Bayesian persuasion. STOC (2016)
Haifeng Xu, Rupert Freeman, Vincent Conitzer, Shaddin Dughmi, Milind Tambe
Signaling in Bayesian Stackelberg Games. AAMAS (2016)
Shaddin Dughmi, Nicole Immorlica, Ryan O'Donnell, Li-Yang Tan
Algorithmic Signaling of Features in Auction Design. SAGT (2015)
Shaddin Dughmi, Haifeng Xu
Algorithmic Bayesian Persuasion. CoRR (2015)
Haifeng Xu, Albert Xin Jiang, Arunesh Sinha, Zinovi Rabinovich, Shaddin Dughmi, Milind Tambe
Security Games with Information Leakage: Modeling and Computation. IJCAI (2015)
Shaddin Dughmi, Vasilis Gkatzelis, Jason D. Hartline
SIGecom job market candidate profiles 2016. SIGecom Exch. 14 (1) (2015)
Haifeng Xu, Zinovi Rabinovich, Shaddin Dughmi, Milind Tambe
Exploring Information Asymmetry in Two-Stage Security Games. AAAI (2015)
Haifeng Xu, Albert Xin Jiang, Arunesh Sinha, Zinovi Rabinovich, Shaddin Dughmi, Milind Tambe
Security Games With Information Leakage: Modeling and Computation. CoRR (2015)
Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng
Mixture Selection, Mechanism Design, and Signaling. FOCS (2015)
Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng
Mixture Selection, Mechanism Design, and Signaling. CoRR (2015)
Moshe Babaioff, Shaddin Dughmi, Robert D. Kleinberg, Aleksandrs Slivkins
Dynamic Pricing with Limited Supply. ACM Trans. Economics and Comput. 3 (1) (2015)
Shaddin Dughmi, Jan Vondrák
Limitations of randomized mechanisms for combinatorial auctions. Games Econ. Behav. 92 (2015)
Haifeng Xu, Fei Fang, Albert Xin Jiang, Vincent Conitzer, Shaddin Dughmi, Milind Tambe
Solving Zero-Sum Security Games in Discretized Spatio-Temporal Domains. AAAI (2014)
Shaddin Dughmi, Tim Roughgarden
Black-Box Randomized Reductions in Algorithmic Mechanism Design. SIAM J. Comput. 43 (1) (2014)
Shaddin Dughmi
On the Hardness of Signaling. CoRR (2014)
Shaddin Dughmi, Li Han, Noam Nisan
Sampling and Representation Complexity of Revenue Maximization. CoRR (2014)
Shaddin Dughmi, Nicole Immorlica, Aaron Roth
Constrained Signaling in Auction Design. SODA (2014)
Shaddin Dughmi
On the Hardness of Signaling. FOCS (2014)
Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Shang-Hua Teng
Signaling in Quasipolynomial time. CoRR (2014)
Shaddin Dughmi, Li Han, Noam Nisan
Sampling and Representation Complexity of Revenue Maximization. WINE (2014)
Shahar Dobzinski, Shaddin Dughmi
On the Power of Randomization in Algorithmic Mechanism Design. SIAM J. Comput. 42 (6) (2013)
Shaddin Dughmi, Nicole Immorlica, Aaron Roth
Constrained signaling for welfare and revenue maximization. SIGecom Exch. 12 (1) (2013)
Shaddin Dughmi, Nicole Immorlica, Aaron Roth
Constrained Signaling for Welfare and Revenue Maximization CoRR (2013)
Nikhil R. Devanur, Shaddin Dughmi, Roy Schwartz, Ankit Sharma, Mohit Singh
On the Approximation of Submodular Functions CoRR (2013)
Shaddin Dughmi, Yuval Peres
Mechanisms for Risk Averse Agents, Without Loss CoRR (2012)
Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan
Revenue Submodularity. Theory Comput. 8 (1) (2012)
Ioannis Antonellis, Anish Das Sarma, Shaddin Dughmi
Dynamic covering for recommendation systems. CIKM (2012)
Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, Aleksandrs Slivkins
Dynamic pricing with limited supply. EC (2012)
Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, Tim Roughgarden
Combinatorial Auctions with Restricted Complements CoRR (2012)
Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, Tim Roughgarden
Combinatorial auctions with restricted complements. EC (2012)
Shaddin Dughmi, Tim Roughgarden, Jan Vondrák, Qiqi Yan
An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries CoRR (2011)
Shaddin Dughmi, Jan Vondrák
Limitations of Randomized Mechanisms for Combinatorial Auctions. FOCS (2011)
Shaddin Dughmi, Tim Roughgarden, Qiqi Yan
From convex optimization to randomized mechanisms: toward optimal combinatorial auctions. STOC (2011)
Shaddin Dughmi
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization CoRR (2011)
Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, Aleksandrs Slivkins
Dynamic Pricing with Limited Supply CoRR (2011)
Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi, Yaron Singer
Posting Prices with Unknown Distributions. ICS (2011)
Shaddin Dughmi, Tim Roughgarden, Qiqi Yan
From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders CoRR (2011)
Shaddin Dughmi
A truthful randomized mechanism for combinatorial public projects via convex optimization. EC (2011)
Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden
Truthful Approximation Schemes for Single-Parameter Agents. SIAM J. Comput. 40 (3) (2011)
Shaddin Dughmi, Jan Vondrák
Limitations of randomized mechanisms for combinatorial auctions CoRR (2011)
Shaddin Dughmi, Arpita Ghosh
Truthful assignment without money. EC (2010)
David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer, Christopher Umans
Inapproximability for VCG-Based Combinatorial Auctions. SODA (2010)
Shaddin Dughmi, Arpita Ghosh
Truthful Assignment without Money CoRR (2010)
Shaddin Dughmi, Tim Roughgarden
Truthfulness via smoothed complexity. BQGT (2010)
Shaddin Dughmi, Tim Roughgarden
Black-Box Randomized Reductions in Algorithmic Mechanism Design. FOCS (2010)
Shahar Dobzinski, Shaddin Dughmi
On the Power of Randomization in Algorithmic Mechanism Design. FOCS (2009)
Shahar Dobzinski, Shaddin Dughmi
On the Power of Randomization in Algorithmic Mechanism Design CoRR (2009)
Ioannis Antonellis, Anish Das Sarma, Shaddin Dughmi
Space Constrained Dynamic Covering CoRR (2009)
Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan
Revenue Submodularity. AMMA (2009)
Shaddin Dughmi, Hu Fu, Robert Kleinberg
Amplified Hardness of Approximation for VCG-Based Mechanisms CoRR (2009)
Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan
Revenue submodularity. EC (2009)
Shaddin Dughmi
Submodular Functions: Extensions, Distributions, and Algorithms. A Survey CoRR (2009)
Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden
Truthful Approximation Schemes for Single-Parameter Agents. FOCS (2008)