 | 2011 |
| 22 |  | Shaddin Dughmi:
A truthful randomized mechanism for combinatorial public projects via convex optimization.
ACM Conference on Electronic Commerce 2011: 263-272 |
| 21 |  | Shaddin Dughmi,
Jan Vondrák:
Limitations of Randomized Mechanisms for Combinatorial Auctions.
FOCS 2011: 502-511 |
| 20 |  | Moshe Babaioff,
Liad Blumrosen,
Shaddin Dughmi,
Yaron Singer:
Posting Prices with Unknown Distributions.
ICS 2011: 166-178 |
| 19 |  | Shaddin Dughmi,
Tim Roughgarden,
Qiqi Yan:
From convex optimization to randomized mechanisms: toward optimal combinatorial auctions.
STOC 2011: 149-158 |
| 18 |  | Shaddin Dughmi,
Tim Roughgarden,
Qiqi Yan:
From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders
CoRR abs/1103.0040: (2011) |
| 17 |  | Shaddin Dughmi:
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
CoRR abs/1103.0041: (2011) |
| 16 |  | Moshe Babaioff,
Shaddin Dughmi,
Robert Kleinberg,
Aleksandrs Slivkins:
Dynamic Pricing with Limited Supply
CoRR abs/1108.4142: (2011) |
| 15 |  | 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) |
| 14 |  | Shaddin Dughmi,
Jan Vondrák:
Limitations of randomized mechanisms for combinatorial auctions
CoRR abs/1109.1055: (2011) |
| 13 |  | Peerapong Dhangwatnotai,
Shahar Dobzinski,
Shaddin Dughmi,
Tim Roughgarden:
Truthful Approximation Schemes for Single-Parameter Agents.
SIAM J. Comput. 40(3): 915-933 (2011) |
| 2010 |
| 12 |  | Shaddin Dughmi,
Arpita Ghosh:
Truthful assignment without money.
ACM Conference on Electronic Commerce 2010: 325-334 |
| 11 |  | Shaddin Dughmi,
Tim Roughgarden:
Black-Box Randomized Reductions in Algorithmic Mechanism Design.
FOCS 2010: 775-784 |
| 10 |  | 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 |
| 9 |  | Shaddin Dughmi,
Arpita Ghosh:
Truthful Assignment without Money
CoRR abs/1001.0436: (2010) |
| 2009 |
| 8 |  | Shaddin Dughmi,
Tim Roughgarden,
Mukund Sundararajan:
Revenue submodularity.
ACM Conference on Electronic Commerce 2009: 243-252 |
| 7 |  | Shaddin Dughmi,
Tim Roughgarden,
Mukund Sundararajan:
Revenue Submodularity.
AMMA 2009: 89-91 |
| 6 |  | Shahar Dobzinski,
Shaddin Dughmi:
On the Power of Randomization in Algorithmic Mechanism Design.
FOCS 2009: 505-514 |
| 5 |  | Shahar Dobzinski,
Shaddin Dughmi:
On the Power of Randomization in Algorithmic Mechanism Design
CoRR abs/0904.4193: (2009) |
| 4 |  | Shaddin Dughmi,
Hu Fu,
Robert Kleinberg:
Amplified Hardness of Approximation for VCG-Based Mechanisms
CoRR abs/0907.1948: (2009) |
| 3 |  | Shaddin Dughmi:
Submodular Functions: Extensions, Distributions, and Algorithms. A Survey
CoRR abs/0912.0322: (2009) |
| 2 |  | Ioannis Antonellis,
Anish Das Sarma,
Shaddin Dughmi:
Space Constrained Dynamic Covering
CoRR abs/0912.2404: (2009) |
| 2008 |
| 1 |  | Peerapong Dhangwatnotai,
Shahar Dobzinski,
Shaddin Dughmi,
Tim Roughgarden:
Truthful Approximation Schemes for Single-Parameter Agents.
FOCS 2008: 15-24 |