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...
Noga Alon, Graham Brightwell, Hal A. Kierstead, Al...
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...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
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...