.png){kind=icon}
返回
A new algorithm for the multi-item exponentially discounted optimal selection problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00809-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We approach the classical problem of optimal selection, where n identical units have to be sold to bidders who come in an infinite stream, and it has to be decided which bids to accept and when. Optimal strategies are defined so as to maximize the expected total discounted revenue from the n units. The present work assumes that bids are i.i.d. and that they arrive according to a general renewal process. Observing that the optimal policy may be determined using a series of threshold values which are sorted by the values of a discrete approximation of the bid-distribution, and that in the case of exponential discounting these threshold values are easily calculable, we propose an appropriate solution algorithm. The algorithm provides the value of the problem as well. (C) 2002 Elsevier B.V. All rights reserved.
Keyword:
asset-selling
dynamic programming
optimal selection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容