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

DOI10.1016/0165-4896(93)90012-8zbMath0793.90002OpenAlexW2088727654MaRDI QIDQ690087

Bernard Debord

Publication date: 16 August 1994

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-4896(93)90012-8

zbMATH Keywords

polynomial algorithmchoice functionsCondorcet principleequally best teamsprudent \(k\)-choice functions

Mathematics Subject Classification ID

Social choice (91B14)

Related Items (4)

Properties of multiwinner voting rules ⋮ The expanding approvals rule: improving proportional representation and monotonicity ⋮ Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives ⋮ A prudent characterization of the ranked pairs rule

Cites Work

• Transitivity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Prudent \(k\)-choice functions: Properties and algorithms