What people are saying - Write a review
We haven't found any reviews in the usual places.
algorithm Amazons analysis applicant approximation asymptotic bivariate Bruss c-convex order cards complete lattice components compute consider convex corresponding defined denote density distribution efficient coupling eigenvalue eigenvector equation example extended maximum likelihood Fiedler vector finite fixed follows gambler given graph drawing Hence independent inequality infimum integral interval kernel Kertz lattice Leeuw Lemma linear loss function Lucien Le Cam Markov chain martingale Math matrix maximal maximum likelihood estimates method metric space minimax-strategy minimize move multivariate observe obtain optimal policy optimal stopping optimal stopping rule option pair paper parameter player positive Prob probability measure Proof prophet queue random variables ratio result sample second eigenvector secretary problem Section sequence Sequential estimation Siegmund solution square Statistics stochastic order stopping rule strategy submartingale subsystems supremum temperature Theorem thermographs uniform integrability upper bound vertices zero zp(x
Page 245 - G. Di Battista. P. Eades. R. Tamassia. and IG Tollis. Graph Drawing: Algorithms for the Visualization of Graphs.
Page 245 - BERRY, B. HENDRICKSON, AND P. RAGHAVAN, Sparse matrix reordering schemes for browsing hypertext, in Lectures in Applied Mathematics Vol.
Page 248 - A nonlinear mapping for data structure analysis," IEEE Transactions on Computers C-18, pp.
Page 68 - Additive comparisons of stop rule and supremum expectations of uniformly bounded independent random variables, Proc.
Page 53 - Two players (the ,, prophet" and the gambler) observe a uniformly bounded stochastic process (Xs)seS- The prophet's maximal expected gain E(sups€S Xs) is compared with the maximal expected gain supT EXT of the gambler who is restricted to use stopping rules T. Games against a prophet are two-person zero-sum games where the prophet picks the distribution and the gambler chooses a stopping rule. To obtain minimax-theorems for these games one has to admit mixed or randomized stopping rules. It is...
Page 51 - The Existence of Good Markov Strategies for Decision Processes with General Payoffs,
Page 81 - A secretary problem with uncertain employment when the number of offers is restricted.
Page 292 - Cabilio, P. and Robbins, H. (1975). Sequential estimation of p with squared relative error loss.