Approximation of choice function
From MaRDI portal
The approximation of a choice function with good, i.e., simpler or better known, choice functions is examined. Upper and lower approximations are defined and criteria are established that permit the class of functions for which there is an approximation in the specific class of good functions to be described. For classes of functions described by characteristic conditions considered to be approximating in choice theory, a class of approximating functions is defined and formulas for the design of approximating functions are given.
Recommendations
Cited in
(12)- Approximation of choice functions with a constrained set of presentations
- Asymptotic equivalence of choice functions
- Pseudocriteria and pseudocriterial choice
- In search of the best approximant
- Approximating Beppo Levi's \textit{principio di approssimazione}
- Branch-and-bound method for inherited choice functions
- scientific article; zbMATH DE number 4112332 (Why is no real title available?)
- scientific article; zbMATH DE number 1735625 (Why is no real title available?)
- scientific article; zbMATH DE number 7300319 (Why is no real title available?)
- Approximation of functions defined in tabular form: multicriteria approach
- Some results on an approximation to joint distributions of utility functions
- Finite approximations to coherent choice
This page was built for publication: Approximation of choice function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802459)
