Approximation of choice functions with a constrained set of presentations

MaRDI QIDQ1085017zbMATH OpenFDO

Authors B. M. Litvakov

Publication date 1985

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

approximation of choice functions

Mathematics Subject Classification ID

Social choice (91B14)

Review text

The paper contains results pertaining to the approximation of choice functions by good choice functions i.e., choice functions which are simpler or better known. Another paper of the author [Autom. Remote Control 45, 1221-1229 (1984; Zbl 0558.90013)] needs to be consulted for terms and definitions used in the present paper.

Recommendations

• Approximation of choice function
• Approximative solutions of best choice problems
• Choquet representability of submodular functions
• Choice functions over a finite set: A summary
• Finite approximations to coherent choice
• Choice functions on a large set of alternatives
• scientific article; zbMATH DE number 2067654
• Approximation of nonconical preference relations in multiple-criteria decision problems
• scientific article; zbMATH DE number 3990022
• Prudent k-choice functions: Properties and algorithms

Cited in

(2)

• Prudent k-choice functions: Properties and algorithms
• Approximation of choice function

This page was built for publication: Approximation of choice functions with a constrained set of presentations

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