.png){kind=icon}
返回
Dynamic search models with multiple items
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-019-03472-z.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We generalize the classic dynamic single-item search model to a setting with multiple items and vector offers for subsets of items. We first show a computationally feasible way to solve the dynamic optimization problem, and then prove structural results. Although assignment is not generally monotonically increasing in offer value, we show that, in a special case additive model, monotonicity holds if costs are submodular. We examine how the thresholds for assignment change with the remaining items, and whether there are gains to grouping searches. Finally, we consider a stopping rule version of the problem with no subsets for sale, showing the optimal policy is myopic.
Keyword:
Dynamic programming
Job search
Multiple applicants
Optimal stopping
Stochastic assignment problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
REAL ESTATE EXPOSURE OF US BANKING INDUSTRY STOCK RETURNS: EVIDENCE FROM COMMERCIAL AND RESIDENTIAL MARKETS美国银行业股票收益的房地产敞口：来自商业和住宅市场的证据
OAAI
.png){kind=icon}
OAAI分享收藏分享收藏The Distributional Effects of Monetary Policy: Evidence from Local Housing Markets in Australia货币政策的影响分布：来自澳大利亚地方住房市场的证据
PREAI
分享收藏分享收藏分享收藏分享收藏
查看更多内容