159 search results - page 8 / 32 » Computational Complexity of Fundamental Problems in Social C... |
109
click to vote
WWW
2008
ACM
16 years 13 days ago
2008
ACM
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
108
click to vote
ATAL
2010
Springer
15 years 26 days ago
2010
Springer
Social laws have proved to be a powerful and theoretically elegant framework for coordination in multi-agent systems. Most existing models of social laws assume that a designer is...
103
click to vote
AAAI
2010
15 years 1 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
78
Voted
ITNG
2007
IEEE
15 years 6 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...