Prophet Inequalities vs. Approximating Optimum Online.

WINE(2018)

引用 10|浏览48
暂无评分
摘要
We revisit the classic prophet inequality problem, where the goal is selling a single item to an arriving sequence of buyers whose values are drawn from independent distributions, to maximize the expected allocated value. The usual benchmark is the expected value that an omniscient prophet who knows the future can attain. We diverge from this framework and compare the performance of the best single pricing mechanism with the best optimum online mechanism.
更多
查看译文
关键词
Prophet inequality, Optimal stopping, Online algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要