House-selling is one of the typical tasks of the Optimal Stopping problems. Offers come in daily for an asset, such as a house, that you wish to sell. Let Xi denote the amount of the offer received on day i. X1,X2,... are independent random variables, according uniform distribution on the interval (0...1). Each offer costs an amount C>0 to observe. When you receive an offer Xi, you must decide whether accept it or to wait for a better offer. The reward sequence depends on whether or not recall of past observations is allowed. If you may not recall past offers, then Di(X1,...,Xi)=Xi – i*C. If you are allowed to recall past offers, then Di(X1,...,Xi)=max(X1,...,Xi) – i*C. These tasks may be extended to infinite horizon (i is unlimited). So, there 4 different task statements :

  • without recall, infinite horizon
  • without recall, finite horizon
  • with recall, infinite horizon
  • with recall, finite horizon

First three tasks are quite simple, but I was unable to prove solution of the last task (in strict form, although I found a solution). If anyone knows her solution, please write it or send an article (link to the article) where it is written. Thank you in advance.

More Sergey Porotsky's questions See All
Similar questions and discussions