Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Fast and frugal heuristics are ll studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision making with limited resources. Take-the-best searches for a sufficiently good ordering of cues (features) in a task where objects are to be compared lexicographically.  investigate the complexity of the problem of approximating optimal cue permutations for lexicographic strategies.  show that no efficient algorithm can approximate the optimum to within any constant factor, if P ≠ NP.  further consider a greedy approach for building lexicographic strategies and derive tight bounds for the performance ratio of a new and simple algorithm. This algorithm is proven to perform better than take-the-best.
['Michael Schmitt', 'Laura Martignon']
I am writing a research paper on a idea On the Accuracy of Bounded Rationality: How Far from Optimal Is Fast and Frugal?
[{"from": "human", "value": "I am writing a research paper on a idea On the Accuracy of Bounded Rationality: How Far from Optimal Is Fast and Frugal?"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Fast and frugal heuristics are ll studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision making with limited resources. Take-the-best searches for a sufficiently good ordering of cues (features) in a task where objects are to be compared lexicographically.  investigate the complexity of the problem of approximating optimal cue permutations for lexicographic strategies.  show that no efficient algorithm can approximate the optimum to within any constant factor, if P \u2260 NP.  further consider a greedy approach for building lexicographic strategies and derive tight bounds for the performance ratio of a new and simple algorithm. This algorithm is proven to perform better than take-the-best."}]