Abstract
In all, n random variables X 1, …, X n are observed sequentially. After X i =x i is observed the leader decides whether he accepts the value x i or not. If he does not accept it, then the follower similarly decides to accept it or not. When one of them accept it, if at least one (none) of X i+1, …, X n is larger than x i , then the accepting player loses (wins). When both players do not accept it, the next random variable X i+1 is observed. We obtain the stackelberg solutions for two cases: with recall and without recall.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
