159 search results - page 24 / 32 » Computational Complexity of Fundamental Problems in Social C... |
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
142
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
SIGECOM
2008
ACM
14 years 11 months ago
2008
ACM
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
106
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...