| Info-Gap Decision Theory | Voodoo Decision Making | Robust Decisions | Severe Uncertainty | Maximin |
In this page I discuss modeling issues that are connected to the long standing "Satisficing vs Optimizing" debate.
For the benefit of readers who are not familiar with this debate I ought to point out that its main thesis is that satisficing has an advantage on optimizing.
I must admit that I find this debate tiresome. Nevertheless, I decided to join the fray so as to make the point that ... the debate is wasteful and counter-productive.
My decision was prompted by the incessant misguided discussion on this topic in the Info-Gap literature, where it is repeatedly argued that optimal solutions are not robust. Apparently, the Info-Gap folks are unaware of the existence of the vibrant field of robust optimization.
But more than this, Info-gap proponents seem equally unaware of the simple fact that in cases where robustness is a factor, then robustness can/should be incorporated in the formulation of the optimization model to ensure that the optimal solutions generated by this model are robust. And if robustness is not a factor, then it will not be incorporated in the model full stop.
Before noting Info-Gap's position on this matter, I should point out that although in the 2006 edition of the Info-Gap book the robustness model is viewed as a "robust satisficing" model rather than a "robust optimizing" model -- as it is viewed in the 2001 edition of the book -- Info-Gap's generic robustness model describes a run of the mill ... optimization (maximization) problem:
So Info-Gap's thesis is that in the face of severe uncertainty it is "better" to maximize the robustness (alpha) of the performance constraint rc<=R(q,u) then to optimize the performance function R. Details on this model can be found elsewhere.
The point that I make here is that the "satisficing vs optimizing" issue is a ... non-issue. What is an issue, indeed an important one, is "what" should we seek to satisfice and "what" should we seek to optimize.
So what, then, is the "satisficing vs optimizing" debate all about?
For one thing, it is not about substance. It is about style, terminology, and buzzwords. Of course, for certain purposes style, terminology, and buzzwords are more important than substance. Hence, the debate.
To make sense of what is at issue here, let us consider the following two problems, where X is a given set and f is a real-valued function on X:
Satisficing Problem: Find an x in X that satisfies a given list of constraints. Optimization Problem: Find an x' in X that optimizes f(x) over X. Now consider this:
The Fundamental Theorem of the Sacrificing vs Optimizing debate:
Any satisficing problem on Planet Earth can be formulated as an equivalent optimization problem so that any feasible solution to the satisficing problem is optimal with respect to the optimization problem, and vice versa.
A number of comments on this lovely theorem:
- I do not know who first proved this result. I for one have been using it frequently in my research and teaching since about 1973, and I know for a fact that it is being used extensively for many years in the areas of Operations Research, Optimization, Computer Science, Statistics, etc.
- What it implies is that the important question is not whether we should satisfice or optimize. The important question is what should be satisficed and what should be optimized.
- It shows that off-the-cuff claims such as "satisficing is more robust than optimizing" and "it is better to satisfice that to optimize" are misguided.
- Yes, I am aware of Herbert Simon work in this area.
- Yes, I am aware of Barry Schwartz's work on this topic; his popular The Paradox of Choice book, and I have even seen his road-show.
The proof of this theorem is so straightforward that I can set it out here and now. It runs as follows:
BOP.
Consider any arbitrary satisficing problem, namely consider any set X and any list of constraints on X. Now, let f denote the characteristic function of the feasible subset of X with respect to the constraints under consideration, namely letThen by inspection: f(x):= 1 if x is in X and it satisfies all the constraints; and f(x):= 0 otherwise
EOP.
- If x' is a feasible solution to the satisficing problem then x' maximizes f(x) over X.
- If x' in X maximizes f(x) over X then x' is a feasible solution to the satisficing problem.
For example, consider the following satisficing problem:
Find an element x' in a given set X such that g(x') > G and h(x') < H, where G and H are given numbers and g and h are given real-valued functions on X.All we have to do to rephrase this problem as an optimization problem is to let f denote the real-valued function on X defined as follows:
f(x):= 1 iff g(x) > G and h(x) < H ; f(x):=0 otherwise.The idea is then that the given satisficing problem is equivalent to the optimization problem max {f(x): x in X} in that an x' in X is a feasible solution to the satisficing problem iff x' is an optimal solution to the optimization problem max{f(x): x in X}.
I have plenty more to say on the Satisficing vs Optimizing debate. But I am afraid that this will have to wait till I complete a number of much more urgent tasks.
For now, you may wish to get hold of Jan Odhnoff's (1965) paper, whose last paragraph reads as follows:
It seems meaningless to draw more general conclusions from this study than those presented in section 2.2. Hence, that section maybe the conclusion of this paper. In my opinion there is room for both 'optimizing' and 'satisficing' models in business economics. Unfortunately, the difference between 'optimizing' and 'satisficing' is often referred to as a difference in the quality of a certain choice. It is a triviality that an optimal result in an optimization can be an unsatisfactory result in a satisficing model. The best things would therefore be to avoid a general use of these two words.Jan Odhnoff
On the Techniques of Optimizing and Satisficing
The Swedish Journal of Economics
Vol. 67, No. 1 (Mar., 1965)
pp. 24-39I fully sympathize with Odhnoff's frustration.
Indeed, as attested by the literature, it is remarkable to what length the "triviality" identified by Jan Odhnoff can be taken. If you are unfamiliar with the "satisficing vs optimizing" debate, use your favorite WWW search engine to look up catch phrases such as
"good is better than best","why more is less", "advantage of sub-optimal models" If you are surprised, perhaps amazed or even perplexed, to learn that a sub-optimal solution can be better than an optimal solution, or have an advantage on it, do not panic. Not yet, anyhow. Conserve your anti-panic resources, for you'll surely need them when you hear the really bad news.
The following simple practical example illustrates some of the non-issues that are advanced by proponents of the satisficing vs optimizing debate.
Example
You plan a visit to Paris with your spouse and have to decide what car to hire. There are 5 options, call them C1, C2, C3, C4, C5.
After long deliberations and consultations, you decide that the optimal choice is the small, funky, fuel-efficient C3.
On hearing about this choice, one of your friends points out that this choice, that is optimal for your problem, is not only sub optimal, but actually unsatisfactory, in the context of his -- your friend's -- problem, which is: what car to hire for a month long trans-Australia desert race.
You friend thus concludes: satisficing is better than optimizing!
One need hardly point out that in this context the triviality is so obvious and transparent that you'll immediately be able to see how absurd the argument is.
But all it takes to camouflage such a triviality is an abstraction, some mathematical notation, Greek symbols, and a couple of buzzwords. So let's see how it works.
The first thing you need to do is to create two different but slightly related abstract problems. Let us call them Problem A and Problem B and let sA and sB denote the respective optimal solutions.
So by construction, sA is optimal in the context of Problem A and sB is optimal in the context of Problem B. Therefore, typically sA is sub-optimal in the context of Problem B and sB is sub-optimal in the context of Problem A.
So far so good, but ... not very exciting.
So how about this exciting result: Very often there is a sub optimal solution, call it yA , that is superior to (better than) the optimal solution sA and there is a sub-optimal solution yB that is superior to (better than) the optimal solution sB.
Yes!!!!!!!!
Try to prove this formally on your own. I shall provide a formal proof after I return from my overseas trip in October.
The really bad news is that respectable professional journals publish this kind of material. Now you can panic, and rightly so.
The following naive example will show you how much mileage can be made of what Jan Odhnoff termed "trivialities".
Example
Let X and U be some sets, let R be a real-valued function on the cartesian product of these sets, and let u* be some given element of U. Consider now the following seemingly innocuous problem:
Problem A: max {R(x,u*): x in X}
In other words, the objective is to maximize R(x,u*) over x in X. Assume that this problem has feasible solutions and let xA denote an optimal solution to this problem. Thus, R(xA,u*) >= R(x,u*) for all x in X.
To be more concrete, consider the case where X is the real line, U=[0,1], u*=0.5 and
R(x,u) = 2ux - x2
In this case the optimal value of x is xA= 0.5. Note that in this context the feasible solution x0=0 is clearly sub-optimal.
So far so good.
Now, suppose that the survival of Planet Earth critically depends on the validity of the constraint R(x,u) >= 0, assuming that we control x and Nature controls u.
In this case, to save Planet Earth we consider this problem:
Problem B: Find an xB in X such that R(xB,u) >= 0, for all u in U.
Note that if, as above, X is the real line and U=[0,1], then this problem has only one feasible solution, namely xB = x0= 0.
In summary then: for the concrete instance where X is the real line, U=[0,1], and u*=0.5 we have:
- The optimal solution to Problem A, namely xA= 0.5, is not as good as the sub-optimal solution x0= 0, when they are compared in the context of Problem B. In fact, xA= 0.5 is not even feasible in the context of Problem B.
If you are a bit puzzled regarding the logic of this Example, join the queue.
Why on earth should we expect an optimal solution to Problem A to retain its preference over other solutions in the context of Problem B?!?!?!?!
Naturally, we would counter-argue as follows:
- The "best" solution to the satisficing problem, Problem B, namely xB = x0= 0, is sub-optimal in the context of the optimization problem, Problem A !??!?!?!?!?!!?!?!?!?!?!?!??!!?
So what?!
It is sad, very sad, that such convoluted, misguided, arguments are used to "show" that satisficing is better than optimizing.
What a mess!
I have plenty more to say about such general "trivialities".
If you are truly eager to know more about what I have to say, feel free to contact me.
Next.
The case against optimization is often based on references to Simon's theory of bounded rationality. It is therefore important to note that this theory does not assert that it is better to satisfice than optimize. I find the following quote informative (the color and oversized font is mine):
There are many excellent treatments of bounded rationality (see, e.g., Simon (1982a, 1982b, 1997) and Rubinstein (1998)). Appendix A provides a brief survey of the mainstream of bounded rationality research. This research represents an important advance in the theory of decision making; its importance is likely to increase as the scope of decision-making grows. However, the research has a common theme, namely, that if a decision maker could optimize, it surely should do so. Only the real-world constraints on its capabilities prevent it from achieving the optimum. By necessity, it is forced to compromise, but the notion of optimality remains intact. Bounded rationality is thus an approximation to substantive rationality, and remains as faithful as possible to the fundamental premises of that view.
Wynn C. Stirling (2003, p. 10)
Satisficing Games and Decision Making
Cambridge University PressSo when I am in a good mood I argue as follows:
If you can optimize, then you surely should do so. If you can't, then do the best you can. But never ever use the "bounded rationality" argument as an excuse for a simplistic, quick-and-dirty "satisficing job".
I cannot tell you here and now what I argue when I am in a bad mood. But, we can discuss this over a cup of coffee (skinny latte, no sugar, please).
Talking about optimization.
It is amazing what kind of misconceptions some analysts have about optimization, its role in decision making and management, its limitations and its relation to other methodologies.
For instance, read this (color is mine):
From Optimization to Adaptation:
Shifting Paradigms in Environmental Management and Their Application to Remedial Decisions.
ABSTRACT
Current uncertainties in our understanding of ecosystems require shifting from optimization-based management to an adaptive management paradigm. Risk managers routinely make suboptimal decisions because they are forced to predict environmental response to different management policies in the face of complex environmental challenges, changing environmental conditions, and even changing social priorities. Rather than force risk managers to make single suboptimal management choices, adaptive management explicitly acknowledges the uncertainties at the time of the decision, providing mechanisms to design and institute a set of more flexible alternatives that can be monitored to gain information and reduce the uncertainties associated with future management decisions. Although adaptive management concepts were introduced more than 20 y ago, their implementation has often been limited or piecemeal, especially in remedial decision making. We believe that viable tools exist for using adaptive management more fully. In this commentary, we propose that an adaptive management approach combined with multicriteria decision analysis techniques would result in a more efficient management decision-making process as well as more effective environmental management strategies. A preliminary framework combining the 2 concepts is proposed for future testing and discussion.
Igor Linkov, F Kyle Satterstrom, Gregory A Kiker, Todd S Bridges, Sally L Benjamin, David A Belluck
Integrated Environmental Assessment and Management
Volume 2, Number 1 -- pp. 92-98, 2006Are we to understand from this that "optimization" cannot deal with uncertainty?! Are we to conclude that "optimization" is not adaptive? And what about multicriteria decision analysis techniques: don't they offer, among other things, something called Pareto Optimization?
I shall address this quote, and the article itself, in due course. Let me just point out here and now that "optimization-based management" and "adaptive management" are not mutually exclusive. That is, there is no reason why "optimization-based management" cannot be adaptive and why "adaptive management" cannot not be "optimization-based".
When I read abstracts like this I do not know whether I should laugh or cry. But seriously, this is not funny, not funny at all.
This project is related to some of my other campaigns, namely the Worst-Case Analysis / Maximin Campaign, Robust Decision-Making Campaign, Responsible Decision-Making Campaign and the Info-Gap Campaign.
Articles, Working Papers, Notes
This is a paper that I presented at the ASOR Recent Advances in Operations Research mini-conference (December 1, 2006, Melbourne, Australia).
- Sniedovich, M. (2008) Wald's Maximin model: a treasure in disguise!, Journal of Risk Finance, 9(3), 287-291.
- Sniedovich, M. (2008) Anatomy of a Misguided Maximin formulation of Info-Gap's Robustness Model
In this paper I explain, again, the misconceptions that Info-Gap proponents seem to have regarding the relationship between Info-Gap's robustness model and Wald's Maximin model.
- Sniedovich. M. (2008) The Mighty Maximin!
This paper is dedicated to the modeling aspects of Maximin and robust optimization.
- Sniedovich, M. (2007) The art and science of modeling decision-making under sever uncertainty, Decision Making in Manufacturing and Services, 1-2, 111-136. Available online.
- Sniedovich, M. (2007) Crystal-Clear Answers to Two FAQs about Info-Gap
In this paper I examine the two fundamental flaws in Info-Gap decision theory, and the flawed attempts to shrug off my criticism of Info-Gap decision theory.
- My reply to Ben-Haim's response to one of my papers. (April 22, 2007)
This is an exciting development!
- Ben-Haim's response confirms my assessment of Info-Gap. It is clear that Info-Gap is fundamentally flawed and therefore unsuitable for decision-making under severe uncertainty.
- Ben-Haim is not familiar with the fundamental concept point estimate. He does not realize that a function can be a point estimate of another function.
So when you read my papers make sure that you do not misinterpret the notion point estimate. The phrase "A is a point estimate of B" simply means that A is an element of the same topological space that B belongs to. Thus, if B is say a probability density function and A is a point estimate of B, then A is a probability density function belonging to the same (assumed) set (family) of probability density functions.
Ben-Haim mistakenly assumes that a point estimate is a point in a Euclidean space and therefore a point estimate cannot be say a function. This is incredible!
- A formal proof that Info-Gap is Wald's Maximin Principle in disguise. (December 31, 2006)
This is a very short article entitled Eureka! Info-Gap is Worst Case (maximin) in Disguise! It shows that Info-Gap is not a new theory but rather a simple instance of the famous Wald's Maximin Principle dating back to 1945, which in turn goes back to von Neumann's work on Maximin problems in the context of Game Theory (1928).
- A proof that Info-Gap's uncertainty model is fundamentally flawed. (December 31, 2006)
This is a very short article entitled The Fundamental Flaw in Info-Gap's Uncertainty Model. It shows that because Info-Gap deploys a single point estimate under severe uncertainty, there is no reason to believe that the solutions it generates are likely to be robust.
- A math-free explanation of the flaw in Info-Gap. ( December 31, 2006)
This is a very short article entitled The GAP in Info-Gap. It is a math-free version of the paper above. Read it if you are allergic to math.
- A long essay entitled What's Wrong with Info-Gap? An Operations Research Perspective (December 31, 2006).
Lectures, Seminars
If your organization is promoting Info-Gap, I suggest that you invite me for a seminar in your place. I promise to deliver a lively, informative, entertaining and convincing presentation explaining why it is not a good idea to use -- let alone promote -- Info-Gap as a decision-making tool.
Here is a list of relevant lectures/seminars on this topic that I gave in the last two years.
- Responsible Decision-Making in the face of Severe Uncertainty. (Singapore Management University, Singapore, September 29, 2008)
- A Critique of Info-Gap's Robustness Model. (ESREL/SRA 2008 Conference, Valencia, Spain, September 22-25, 2008)
- Robust Decision-Making in the Face of Severe Uncertainty. (Technion, Haifa, Israel, September 15, 2008)
- The Art and Science of Robust Decision-Making. (AIRO 2008 Conference, Ischia, Italy, September 8-11, 2008 )
- The Fundamental Flaws in Info-Gap Decision Theory. (CSIRO, Canberra, July 9, 2008 )
- Responsible Decision-Making in the Face of Severe Uncertainty. (OR Conference, ADFA, Canberra, July 7-8, 2008 )
- Responsible Decision-Making in the Face of Severe Uncertainty. (University of Sydney Seminar, May 16, 2008 )
- Decision-Making Under Severe Uncertainty: An Australian, Operational Research Perspective . (ASOR National Conference, Melbourne, December 3-5, 2007 )
- A Critique of Info-Gap . (SRA 2007 Conference, Hobart, August 20, 2007)
- What exactly is wrong with Info-Gap? A Decision Theoretic Perspective . (MS Colloquium, University of Melbourne, August 1, 2007)
- A Formal Look at Info-Gap Theory . (ORSUM Seminar , University of Melbourne, May 21, 2007)
- The art and Science of Decision-Making Under Severe Uncertainty. (ACERA seminar, University of Melbourne, May 4, 2007)
- What exactly is Info-Gap? An OR perspective. ASOR Recent Advances in Operations Research mini-conference (December 1, 2006, Melbourne, Australia).
Disclaimer: This page, its contents and style, are the responsibility of the author (Moshe Sniedovich) and do not represent the views, policies or opinions of The University of Melbourne.