159 search results - page 4 / 32 » Computational Complexity of Fundamental Problems in Social C... |
FOCS
2009
IEEE
14 years 1 days ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
IJCAI
2007
13 years 6 months ago
2007
Motivated by applications such as the spread of epidemics and the propagation of influence in social networks, we propose a formal model for analyzing the dynamics of such networ...
CORR
2011
Springer
13 years 9 days ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
CIAC
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
HICSS
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper presents a case study on the use of an alternative method of computer support to that normally used, one that uses voting as a tool for social rather than rational choi...