Consistent subsets: computationally feasible methods to compute the Houtman-Maks-index

DOI10.1016/J.ECONLET.2015.01.024zbMATH Open1321.91068OpenAlexW3021256264MaRDI QIDQ498874FDOQ498874

Authors: Jan Heufer, Per Hjertstrand 

Publication date: 29 September 2015

Published in: Economics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.econlet.2015.01.024

Recommendations

• On the minimum consistent subset problem
• On the minimum consistent subset problem
• Deterministic and iterative solutions to subset selection problems
• Exact hypervolume subset selection through incremental computations
• scientific article; zbMATH DE number 1104339
• An evaluation of exact methods for the multiple subset maximum cardinality selection problem
• Approximating subset sum ratio via subset sum computations
• Approximation schemes for a class of subset selection problems
• LATIN 2004: Theoretical Informatics

zbMATH Keywords

efficiencyrevealed preferenceutility maximisationdemand theorynonparametric analysis

Mathematics Subject Classification ID

Statistical methods; economic indices and measures (91B82) Consumer behavior, demand theory (91B42) Mixed integer programming (90C11)

Cites Work

• The Nonparametric Approach to Demand Analysis
• Non-Parametric Tests of Consumer Behaviour
• A simplified test for preference rationality of two-commodity choice
• Nonparametric comparative revealed risk aversion
• Revealed preference tests for weak separability: an integer programming approach

Cited In (3)

• Revealed preference theory: an algorithmic outlook
• Computing revealed preference goodness-of-fit measures with integer programming
• Homothetic Efficiency: Theory and Applications

This page was built for publication: Consistent subsets: computationally feasible methods to compute the Houtman-Maks-index

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