scientific article; zbMATH DE number 3936976

From MaRDI portal
Publication:3710348





Two competitors dispose of two sets of objects taking independently decisions under the conditions of the secretary problem. If one of the players stops, the other player is not informed of this fact and continues playing. A player is called winner if he stops at the best object of his set. The payoff functions may be defined in different ways. Two models are considered in this paper. One of them defines the payoff of each player as the probability that he becomes the first winner. In the second, the payoff of a player is 1 if he is the single winner, 1/2 if both players win and 0 otherwise. In addition to these two models some probabilistic versions in which the sizes of the sets of objects are random variables uniformly distributed over \(\{\) 1,2,...,n\(\}\) where n is very large are considered.












This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3710348)