Multi-person stopping games with players' priorities are considered. Players observe sequentially offers Y 1 , Y 2 , . . . at jump times T 1 , T 2 , . . . of a Poisson process. Y 1 , Y 2 , . . . are independent identically distributed random variables. Each accepted offer Y n results in a reward G n = Y n r(T n ), where r is a non-increasing discount function. If more than one player wants to accept an offer, then the player with the highest priority (the lowest ordering) gets the reward. We construct Nash equilibrium in the multi-person stopping game using the solution of a multiple optimal stopping time problem with structure of rewards {G n }. We compare rewards and stopping times of the players in Nash equilibrium in the game with the optimal rewards and optimal stopping times in the multiple stopping time problem. It is also proved that presented Nash equilibrium is a Pareto optimum of the game. The game is a generalization of the Elfving stopping time problem to multi-person stopping games with priorities.Keywords Stopping game · Nash equilibrium · Pareto-optimality · Multiple stopping Suppose that a company is going to open m new departments that will be ordered (ranked) according to their importance. Rank 1 denotes the most important department, and consequently rank m refers to the least important one. So, the firm offers m secretary positions. The applications will be considered up to a fixed deadline U . There is a selection committee that interviews candidates arriving one by one at jump times of a Poisson process. We assume that candidates' "skills" form a sequence of i.i.d. random variables with known probability distribution. The selection process is organized similarly to the classical secretary problem but taking into account the departments' rankings. So, a candidate who is being interviewed may be accepted for department 1; if she is rejected, she may be accepted for department 2, and so on until the first acceptance. Candidates rejected for department i cannot be considered in the future. The aim is to select candidates with maximal expected "skills". So, one may say that each department acts as an independent player in a stopping game with priorities.We will formulate the problem as an m-person stopping game with priorities in which random offers are presented at jump times of a homogeneous Poisson process. Such a game has been considered in Ferenstein and Krasnosielska [8]. In this paper, we propose a new solution and we prove that a proposed strategy is a Nash equilibrium, which allows removing some assumption made in Ferenstein and Krasnosielska [8]. The difference between the solution proposed in this paper and those in [8] will be more thoroughly discussed at the end of the paper.The game considered is a generalization, to the case of several players, of the optimal stopping time problem formulated and solved first by Elfving [6] Assume that the set of points of discontinuity of r is finite. Let G n = Y n r(T n ), n ∈ N 0 , whereNote that without loss of generality we can assu...
We consider a multi-person stopping game with players' priorities and multiple stopping. Players observe sequential offers at random or fixed times. Each accepted offer results in a reward. Each player can obtain fixed number of rewards. If more than one player wants to accept an offer, then the player with the highest priority among them obtains it. The aim of each player is to maximize the expected total reward. For the game defined this way, we construct a Nash equilibrium. The construction is based on the solution of an optimal multiple stopping problem. We show the connections between expected rewards and stopping times of the players in Nash equilibrium in the game and the optimal expected rewards and optimal stopping times in the multiple stopping problem. A Pareto optimum of the game is given. It is also proved that the presented Nash equilibrium is a sub-game perfect Nash equilibrium. Moreover, the Nash equilibrium payoffs are unique. We also present new results related to multiple stopping problem.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.