159 search results - page 1 / 32 » Computational Complexity of Fundamental Problems in Social C... |
SIGECOM
2010
ACM
13 years 9 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
KER
2008
13 years 5 months ago
2008
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...
DAGSTUHL
2007
13 years 6 months ago
2007
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...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
TARK
2007
Springer
13 years 11 months ago
2007
Springer
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...