Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
19
click to vote
SODA
2010
ACM
favorite
Email
discuss
report
115
views
Algorithms
»
more
SODA 2010
»
Inapproximability for VCG-Based Combinatorial Auctions
13 years 6 months ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision