Sciweavers

3946 search results - page 3 / 790
» The computational complexity of choice sets
Sort
View
AI
2007
Springer
13 years 7 months ago
Anyone but him: The complexity of precluding an alternative
Preference aggregation in a multiagent setting is a central issue in both human and computer contexts. In this paper, we study in terms of complexity the vulnerability of preferen...
Edith Hemaspaandra, Lane A. Hemaspaandra, Jör...
CSL
2005
Springer
14 years 29 days ago
Computing with Sequences, Weak Topologies and the Axiom of Choice
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
Vasco Brattka, Matthias Schröder
KER
2008
193views more  KER 2008»
13 years 7 months ago
The 1st international workshop on computational social choice
Computational social choice is a new discipline currently emerging at the interface of social choice theory and computer science. It is concerned with the application of computati...
Ulle Endriss
DAGSTUHL
2007
13 years 9 months ago
07431 Executive Summary - Computational Issues in Social Choice
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
Ulle Endriss, Jérôme Lang, Francesca ...