## Bearden & Connolly (2008) On Optimal Satisficing

Satisficing is to accept the first-seen option that met certain thresholds, known as aspirations. Assume options are presented as vectors $$\vec{x}=(x^1,x^2,\cdots,x^k)$$, and the aspiration level as $$\vec{\theta}=(\theta^1,\theta^2,\cdots,\theta^k)$$. There is an indicator function for accept, [more]