Prudent k-choice functions: Properties and algorithms

DOI10.1016/0165-4896(93)90012-8zbMATH Open0793.90002OpenAlexW2088727654MaRDI QIDQ690087FDOQ690087

Authors: 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

Recommendations

• A KKM-result and an application for binary and non-binary choice functions
• The approximation algorithms for a class of multiple-choice problem
• Approximation of choice functions with a constrained set of presentations
• Optimality of the greedy algorithm for some function classes
• Approximation algorithms for a class of stochastic selection problems with reward and cost considerations
• Computational algorithms for finding the radius of stability in problems of choice
• Lattices of choice functions and consensus problems
• A characterization of the prudent order preference function
• On a universal best choice algorithm for partially ordered sets
• Efficient Algorithms for k-Regret Minimizing Sets

zbMATH Keywords

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

Mathematics Subject Classification ID

Social choice (91B14)

Cites Work

• Social choice and individual values
• Title not available (Why is that?)
• Transitivity
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Properties of multiwinner voting rules
• A characterization of the prudent order preference function
• Approximation of choice functions with a constrained set of presentations
• Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
• A prudent characterization of the ranked pairs rule
• Choosing \(k\) from \(m\): feasible elimination procedures reconsidered
• On a combinatorial property of choice functions of finite sets
• A characterization of prudent choices
• The expanding approvals rule: improving proportional representation and monotonicity
• An axiomatic characterization of Borda's \(k\)-choice function

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690087)