Computational Complexity of Fundamental Problems in Social Choice Theory

Palash Dey. Computational Complexity of Fundamental Problems in Social Choice Theory. In Gerhard Weiss, Pinar Yolum, Rafael H. Bordini, Edith Elkind, editors, Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, May 4-8, 2015. pages 1973-1974, ACM, 2015. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.