On the approximability of Dodgson and Young elections

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Ioannis Caragiannis University of Patras, Rio, Greece
Jason A. Covey Rochester Institute of Technology, Rochester, NY
Michal Feldman The Hebrew University of Jerusalem, Jerusalem, Israel
Christopher M. Homan Rochester Institute of Technology, Rochester, NY
Christos Kaklamanis University of Patras, Rio, Greece
Nikos Karanikolas University of Patras, Rio, Greece
Ariel D. Procaccia Microsoft Israel R&D Center, Herzeliya, Israel
Jeffrey S. Rosenschein The Hebrew University of Jerusalem, Jerusalem, Israel
On the approximability of Dodgson and Young elections 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 13
· Downloads (cumulative): 126
· Citation Count: 8

Published in:
· Proceeding
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Pages 1058-1067
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2009
table of contents

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