# Shaddin Dughmi

According to our database

Collaborative distances:

^{1}, Shaddin Dughmi authored at least 73 papers between 2008 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Persuasion and Incentives Through the Lens of Duality.

CoRR, 2019

The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem.

CoRR, 2019

Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice.

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018

Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice.

CoRR, 2018

Mitigating the Curse of Correlation in Security Games by Entropy Maximization.

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

On the Distortion of Voting With Multiple Representative Candidates.

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Posting Prices with Unknown Distributions.

ACM Trans. Economics and Comput., 2017

Bernoulli factories and black-box reductions in mechanism design.

SIGecom Exchanges, 2017

Algorithmic information structure design: a survey.

SIGecom Exchanges, 2017

On the Distortion of Voting with Multiple Representative Candidates.

CoRR, 2017

The Curse of Correlation in Security Games and Principle of Max-Entropy.

CoRR, 2017

Bernoulli Factories and Black-Box Reductions in Mechanism Design.

CoRR, 2017

Of the People: Voting Is More Effective with Representative Candidates.

CoRR, 2017

Bernoulli factories and black-box reductions in mechanism design.

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Algorithmic Persuasion with No Externalities.

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Of the People: Voting Is More Effective with Representative Candidates.

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016

Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding.

J. ACM, 2016

Private Bayesian Persuasion with Monotone Submodular Objectives.

CoRR, 2016

Persuasion with Limited Communication.

CoRR, 2016

Algorithmic Bayesian persuasion.

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Persuasion with Limited Communication.

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Lottery Pricing Equilibria.

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Signaling in Bayesian Stackelberg Games.

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

Dynamic Pricing with Limited Supply.

ACM Trans. Economics and Comput., 2015

SIGecom job market candidate profiles 2016.

SIGecom Exchanges, 2015

Limitations of randomized mechanisms for combinatorial auctions.

Games and Economic Behavior, 2015

Security Games With Information Leakage: Modeling and Computation.

CoRR, 2015

Algorithmic Bayesian Persuasion.

CoRR, 2015

Mixture Selection, Mechanism Design, and Signaling.

CoRR, 2015

Algorithmic Signaling of Features in Auction Design.

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Security Games with Information Leakage: Modeling and Computation.

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Mixture Selection, Mechanism Design, and Signaling.

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Exploring Information Asymmetry in Two-Stage Security Games.

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Black-Box Randomized Reductions in Algorithmic Mechanism Design.

SIAM J. Comput., 2014

Sampling and Representation Complexity of Revenue Maximization.

CoRR, 2014

On the Hardness of Signaling.

CoRR, 2014

Signaling in Quasipolynomial time.

CoRR, 2014

Sampling and Representation Complexity of Revenue Maximization.

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Constrained Signaling in Auction Design.

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

On the Hardness of Signaling.

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Solving Zero-Sum Security Games in Discretized Spatio-Temporal Domains.

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Constrained signaling for welfare and revenue maximization.

SIGecom Exchanges, 2013

On the Power of Randomization in Algorithmic Mechanism Design.

SIAM J. Comput., 2013

On the Approximation of Submodular Functions

CoRR, 2013

Constrained Signaling for Welfare and Revenue Maximization

CoRR, 2013

2012

Revenue Submodularity.

Theory of Computing, 2012

Mechanisms for Risk Averse Agents, Without Loss

CoRR, 2012

Combinatorial Auctions with Restricted Complements

CoRR, 2012

Dynamic pricing with limited supply.

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Combinatorial auctions with restricted complements.

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Dynamic covering for recommendation systems.

Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011

Truthful Approximation Schemes for Single-Parameter Agents.

SIAM J. Comput., 2011

Limitations of randomized mechanisms for combinatorial auctions

CoRR, 2011

An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries

CoRR, 2011

Dynamic Pricing with Limited Supply

CoRR, 2011

A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization

CoRR, 2011

From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders

CoRR, 2011

From convex optimization to randomized mechanisms: toward optimal combinatorial auctions.

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

A truthful randomized mechanism for combinatorial public projects via convex optimization.

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Posting Prices with Unknown Distributions.

Proceedings of the Innovations in Computer Science, 2011

Limitations of Randomized Mechanisms for Combinatorial Auctions.

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Truthful Assignment without Money

CoRR, 2010

Inapproximability for VCG-Based Combinatorial Auctions.

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Truthful assignment without money.

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Black-Box Randomized Reductions in Algorithmic Mechanism Design.

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Truthfulness via smoothed complexity.

Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009

Space Constrained Dynamic Covering

CoRR, 2009

Submodular Functions: Extensions, Distributions, and Algorithms. A Survey

CoRR, 2009

Amplified Hardness of Approximation for VCG-Based Mechanisms

CoRR, 2009

On the Power of Randomization in Algorithmic Mechanism Design

CoRR, 2009

Revenue submodularity.

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

On the Power of Randomization in Algorithmic Mechanism Design.

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

Truthful Approximation Schemes for Single-Parameter Agents.

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008