Prudent \(k\)-choice functions: Properties and algorithms (Q690087)

This paper presents a more overall view of the notion of choice functions (the choice set may be classically understood as the set of equally best alternatives). What he is looking for is, not the best alternatives, but the best ``teams'' of fixed cardinality \(k\); the choice set here is the set of equally best ``teams''. After an axiomatic result about Condorcet ``\(k\)-choice functions'', a ``prudent'' generalization of the Condorcet principle is defined. Properties of ``prudent \(k\)-choice functions'' are exposed, and a polynomial algorithm to compute them, is then deduced.