Talk Note | Pandora Box + Prior Ambiguity + MinMax Regret = Choice Overload
Professor Auster came to Chicago to give a talk in our theory seminar. Turns out for Pandora’s box, if boxes’ prior are ambiguous and decision maker seeks to minimize maximum regret against a clairvoyant oracle (an oracle who knows all the real reward of the boxes), the decision maker would exihbit choice overload (theoretically). Some additional notes on how to think about it using Yao’s (or Neumann’s) minmax lemma: Setup A decision maker face $n$ boxes. Search cost $c_i$ for each boxes. Each box’s reward is binary $v_i \in \{0, \bar v\}$. ...