A Help Applying Search Rule Weitzman (1979)

  • A
  • Thread starter Thread starter mathlover
  • Start date Start date
  • Tags Tags
    Search
mathlover
Messages
1
Reaction score
0
I was wondering if you could help me make sure I have things correct. Weitzman (1979) (Optimal search for the best alternative) considers a decision maker that is facing n boxes, each box has potential reward $x_i $with probability distribution $f(x_i)$ (iid). It costs $c_i$ to open the box and learn its contents. There is a discount factor $\beta_i$ for each box. The paper shows that each box has a reservation price $z_i$ that satisfies:

\begin{equation}
c_i = \beta_i \int_{z_i}^\infty (x_i-z_j)\textrm{d}f(x_i)-(1-\beta_i)z_i
\end{equation}Then, the paper gives a specific example where $\beta_i=1$, each box has reward $R_i$ with probability $p_i$ and reward of 0 with probability $1-p_i$. It is given that in this case:
\begin{equation}
z_i=(p_i*R_i-c_i)/p_i
\end{equation}

Now, I'm trying to find out what the $z_i$ would be if $0<\beta_i<1.$ I believe that it is:
\begin{equation}
z_i=(\beta_i*p_i*R_i-c_i)/(\beta_i*p_i+(1-\beta_i))
\end{equation}

The reason I believe this is the solution is due to the following steps i took:
\begin{equation}
\int_{z_i}^\infty (x_i-z_j)\textrm{d}f(x_i)=p_i*(R_i-z_i)
\end{equation}
(I got this from the solution the paper provided for the case where $\beta_i=1$.)

Then, we have
\begin{equation}
c_i = \beta_i*p_i*(R_i-z_i)-(1-\beta_i)z_i
\end{equation}

And,
\begin{equation}
c_i = \beta_i*p_i*R_i-\beta_i*p_i*z_i-(1-\beta_i)z_i
\end{equation}

Thus,
\begin{equation}
c_i = \beta_i*p_i*R_i-z_i*[\beta_i*p_i+(1-\beta_i)]
\end{equation}

Giving us,
\begin{equation}
z_i=(\beta_i*p_i*R_i-c_i)/(\beta_i*p_i+(1-\beta_i))
\end{equation}

However, I had previously calculated it as
\begin{equation}
z_i=(\beta_i*p_i*R_i-c_i)/(\beta_i*p_i)
\end{equation}
(I don't know how I had calculated this) and now I am doubting myself as to which one is the correct solution. Can you help me here?

Thank you.
 
Last edited:
Physics news on Phys.org
Your newer solution looks correct to me. If you are unsure, why not substitute it for ##z_i## in the original equation and see if it works?
 
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...

Similar threads

Back
Top