default search action
Shaddin Dughmi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c44]Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng:
Regularization and Optimal Multiclass Learning. COLT 2024: 260-310 - [c43]Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng:
Open Problem: Can Local Regularization Learn All Multiclass Problems? COLT 2024: 5301-5305 - [c42]Ramiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel, Aditya Prasad:
On Supermodular Contracts and Dense Subgraphs. SODA 2024: 109-132 - [c41]Shaddin Dughmi
, Yusuf Hakan Kalayci
Limitations of Stochastic Selection Problems with Pairwise Independent Priors. STOC 2024: 479-490 - [i38]Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng:
Learnability is a Compact Property. CoRR abs/2402.10360 (2024) - [i37]Shaddin Dughmi, Yusuf Hakan Kalayci, Grayson York:
Is Transductive Learning Equivalent to PAC Learning? CoRR abs/2405.05190 (2024) - 2023
- [c40]Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel:
On Sparsification of Stochastic Packing Problems. ICALP 2023: 51:1-51:17 - [i36]Ramiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel, Aditya Prasad:
On Supermodular Contracts and Dense Subgraphs. CoRR abs/2308.07473 (2023) - [i35]Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng:
Regularization and Optimal Multiclass Learning. CoRR abs/2309.13692 (2023) - [i34]Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel:
Limitations of Stochastic Selection Problems with Pairwise Independent Priors. CoRR abs/2310.05240 (2023) - 2022
- [c39]Shaddin Dughmi:
Matroid Secretary Is Equivalent to Contention Resolution. ITCS 2022: 58:1-58:23 - [c38]Curtis Bechtel, Shaddin Dughmi, Neel Patel:
Delegated Pandora's Box. EC 2022: 666-693 - [i33]Curtis Bechtel, Shaddin Dughmi, Neel Patel:
Delegated Pandora's box. CoRR abs/2202.10382 (2022) - [i32]Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel:
On Sparsification of Stochastic Packing Problems. CoRR abs/2211.07829 (2022) - 2021
- [j16]Shaddin Dughmi, Jason D. Hartline, Robert D. Kleinberg
Bernoulli Factories and Black-box Reductions in Mechanism Design. J. ACM 68(2): 10:1-10:30 (2021) - [j15]Shaddin Dughmi, Haifeng Xu:
Algorithmic Bayesian Persuasion. SIAM J. Comput. 50(3) (2021) - [c37]Curtis Bechtel
Delegated Stochastic Probing. ITCS 2021: 37:1-37:19 - [i31]Shaddin Dughmi:
Matroid Secretary is Equivalent to Contention Resolution. CoRR abs/2103.04205 (2021) - 2020
- [c36]Shaddin Dughmi:
The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem. ICALP 2020: 42:1-42:18 - [c35]Vincent Conitzer, Yuan Deng, Shaddin Dughmi:
Bayesian Repeated Zero-Sum Games with Persistent State, with Application to Security Games. WINE 2020: 444-458 - [i30]Curtis Bechtel, Shaddin Dughmi:
Delegated Stochastic Probing. CoRR abs/2010.14718 (2020)
2010 – 2019
- 2019
- [j14]Shaddin Dughmi, Katrina Ligett
Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2014-2015. Games Econ. Behav. 118: 493 (2019) - [j13]Shaddin Dughmi:
On the hardness of designing public signals. Games Econ. Behav. 118: 609-625 (2019) - [c34]Shaddin Dughmi, David Kempe, Ruixin Qiang:
Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice. ITCS 2019: 31:1-31:20 - [c33]Shaddin Dughmi, Rad Niazadeh
Persuasion and Incentives Through the Lens of Duality. WINE 2019: 142-155 - [i29]Shaddin Dughmi:
The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem. CoRR abs/1909.04268 (2019) - [i28]Shaddin Dughmi, Rad Niazadeh, Alexandros Psomas, S. Matthew Weinberg:
Persuasion and Incentives Through the Lens of Duality. CoRR abs/1909.10584 (2019) - 2018
- [c32]Yu Cheng, Shaddin Dughmi, David Kempe:
On the Distortion of Voting With Multiple Representative Candidates. AAAI 2018: 973-980 - [c31]Haifeng Xu, Shaddin Dughmi, Milind Tambe, Venil Loyd Noronha:
Mitigating the Curse of Correlation in Security Games by Entropy Maximization. AAMAS 2018: 2127-2129 - [i27]Shaddin Dughmi, David Kempe, Ruixin Qiang:
Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice. CoRR abs/1811.11417 (2018) - 2017
- [j12]Shaddin Dughmi:
Algorithmic information structure design: a survey. SIGecom Exch. 15(2): 2-24 (2017) - [j11]Shaddin Dughmi, Jason D. Hartline, Robert Kleinberg, Rad Niazadeh
Bernoulli factories and black-box reductions in mechanism design. SIGecom Exch. 16(1): 58-71 (2017) - [j10]Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi, Yaron Singer:
Posting Prices with Unknown Distributions. ACM Trans. Economics and Comput. 5(2): 13:1-13:20 (2017) - [c30]Yu Cheng
Of the People: Voting Is More Effective with Representative Candidates. EC 2017: 305-322 - [c29]Shaddin Dughmi, Haifeng Xu:
Algorithmic Persuasion with No Externalities. EC 2017: 351-368 - [c28]Shaddin Dughmi, Jason D. Hartline, Robert Kleinberg, Rad Niazadeh
Bernoulli factories and black-box reductions in mechanism design. STOC 2017: 158-169 - [i26]Haifeng Xu, Milind Tambe, Shaddin Dughmi, Venil Loyd Noronha:
The Curse of Correlation in Security Games and Principle of Max-Entropy. CoRR abs/1703.03912 (2017) - [i25]Shaddin Dughmi, Jason D. Hartline, Robert D. Kleinberg, Rad Niazadeh:
Bernoulli Factories and Black-Box Reductions in Mechanism Design. CoRR abs/1703.04143 (2017) - [i24]Yu Cheng, Shaddin Dughmi, David Kempe:
Of the People: Voting Is More Effective with Representative Candidates. CoRR abs/1705.01736 (2017) - [i23]Yu Cheng, Shaddin Dughmi, David Kempe:
On the Distortion of Voting with Multiple Representative Candidates. CoRR abs/1711.07600 (2017) - 2016
- [j9]Shaddin Dughmi, Tim Roughgarden, Qiqi Yan:
Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding. J. ACM 63(4): 30:1-30:33 (2016) - [c27]Haifeng Xu, Rupert Freeman, Vincent Conitzer, Shaddin Dughmi, Milind Tambe:
Signaling in Bayesian Stackelberg Games. AAMAS 2016: 150-158 - [c26]Shaddin Dughmi, Alon Eden, Michal Feldman, Amos Fiat, Stefano Leonardi:
Lottery Pricing Equilibria. EC 2016: 401-418 - [c25]Shaddin Dughmi, David Kempe, Ruixin Qiang:
Persuasion with Limited Communication. EC 2016: 663-680 - [c24]Shaddin Dughmi, Haifeng Xu:
Algorithmic Bayesian persuasion. STOC 2016: 412-425 - [i22]Shaddin Dughmi, David Kempe, Ruixin Qiang:
Persuasion with Limited Communication. CoRR abs/1606.07843 (2016) - [i21]Shaddin Dughmi, Haifeng Xu:
Private Bayesian Persuasion with Monotone Submodular Objectives. CoRR abs/1609.06825 (2016) - 2015
- [j8]Shaddin Dughmi, Jan Vondrák:
Limitations of randomized mechanisms for combinatorial auctions. Games Econ. Behav. 92: 370-400 (2015) - [j7]Shaddin Dughmi, Vasilis Gkatzelis, Jason D. Hartline:
SIGecom job market candidate profiles 2016. SIGecom Exch. 14(1): 2-40 (2015) - [j6]Moshe Babaioff, Shaddin Dughmi, Robert D. Kleinberg
Dynamic Pricing with Limited Supply. ACM Trans. Economics and Comput. 3(1): 4:1-4:26 (2015) - [c23]Haifeng Xu, Zinovi Rabinovich, Shaddin Dughmi, Milind Tambe:
Exploring Information Asymmetry in Two-Stage Security Games. AAAI 2015: 1057-1063 - [c22]Yu Cheng
Mixture Selection, Mechanism Design, and Signaling. FOCS 2015: 1426-1445 - [c21]Haifeng Xu, Albert Xin Jiang, Arunesh Sinha, Zinovi Rabinovich, Shaddin Dughmi, Milind Tambe:
Security Games with Information Leakage: Modeling and Computation. IJCAI 2015: 674-680 - [c20]Shaddin Dughmi, Nicole Immorlica, Ryan O'Donnell, Li-Yang Tan:
Algorithmic Signaling of Features in Auction Design. SAGT 2015: 150-162 - [i20]Shaddin Dughmi, Haifeng Xu:
Algorithmic Bayesian Persuasion. CoRR abs/1503.05988 (2015) - [i19]Haifeng Xu, Albert Xin Jiang, Arunesh Sinha, Zinovi Rabinovich, Shaddin Dughmi, Milind Tambe:
Security Games With Information Leakage: Modeling and Computation. CoRR abs/1504.06058 (2015) - [i18]Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng:
Mixture Selection, Mechanism Design, and Signaling. CoRR abs/1508.03679 (2015) - 2014
- [j5]Shaddin Dughmi, Tim Roughgarden:
Black-Box Randomized Reductions in Algorithmic Mechanism Design. SIAM J. Comput. 43(1): 312-336 (2014) - [c19]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: 1500-1506 - [c18]Shaddin Dughmi:
On the Hardness of Signaling. FOCS 2014: 354-363 - [c17]Shaddin Dughmi, Nicole Immorlica, Aaron Roth
Constrained Signaling in Auction Design. SODA 2014: 1341-1357 - [c16]Shaddin Dughmi, Li Han, Noam Nisan:
Sampling and Representation Complexity of Revenue Maximization. WINE 2014: 277-291 - [i17]Shaddin Dughmi:
On the Hardness of Signaling. CoRR abs/1402.4194 (2014) - [i16]Shaddin Dughmi, Li Han, Noam Nisan:
Sampling and Representation Complexity of Revenue Maximization. CoRR abs/1402.4535 (2014) - [i15]Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Shang-Hua Teng:
Signaling in Quasipolynomial time. CoRR abs/1410.3033 (2014) - 2013
- [j4]Shahar Dobzinski, Shaddin Dughmi:
On the Power of Randomization in Algorithmic Mechanism Design. SIAM J. Comput. 42(6): 2287-2304 (2013) - [j3]Shaddin Dughmi, Nicole Immorlica, Aaron Roth:
Constrained signaling for welfare and revenue maximization. SIGecom Exch. 12(1): 53-56 (2013) - [i14]Shaddin Dughmi, Nicole Immorlica, Aaron Roth:
Constrained Signaling for Welfare and Revenue Maximization. CoRR abs/1302.4713 (2013) - [i13]Nikhil R. Devanur, Shaddin Dughmi, Roy Schwartz, Ankit Sharma, Mohit Singh:
On the Approximation of Submodular Functions. CoRR abs/1304.4948 (2013) - 2012
- [j2]Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan:
Revenue Submodularity. Theory Comput. 8(1): 95-119 (2012) - [c15]Ioannis Antonellis, Anish Das Sarma, Shaddin Dughmi:
Dynamic covering for recommendation systems. CIKM 2012: 26-34 - [c14]Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, Tim Roughgarden:
Combinatorial auctions with restricted complements. EC 2012: 3-16 - [c13]Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, Aleksandrs Slivkins:
Dynamic pricing with limited supply. EC 2012: 74-91 - [i12]Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, Tim Roughgarden:
Combinatorial Auctions with Restricted Complements. CoRR abs/1205.4104 (2012) - [i11]Shaddin Dughmi, Yuval Peres:
Mechanisms for Risk Averse Agents, Without Loss. CoRR abs/1206.2957 (2012) - 2011
- [b1]Shaddin Dughmi:
Randomization and computation in strategic settings. Stanford University, USA, 2011 - [j1]Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden:
Truthful Approximation Schemes for Single-Parameter Agents. SIAM J. Comput. 40(3): 915-933 (2011) - [c12]Shaddin Dughmi, Jan Vondrák:
Limitations of Randomized Mechanisms for Combinatorial Auctions. FOCS 2011: 502-511 - [c11]Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi, Yaron Singer:
Posting Prices with Unknown Distributions. ICS 2011: 166-178 - [c10]Shaddin Dughmi:
A truthful randomized mechanism for combinatorial public projects via convex optimization. EC 2011: 263-272 - [c9]Shaddin Dughmi, Tim Roughgarden, Qiqi Yan:
From convex optimization to randomized mechanisms: toward optimal combinatorial auctions. STOC 2011: 149-158 - [i10]Shaddin Dughmi, Tim Roughgarden, Qiqi Yan:
From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders. CoRR abs/1103.0040 (2011) - [i9]Shaddin Dughmi:
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization. CoRR abs/1103.0041 (2011) - [i8]Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, Aleksandrs Slivkins:
Dynamic Pricing with Limited Supply. CoRR abs/1108.4142 (2011) - [i7]Shaddin Dughmi, Tim Roughgarden, Jan Vondrák, Qiqi Yan:
An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries. CoRR abs/1109.1053 (2011) - [i6]Shaddin Dughmi, Jan Vondrák:
Limitations of randomized mechanisms for combinatorial auctions. CoRR abs/1109.1055 (2011) - 2010
- [c8]Shaddin Dughmi, Tim Roughgarden:
Truthfulness via smoothed complexity. BQGT 2010: 21:1 - [c7]Shaddin Dughmi, Tim Roughgarden:
Black-Box Randomized Reductions in Algorithmic Mechanism Design. FOCS 2010: 775-784 - [c6]Shaddin Dughmi, Arpita Ghosh:
Truthful assignment without money. EC 2010: 325-334 - [c5]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: 518-536 - [i5]Shaddin Dughmi, Arpita Ghosh:
Truthful Assignment without Money. CoRR abs/1001.0436 (2010)
2000 – 2009
- 2009
- [c4]Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan:
Revenue Submodularity. AMMA 2009: 89-91 - [c3]Shahar Dobzinski, Shaddin Dughmi:
On the Power of Randomization in Algorithmic Mechanism Design. FOCS 2009: 505-514 - [c2]Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan:
Revenue submodularity. EC 2009: 243-252 - [i4]Shahar Dobzinski, Shaddin Dughmi:
On the Power of Randomization in Algorithmic Mechanism Design. CoRR abs/0904.4193 (2009) - [i3]Shaddin Dughmi, Hu Fu, Robert Kleinberg:
Amplified Hardness of Approximation for VCG-Based Mechanisms. CoRR abs/0907.1948 (2009) - [i2]Shaddin Dughmi:
Submodular Functions: Extensions, Distributions, and Algorithms. A Survey. CoRR abs/0912.0322 (2009) - [i1]Ioannis Antonellis, Anish Das Sarma, Shaddin Dughmi:
Space Constrained Dynamic Covering. CoRR abs/0912.2404 (2009) - 2008
- [c1]Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden:
Truthful Approximation Schemes for Single-Parameter Agents. FOCS 2008: 15-24
Coauthor Index
Timothy Roughgarden
aka: Tim Roughgarden
aka: Tim Roughgarden
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-06 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: