Resolving the Complexity of Some Fundamental Problems in Computational Social Choice

Add code
Mar 23, 2017
Palash Dey
Figure 1 for Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
Figure 2 for Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
Figure 3 for Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
Figure 4 for Resolving the Complexity of Some Fundamental Problems in Computational Social Choice

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

This thesis is in the area called computational social choice which is an intersection area of algorithms and social choice theory.

* Ph.D. Thesis  
View paper onarxiv icon

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon