60 citations · 269 across the 42 of their papers we have counts for
5 papers · 1 filter
Limitations of randomized mechanisms for combinatorial auctions
Shaddin Dughmi, Jan Vondrak
Recently, a randomized mechanism has been discovered [Dughmi, Roughgarden and Yan; STOC'11] for combinatorial auctions that is truthful in expectation and guarantees a (1-1/e)-appr…
An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries
Shaddin Dughmi, Tim Roughgarden, Jan Vondrak +1
This manuscript presents an alternative implementation of the truthful-in-expectation mechanism of Dughmi, Roughgarden and Yan for combinatorial auctions with weighted-matroid-rank…
Dynamic Pricing with Limited Supply
Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg +1
We consider the problem of dynamic pricing with limited supply. A seller has identical items for sale and is facing potential buyers ("agents") that are arriving sequential…
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
Shaddin Dughmi
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of self-interested players with a stake in the set of projects chosen. A public plann…
From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions
Shaddin Dughmi, Tim Roughgarden, Qiqi Yan
We design an expected polynomial-time, truthful-in-expectation, (1-1/e)-approximation mechanism for welfare maximization in a fundamental class of combinatorial auctions. Our resul…