Short-time approximation on combinatorial auctions: a comparison on approximated winner determination algorithms

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Naoki Fukuta Shizuoka University, Shizuoka, Japan
Takayuki Ito Nagoya Institute of Technology, Showa-ku Nagoya, Aichi, Japan
Published in:
· Proceeding
DEECS '07 Proceedings of the 3rd international workshop on Data enginering issues in E-commerce and services: In conjunction with ACM Conference on Electronic Commerce (EC '07)
Pages 26 - 33
ACM New York, NY, USA ©2007
table of contents ISBN: 978-1-59593-856-5 doi>10.1145/1278380.1278386
Short-time approximation on combinatorial auctions: a comparison on approximated winner determination algorithms Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 6
· Downloads (cumulative): 111
· Citation Count: 4


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder