The Dowry Problem
uac-books-banner

The Dowry Problem

In the video below I am solving the famous dowry problem using the simulation in R. It is interesting to see how we can test the assumptions and heuristic easily with simulations.

Here is one interesting explanation as well, applied to dating life.

The basic form of the problem is the following: imagine an administrator willing to hire the best secretary out of n rankable applicants for a position. The applicants are interviewed one by one in random order. A decision about each particular applicant is to be made immediately after the interview. Once rejected, an applicant cannot be recalled. During the interview, the administrator can rank the applicant among all applicants interviewed so far, but is unaware of the quality of yet unseen applicants. The question is about the optimal strategy (stopping rule) to maximize the probability of selecting the best applicant. If the decision can be deferred to the end, this can be solved by the simple maximum selection algorithm of tracking the running maximum (and who achieved it), and selecting the overall maximum at the end. The difficulty is that the decision must be made immediately.

Source: Wikipedia

To Download R Workbook Please Join Us Today Become Member

I am a physical preparation coach from Belgrade, Serbia, grow up in Pula, Croatia (which I consider my home town). I was involved in physical preparation of professional, amateur and recreational athletes of various ages in sports such as basketball, soccer, volleyball, martial arts and tennis. Read More »
free-memeber-button

Home Forums The Dowry Problem

Tagged: , ,

This topic contains 0 replies, has 1 voice, and was last updated by  Mladen Jovanovic 1 month, 1 week ago.

You must be logged in to reply to this topic.

Are you ready? Get it NOW!

Increase more than 700% of Email Subscribers!

Your Information will never be shared with any third party