Love search strategy with dynamic programming

Show simple item record

dc.creator Yao, Liufang
dc.creator Carrothers, Andrew
dc.date.accessioned 2019-06-04T15:13:13Z
dc.date.available 2019-06-04T15:13:13Z
dc.date.issued 2018
dc.identifier http://library2.smu.ca/bitstream/handle/01/28890/asb_proceedings_2018.pdf?sequence=3&isAllowed=y#page=27
dc.identifier.uri http://library2.smu.ca/handle/01/28892
dc.description.abstract This paper extends the famous secretary problem in the context of the Chinese cultural phenomenon of sheng nu or leftover women. We use dynamic programming to investigate the impact of love search strategies on optimal stopping decisions under time pressure. Our results suggest that time pressure has negative impact on the quality of the match. When there is no time pressure, remaining single may be the optimal decision. Finally, the environment matters — searchers reasonably have higher expectations when the average quality of suitors in a marriage pool is higher. en_CA
dc.description.provenance Submitted by Hansel Cook (hansel.cook@smu.ca) on 2019-06-04T15:13:13Z No. of bitstreams: 1 asb_proceedings_2018.pdf: 3894863 bytes, checksum: 16f50c7a8d12f0c46bd2e657cd4d22cf (MD5) en
dc.description.provenance Made available in DSpace on 2019-06-04T15:13:13Z (GMT). No. of bitstreams: 1 asb_proceedings_2018.pdf: 3894863 bytes, checksum: 16f50c7a8d12f0c46bd2e657cd4d22cf (MD5) Previous issue date: 2018 en
dc.language.iso en en_CA
dc.publisher Atlantic Schools of Business en_CA
dc.source Proceedings of the 48th Atlantic Schools of Business conference, Université de Moncton, 2018, pp 27-37
dc.subject.lcsh Secretary problem (Probability theory)
dc.subject.lcsh Dynamic programming
dc.title Love search strategy with dynamic programming en_CA
dc.type Text en_CA
 Find Full text

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record