arXiv Open Access 2017

Resolving the Complexity of Some Fundamental Problems in Computational Social Choice

Palash Dey

Lihat Sumber

Abstrak

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

cs.DS cs.AI cs.MA

Palash Dey

APA MLA BibTeX

Dey, P. (2017). Resolving the Complexity of Some Fundamental Problems in Computational Social Choice. https://arxiv.org/abs/1703.08041

Lihat di Sumber

Informasi Jurnal