[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3391403.3399484acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
abstract

On Optimal Ordering in the Optimal Stopping Problem

Published: 13 July 2020 Publication History

Abstract

Consider a player who can probe a sequence of n independent random variables X1, . . . , Xn with known distributions. After observing (the realized value of) Xi, the player needs to decide whether to stop and earn reward Xi, or reject the reward and probe the next variable Xi+1. The goal is to maximize the expected reward at the stopping time. This is an instance of the optimal stopping problem, which is a fundamental problem studied from many different aspects in mathematics, statistics, and computer science, and has found a wide variety of applications in sequential decision making and mechanism design.
When the order in which the random variables X1,...,Xnare probed is fixed, the optimal stopping strategy can be found by solving a simple dynamic program. Under this strategy, at every step i, the player would compare the realized value of the current random variable Xi to the expected reward (under the optimal strategy for the remaining subproblem) from the remaining variables Xi+1, . . .,Xn, and stop if the former is greater than the latter. In this paper, we focus on the relatively less studied question of optimizing the order in which the random variables should be probed. Specifically, besides choosing a stopping strategy, if the player is free to choose the order in which the random variables are probed, then which ordering would maximize the expected reward at the stopping time?
The optimal ordering problem has been previously studied in mathematics and statistics literature in the 80's (e.g., Gilat[6], Hill and Hordijk[8], and Hill[7]). However the focus there has been on analytically characterizing the optimal order for some special structured cases (like Bernoulli and exponential distributions). One difficulty in such a study is that the nature of this problem changes significantly depending on the type of distributions considered. For example, when distributions are Bernoulli or exponential, the optimal ordering can be found analytically [8], but, the problem remains nontrivial for uniform distributions.

References

[1]
Melika Abolhassani, Soheil Ehsani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Robert Kleinberg, and Brendan Lucier. 2017. Beating 1--1/e for ordered prophets. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. ACM, 61--71.
[2]
Yossi Azar, Ashish Chiplunkar, and Haim Kaplan. 2018. Prophet secretary: Surpassing the 1--1/e barrier. In Proceedings of the 2018 ACM Conference on Economics and Computation. ACM, 303--318.
[3]
José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, and Tjark Vredeveld. 2017. Posted price mechanisms for a random stream of customers. In Proceedings of the 2017 ACM Conference on Economics and Computation. ACM, 169--186.
[4]
Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, and Morteza Monemizadeh. 2017. Prophet secretary. SIAM Journal on Discrete Mathematics, Vol. 31, 3 (2017), 1685--1701.
[5]
Hao Fu, Jian Li, and Pan Xu. 2018. A PTAS for a Class of Stochastic Dynamic Programs. arXiv preprint arXiv:1805.07742 (2018).
[6]
David Gilat. 1987. On the best order of observation in optimal stopping problems. Journal of applied probability, Vol. 24, 3 (1987), 773--778.
[7]
TP Hill. 1983. Prophet inequalities and order selection in optimal stopping problems. Proc. Amer. Math. Soc., Vol. 88, 1 (1983), 131--137.
[8]
Theodore P Hill and Arie Hordijk. 1985. Selection of order of observation in optimal stopping problems. Journal of applied probability, Vol. 22, 1 (1985), 177--184.
[9]
Ulrich Krengel and Louis Sucheston. 1977. Semiamarts and finite values. Bull. Amer. Math. Soc., Vol. 83, 4 (1977), 745--747.

Cited By

View all
  • (2024)Matroid Bayesian Online SelectionAlgorithmic Game Theory10.1007/978-3-031-71033-9_23(405-422)Online publication date: 3-Sep-2024
  • (2023)Simple is Enough: A Cascade Approximation for Attention-Based Satisficing Choice ModelsSSRN Electronic Journal10.2139/ssrn.4529802Online publication date: 2023
  • (2023)Prophet Secretary Against the Online OptimalProceedings of the 24th ACM Conference on Economics and Computation10.1145/3580507.3597736(561-581)Online publication date: 9-Jul-2023
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
EC '20: Proceedings of the 21st ACM Conference on Economics and Computation
July 2020
937 pages
ISBN:9781450379755
DOI:10.1145/3391403
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 July 2020

Check for updates

Author Tags

  1. optimal orderings
  2. optimal stopping
  3. prophet inequalities

Qualifiers

  • Abstract

Funding Sources

  • NSF CAREER CMMI

Conference

EC '20
Sponsor:
EC '20: The 21st ACM Conference on Economics and Computation
July 13 - 17, 2020
Virtual Event, Hungary

Acceptance Rates

Overall Acceptance Rate 664 of 2,389 submissions, 28%

Upcoming Conference

EC '25
The 25th ACM Conference on Economics and Computation
July 7 - 11, 2025
Stanford , CA , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)31
  • Downloads (Last 6 weeks)9
Reflects downloads up to 15 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Matroid Bayesian Online SelectionAlgorithmic Game Theory10.1007/978-3-031-71033-9_23(405-422)Online publication date: 3-Sep-2024
  • (2023)Simple is Enough: A Cascade Approximation for Attention-Based Satisficing Choice ModelsSSRN Electronic Journal10.2139/ssrn.4529802Online publication date: 2023
  • (2023)Prophet Secretary Against the Online OptimalProceedings of the 24th ACM Conference on Economics and Computation10.1145/3580507.3597736(561-581)Online publication date: 9-Jul-2023
  • (2023)Prophet Inequality: Order selection beats random orderProceedings of the 24th ACM Conference on Economics and Computation10.1145/3580507.3597687(302-336)Online publication date: 9-Jul-2023
  • (2023)Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation SchemeProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585229(789-802)Online publication date: 2-Jun-2023
  • (2023)The Importance of Knowing the Arrival Order in Combinatorial Bayesian SettingsWeb and Internet Economics10.1007/978-3-031-48974-7_15(256-271)Online publication date: 31-Dec-2023
  • (2022)Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS54457.2022.00023(171-178)Online publication date: Oct-2022
  • (2021)Efficient Approximation Schemes for Stochastic Probing and Prophet ProblemsProceedings of the 22nd ACM Conference on Economics and Computation10.1145/3465456.3467614(793-794)Online publication date: 18-Jul-2021
  • (2021)Variable Decomposition for Prophet Inequalities and Optimal OrderingProceedings of the 22nd ACM Conference on Economics and Computation10.1145/3465456.3467598(692-692)Online publication date: 18-Jul-2021
  • (undefined)A Mechanism Design Perspective of Live-streaming Commerce: The Role of Information ProvisionSSRN Electronic Journal10.2139/ssrn.3685012
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media