Sciweavers

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

23

SODA
2010
ACM

favoriteEmaildiscussreport

169views Algorithms» more SODA 2010»

VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension

14 years 8 months ago

VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension

Download www.cs.yale.edu

Elchanan Mossel, Christos Papadimitriou, Michael S

Real-time Traffic

Discrete Algorithms | SODA 2010 | VC Dimension | VC V |

claim paper

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	SODA
Authors	Elchanan Mossel, Christos Papadimitriou, Michael Schapira, Yaron Singer

Comments (0)