Learning algorithms for single-instance electronic negotiations using the time-dependent behavioral tactic

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Wilson Wai Ho Mok University of Waterloo, Waterloo, Canada
R. P. Sundarraj University of Waterloo, Waterloo, Canada
Published in:
· Journal
ACM Transactions on Internet Technology (TOIT) TOIT Homepage archive
Volume 5 Issue 1, February 2005
Pages 195-230
ACM New York, NY, USA
table of contents doi>10.1145/1052934.1052941
Learning algorithms for single-instance electronic negotiations using the time-dependent behavioral tactic Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 23
· Downloads (cumulative): 757
· 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