Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

76

SODA
2010
ACM

115views Algorithms» more SODA 2010»

Inapproximability for VCG-Based Combinatorial Auctions

15 years 21 days ago

Inapproximability for VCG-Based Combinatorial Auctions

Download www.cs.yale.edu

David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kl

Real-time Traffic

Algorithms | SODA 2010 |

claim paper

Related Content

» Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions

» VC v VCG Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimensi...

» From query complexity to computational complexity

» Algorithm for optimal winner determination in combinatorial auctions

» Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and General...

» CABOB A Fast Optimal Algorithm for Combinatorial Auctions

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	SODA
Authors	David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer, Christopher Umans

Comments (0)