8 search results - page 1 / 2 » Minimal retentive sets in tournaments |
33
Voted
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
SCW
2012
IEEE
13 years 5 months ago
2012
IEEE
102
click to vote
ECCC
2006
14 years 10 months ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
AAAI
2008
15 years 12 days 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...
MSS
2008
IEEE
14 years 10 months ago
2008
IEEE
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...