Compressed Environments: Unbounded Optimizers Should Sometimes Ignore Information

  • Authors:
  • Nathan Berg;Ulrich Hoffrage

  • Affiliations:
  • School of Economic, Political, and Policy Sciences (EPPS), University of Texas at Dallas, Richardson, USA 75083-0688;Faculty of Business and Economics, University of Lausanne, Lausanne, Switzerland CH-1015

  • Venue:
  • Minds and Machines
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given free information and unlimited processing power, should decision algorithms use as much information as possible? A formal model of the decision-making environment is developed to address this question and provide conditions under which informationally frugal algorithms, without any information or processing costs whatsoever, are optimal. One cause of compression that allows optimal algorithms to rationally ignore information is inverse movement of payoffs and probabilities (e.g., high payoffs occur with low probably and low payoffs occur with high probability). If inversely related payoffs and probabilities cancel out, then predictors that correlate with payoffs and consequently condition the probabilities associated with different payoffs will drop out of the expected-payoff objective function, severing the link between information and optimal action rules. Stochastic payoff processes in which rational ignoring occurs are referred to as compressed environments, because optimal action depends on a reduced-dimension subset of the environmental parameters. This paper considers benefits and limitations of economic models versus other methods for studying links between environmental structure and the real-world success of simple decision procedures. Different methods converge on the normative proposition of ecological rationality, as opposed to axiomatic rationality based on informational efficiency and internal consistency axioms, as a superior framework for comparing the effectiveness of decision strategies and prescribing decision algorithms in application.