Condorcet Consistent Bundling with Social Choice

We study the problem of computing optimal bundles given agents' preferences over individual items when agents derive satisfaction from the entire bundle under constraints on the size k of the bundle. Building on the notion of Condorcet winning sets by Gehrlein [16], we extend common Condorcet consistent voting rules from the single winner voting setting to that of forming bundles of size k. Our main technical contribution involves designing efficient algorithms for computing (approximately)-optimal bundles for multiwinner extensions of the following voting rules: Copeland, Minimax, Ranked Pairs, and Schulze.