Weighted Games of Best Choice

DOI10.1137/19M1266587zbMath1431.91059arXiv1902.10163MaRDI QIDQ5215902

Brant C. Jones

Publication date: 13 February 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.10163

zbMATH Keywords

permutation statisticssecretary problempositional strategy

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40) Combinatorial games (91A46) Probabilistic games; gambling (91A60) Decision theory for games (91A35)

Related Items (3)

Finding the second-best candidate under the Mallows model ⋮ Query-based selection of optimal candidates under the Mallows model ⋮ Strategy-indifferent games of best choice

Uses Software

• DLMF

Cites Work

• Unnamed Item
• Unnamed Item
• Who solved the secretary problem
• Strategies in the secretary problem
• Logarithmic combinatorial structures: A probabilistic approach
• Avoiding patterns and making the best choice
• Positional strategies in games of best choice
• Decision Making: A Golden Rule
• Extremal processes, secretary problems and the 1/e law
• The Secretary Problem and Its Extensions: A Review
• A generalization of the classical secretary problem: dependent arrival sequences
• Lannes’ T functor on injective unstable modules and Harish-Chandra restriction
• The probability of avoiding consecutive patterns in the Mallows distribution

This page was built for publication: Weighted Games of Best Choice