Satisficing Task

A Satisficing Task is a Task that requires any one solution

AKA: Satisficing.
Context:
- It can be solved by a Satisficing Algorithm.
Example(s):
- any Constraint Satisfaction Task, such as:
  - a Boolean Satisfiability Task.
- …
Counter-Example(s):
- any Optimization Task.
See: Search Task.

References

(Stimpson & Goodrich, 2003) ⇒ Jeffrey L. Stimpson, and Michael A. Goodrich. (2003). “Learning to Cooperate in a Social Dilemma: A satisficing approach to bargaining.” In: Proceedings of ICML Conference.
- Herbert Simon introduced the term satisficing to mean “good enough” (Simon, 1996). Although he discussed satisficing from several perspectives, a frequent perspective was one in which an agent searched through a set of possible decisions until a decision was found which had utility that exceeded an aspiration level. A formal treatment of this algorithm was analyzed in a prisoner’s dilemma context in (Karandikar et al., 1998) and further analyzed in (Stimpson et al., 2001) for deterministic updates. The conclusion of these papers is that a satisficing algorithm can lead to mutual cooperation in the prisoner’s dilemma under a broad variety of conditions.

R. Karandikar, R., Mookherjee, D., Ray, D., and F. Vega-Redondo. (1998). “Evolving aspirations and cooperation.” In: Journal of Economic Theory, 80.

(Simon, 1996) ⇒ Herbert A. Simon. (1996). “The Sciences of the Artificial, 3rd edition.” MIT Press.