The computational complexity of choice sets

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Felix Brandt Ludwig-Maximilians-Universität München, Germany
Felix Fischer Ludwig-Maximilians-Universität München, Germany
Paul Harrenstein Ludwig-Maximilians-Universität München, Germany
Published in:
· Proceeding
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Pages 82-91
ACM New York, NY, USA ©2007
table of contents doi>10.1145/1324249.1324263
The computational complexity of choice sets Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 5
· Downloads (cumulative): 151
· Citation Count: 9


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