3 search results - page 1 / 1 » Dominating sets in k-majority tournaments |
133
click to vote
JCT
2006
15 years 3 months ago
2006
A k-majority tournament T on a finite vertex set V is defined by a set of 2k - 1 linear orderings of V, with u v if and only if u lies above v in at least k of the orders. Motiva...
112
Voted
AAAI
2008
15 years 6 months ago
2008
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...
115
Voted
EUROGP
2009
Springer
15 years 10 months ago
2009
Springer
Coevolution often gives rise to counter-intuitive dynamics that defy our expectations. Here we suggest that much of the confusion surrounding coevolution results from imprecise not...