A quantitative gibbard-satterthwaite theorem without neutrality

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Elchanan Mossel UC Berkeley and Weizmann Institute of Science, Berkeley, CA, USA
Miklós Z. Rácz UC Berkeley, Berkeley, CA, USA
Published in:
Cover Image
 
· Proceeding
STOC '12 Proceedings of the 44th symposium on Theory of Computing
Pages 1041-1060
ACM New York, NY, USA ©2012
table of contents ISBN: 978-1-4503-1245-5 doi>10.1145/2213977.2214071
A quantitative gibbard-satterthwaite theorem without neutrality Published by ACM 2012 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 77
· Downloads (cumulative): 77
· Citation Count: 1


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