159 search results - page 5 / 32 » Computational Complexity of Fundamental Problems in Social C... |
FCT
2009
Springer
15 years 4 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
86
Voted
IJCNN
2006
IEEE
15 years 4 months ago
2006
IEEE
Abstract— Making inferences and choosing appropriate responses based on incomplete, uncertainty and noisy data is challenging in financial settings particularly in bankruptcy de...
76
Voted
IJAC
2002
14 years 10 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
100
Voted
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
73
Voted
ECCC
2008
14 years 10 months ago
2008
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...