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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
134
click to vote
ACMICEC
2003
ACM
152
views
ECommerce
»
more
ACMICEC 2003
»
Optimal clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with demand/supply function bidding
15 years 8 months ago
Download
eprints.ecs.soton.ac.uk
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
Viet Dung Dang, Nicholas R. Jennings
claim paper
Read More »