ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

False-name-proof multi-unit auction protocol utilizing greedy allocation based on approximate evaluation values

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Kenji Terada NTT Corporation, Tokyo, Japan
Makoto Yokoo NTT Corporation, Kyoto, Japan
Published in:
Cover Image
 
· Proceeding
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
ACM New York, NY, USA ©2003
table of contents ISBN:1-58113-683-8 doi>10.1145/860575.860630
False-name-proof multi-unit auction protocol utilizing greedy allocation based on approximate evaluation values Published by ACM 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 6
· 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 © 2012 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