10 search results - page 1 / 2 » Computing the Nucleolus of Matching, Cover and Clique Games |
AAAI
2012
11 years 7 months ago
2012
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
ATAL
2010
Springer
13 years 5 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 ...
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
ICPR
2000
IEEE
14 years 5 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
JGAA
2000
13 years 4 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...