Normal view MARC view ISBD view

Resolving the complexity some fundamental problems in computational social choice

Dey, Palash

Resolving the complexity some fundamental problems in computational social choice by Palash Dey - Bangalore IISc 2016 - xvii, 283p

Includes CD IISc, Dept of CSA, PhD Thesis

Subjects--Index Terms: Computational social choice; Election control; Winner determination; Preference elicitation; Multiple automated agents; Computational complexity

Dewey Class. No.: 006.31 / P164 (THESIS)

Print
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)