69 citations · 423 across the 56 of their papers we have counts for
Showing 2012 · cs.GTShow all
2 papers · 2 filters
cs.GT2012
Near-Optimal Multi-Unit Auctions with Ordered Bidders
Elias Koutsoupias, Stefano Leonardi, Tim Roughgarden
We construct prior-free auctions with constant-factor approximation guarantees with ordered bidders, in both unlimited and limited supply settings. We compare the expected revenue…
cs.GT2012★ 7 cited
Combinatorial Auctions with Restricted Complements
Ittai Abraham, Moshe Babaioff, Shaddin Dughmi +1
Complements between goods - where one good takes on added value in the presence of another - have been a thorn in the side of algorithmic mechanism designers. On the one hand, comp…