SD
Shaddin Dughmi
cs.GTcs.DScs.LGstat.MLcs.AIcs.CCcs.CLmath.STstat.THcs.CR
On Valency
published · living versionsW_8ppbgcg5·v1 · currentpublished
Preprints & journals
52 papers in the corpus · 2009–2026On the Sample Complexity of Active Learning with Membership Queries2609.27241v2 · Ganghua Wang, Shaddin Dughmi2026 · 0 citationsarXiv
The Strong Secretary Conjecture is True for Linear Matroids2609.20797v1 · Krist'of B'erczi, Shaddin Dughmi, Vasilis Livanos et al.2026 · 0 citationsarXiv
Relatively Smart II: Tractable or Semi-Supervised Instance-Optimal Learning2609.10886v2 · Shaddin Dughmi, Alireza F. Pour2026 · 0 citationsarXiv
Batched Pandora's Box2609.04059v1 · Shaddin Dughmi, Yusuf Hakan Kalayci, Vasilis Livanos et al.2026 · 0 citationsarXiv
Algorithmic Principles For Multiclass Learning Are Hard To Come By: Limits of Regularization and Proper Learning2608.26516v1 · Julian Asilis, Shaddin Dughmi, Vatsal Sharan et al.2026 · 0 citationsarXiv
When Clean Data Hurts: Learning with Monotone Corruptions Beyond Binary Classification2608.20480v2 · Julian Asilis, Shaddin Dughmi, Chirag Pabbaraju2026 · 0 citationsarXiv
Adaptive Generate-Rank-Verify: Inference-Time Search with Costly Verification2605.17609v2 · Shaddin Dughmi, Mahdi Haghifam, Yusuf Hakan Kalayci2026 · 0 citationsarXiv
A Theory of Time-Sensitive Language Generation: Sparse Hallucination Beats Mode Collapse2605.11302v2 · Atul Ganju, Travis McVoy, Shaddin Dughmi et al.2026 · 0 citationsarXiv
Relatively Smart: A New Approach for Instance-Optimal Learning2603.01346v2 · Shaddin Dughmi, Alireza F. Pour2026 · 0 citationsarXiv
Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems2512.01240v1 · Shaddin Dughmi, Yusuf Hakan Kalayci, Xinyu Liu2025 · 0 citationsarXiv
Optimal Stopping vs Best-of- for Inference Time Optimization2510.01394v1 · Yusuf Kalayci, Vinod Raman, Shaddin Dughmi2025 · 0 citationsarXiv
Proper Learnability and the Role of Unlabeled Data2502.10359v2 · Julian Asilis, Siddartha Devic, Shaddin Dughmi et al.2025 · 0 citationsarXiv
Local Regularizers Are Not Transductive Learners2502.07187v1 · Sky Jafar, Julian Asilis, Shaddin Dughmi2025 · 0 citationsarXiv
PAC Learning is just Bipartite Matching (Sort of)2502.00607v3 · Shaddin Dughmi2025 · 0 citationsarXiv
Efficient Multi-Agent Delegated Search2411.00181v1 · Curtis Bechtel, Shaddin Dughmi2024 · 0 citationsarXiv
Is Transductive Learning Equivalent to PAC Learning?2405.05190v2 · Shaddin Dughmi, Yusuf Kalayci, Grayson York2024 · 0 citationsarXiv
Transductive Learning Is Compact2402.10360v3 · Julian Asilis, Siddartha Devic, Shaddin Dughmi et al.2024 · 0 citationsarXiv
Limitations of Stochastic Selection with Pairwise Independent Priors2310.05240v3 · Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel2023 · 0 citationsarXiv
Regularization and Optimal Multiclass Learning2309.13692v2 · Julian Asilis, Siddartha Devic, Shaddin Dughmi et al.2023 · 1 citationarXiv
On Supermodular Contracts and Dense Subgraphs2308.07473v1 · Ramiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel et al.2023 · 8 citationsarXiv
On Sparsification of Stochastic Packing Problems2211.07829v1 · Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel2022 · 0 citationsarXiv
Delegated Pandora's box2202.10382v1 · Curtis Bechtel, Shaddin Dughmi, Neel Patel2022 · 9 citationsarXiv
Matroid Secretary Is Equivalent to Contention Resolution2103.04205v3 · Shaddin Dughmi2021 · 3 citationsarXiv
Delegated Stochastic Probing2010.14718v2 · Curtis Bechtel, Shaddin Dughmi2020 · 3 citationsarXiv
Persuasion and Incentives Through the Lens of Duality1909.10584v1 · Shaddin Dughmi, Rad Niazadeh, Alexandros Psomas et al.2019 · 13 citationsarXiv
The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem1909.04268v3 · Shaddin Dughmi2019 · 6 citationsarXiv
Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice1811.11417v1 · Shaddin Dughmi, David Kempe, Ruixin Qiang2018 · 0 citationsarXiv
On the Distortion of Voting with Multiple Representative Candidates1711.07600v1 · Yu Cheng, Shaddin Dughmi, David Kempe2017 · 19 citationsarXiv
Of the People: Voting Is More Effective with Representative Candidates1705.01736v2 · Yu Cheng, Shaddin Dughmi, David Kempe2017 · 15 citationsarXiv
Bernoulli Factories and Black-Box Reductions in Mechanism Design1703.04143v2 · Shaddin Dughmi, Jason Hartline, Robert Kleinberg et al.2017 · 26 citationsarXiv
Mitigating the Curse of Correlation in Security Games by Entropy Maximization1703.03912v2 · Haifeng Xu, Milind Tambe, Shaddin Dughmi et al.2017 · 1 citationarXiv
Combinatorial Auctions with Online XOS Bidders1703.03484v2 · Shaddin Dughmi, Bryan Wilder2017 · 0 citationsarXiv
Algorithmic Persuasion with No Externalities1609.06825v2 · Shaddin Dughmi, Haifeng Xu2016 · 39 citationsarXiv
Persuasion with Limited Communication1606.07843v2 · Shaddin Dughmi, David Kempe, Ruixin Qiang2016 · 39 citationsarXiv
Mixture Selection, Mechanism Design, and Signaling1508.03679v1 · Yu Cheng, Ho Yee Cheung, Shaddin Dughmi et al.2015 · 42 citationsarXiv
Algorithmic Bayesian Persuasion1503.05988v3 · Shaddin Dughmi, Haifeng Xu2015 · 1 citationarXiv
Sampling and Representation Complexity of Revenue Maximization1402.4535v2 · Shaddin Dughmi, Li Han, Noam Nisan2014 · 50 citationsarXivon Valency
On the Hardness of Signaling1402.4194v4 · Shaddin Dughmi2014 · 49 citationsarXiv
On the Approximation of Submodular Functions1304.4948v1 · Nikhil R. Devanur, Shaddin Dughmi, Roy Schwartz et al.2013 · 10 citationsarXiv
Constrained Signaling in Auction Design1302.4713v2 · Shaddin Dughmi, Nicole Immorlica, Aaron Roth2013 · 11 citationsarXiv
Mechanisms for Risk Averse Agents, Without Loss1206.2957v1 · Shaddin Dughmi, Yuval Peres2012 · 11 citationsarXiv
Combinatorial Auctions with Restricted Complements1205.4104v1 · Ittai Abraham, Moshe Babaioff, Shaddin Dughmi et al.2012 · 48 citationsarXiv
An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries1109.1053v1 · Shaddin Dughmi, Tim Roughgarden, Jan Vondrak et al.2011 · 12 citationsarXiv
Limitations of randomized mechanisms for combinatorial auctions1109.1055v1 · Shaddin Dughmi, Jan Vondrak2011 · 34 citationsarXiv
Dynamic Pricing with Limited Supply1108.4142v3 · Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg et al.2011 · 98 citationsarXiv
From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions1103.0040v3 · Shaddin Dughmi, Tim Roughgarden, Qiqi Yan2011 · 21 citationsarXiv
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization1103.0041v2 · Shaddin Dughmi2011 · 29 citationsarXiv
Truthful Assignment without Money1001.0436v5 · Shaddin Dughmi, Arpita Ghosh2010 · 0 citationsarXiv
Succinct Coverage Oracles0912.2404v2 · Ioannis Antonellis, Anish Das Sarma, Shaddin Dughmi2009 · 0 citationsarXiv
Submodular Functions: Extensions, Distributions, and Algorithms. A Survey0912.0322v4 · Shaddin Dughmi2009 · 25 citationsarXiv
Career total: 114 works. 52 are in this corpus.Showing the 50 most recent.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.