#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1996

2016

- This year (0)
- Last 5 years (1)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

The full-information secretary problem in which the objective is to minimize the expected rank is seen to have a value smaller than 7/3 for all n (the number of options). This can be achieved by a simple memoryless threshold rule. The asymptotically optimal value for the class of such rules is about 2.3266. For a large finite number of options, the optimal… (More)

- F. THOMAS BRUSS, James B. MacQueen
- 1996

We consider a generalization of the house-selling problem to selling k houses. Let the offers, X 1 , X 2 ,. . ., be independent, identically distributed k-dimensional random vectors having a known distribution with finite second moments. The decision maker is to choose simultaneously k stopping rules, N 1 ,. .. , N k , one for each component. The payoff is… (More)

- F.Thomas Bruss, Guy Lou, John W.Turnerz
- 2002

- F. Thomas Bruss, Michael Drmota, Guy Louchard
- Algorithmica
- 1998

Two decision-makers A and B observe sequentially a given permutation of n uniquely rankable options. A and B have one choice each (without recall) and both must make a choice. At each step only the relative ranks are known, and A has the priority of choice. At the end the (absolute) ranks are compared and the winner is the one who has chosen the better… (More)

Consider N balls that are distributed among V urns according to some distribution G. We do not see the outcome and now have to place one ball into one urn with the goal of maximizing the probability that it will be the left-most urn containing a single ball. How should we proceed? This is the urn-model translation of an interesting problem posed by an… (More)

known continuous distribution function. Robbins' problem is to find a sequential stopping rule without recall which minimizes the expected rank of the selected observation. An upper bound (obtained by memoryless threshold rules) and a procedure to obtain lower bounds of the value are known, but the essence of the problem is still unsolved. The difficulty is… (More)

- F. Thomas Bruss, Guy Louchard, Mark Daniel Ward
- ACM Trans. Algorithms
- 2009

We consider auctions in which the winning bid is the smallest bid that is unique. Only the upper-price limit is given. Neither the number of participants nor the distribution of the offers are known, so that the problem of placing a bid to win with maximum probability looks, a priori, ill-posed. Indeed, the essence of the problem is to inject a (final)… (More)

- F. Thomas Bruss
- 2002

This talk presents an attempt to unify sequential search and selection problems in the light of optimal stopping problems on strings. The basic model is as follows: Strings are generated by sequences of letters or other codes produced by independent draws from a given alphabet or another source. The law of drawing different letters or expressions may be… (More)

1 The problem The following dice game has been partially analyzed in the litterature. A player rolls a fair die successively (this is a round), accumulating the scores so long as the outcome 1 does not occur. But should a 1 arise, the accumulated score is wiped out, and the turn ends. At any stage after a roll, she can choose to end her turn and bank her… (More)

- F. Thomas Bruss, Guy Louchard
- Discrete Mathematics & Theoretical Computer…
- 2016

- ‹
- 1
- ›