Zobrazeno 1 - 10
of 207
pro vyhledávání: '"Jones, Brant"'
Autor:
Ducey, Joshua E., Engelthaler, Lauren, Gathje, Jacob, Jones, Brant, Pfaff, Izzy, Plute, Jenna
For integers $0 \leq \ell \leq k_{r} \leq k_{c} \leq n$, we give a description for the Smith group of the incidence matrix with rows (columns) indexed by the size $k_r$ ($k_c$, respectively) subsets of an $n$-element set, where incidence means inters
Externí odkaz:
http://arxiv.org/abs/2310.09227
The game of best choice (or "secretary problem") is a model for making an irrevocable decision among a fixed number of candidate choices that are presented sequentially in random order, one at a time. Because the classically optimal solution is known
Externí odkaz:
http://arxiv.org/abs/2107.04872
Publikováno v:
In Advances in Space Research 15 July 2023 72(2):614-622
Autor:
Crews, Madeline, Jones, Brant, Myers, Kaitlyn, Taalman, Laura, Urbanski, Michael, Wilson, Breeann
The game of best choice, also known as the secretary problem, is a model for sequential decision making with many variations in the literature. Notably, the classical setup assumes that the sequence of candidate rankings is uniformly distributed over
Externí odkaz:
http://arxiv.org/abs/1903.01821
Autor:
Jones, Brant
The game of best choice (also known as the secretary problem) is a model for sequential decision making with a long history and many variations. The classical setup assumes that the sequence of candidate rankings are uniformly distributed. Given a st
Externí odkaz:
http://arxiv.org/abs/1902.10163
Autor:
Jones, Brant
We study a variation of the game of best choice (also known as the secretary problem or game of googol) under an additional assumption that the ranks of interview candidates are restricted using permutation pattern-avoidance. We develop some general
Externí odkaz:
http://arxiv.org/abs/1812.00963
Autor:
Fowlkes, Aaron, Jones, Brant
Publikováno v:
Involve 12 (2019) 647-658
We study a variation of the game of best choice (also known as the secretary problem or game of googol) under an additional assumption that the ranks of interview candidates are restricted using permutation pattern-avoidance. We describe the optimal
Externí odkaz:
http://arxiv.org/abs/1810.09887
Publikováno v:
In Acta Astronautica January 2022 190:365-376
Publikováno v:
In Discrete Mathematics January 2022 345(1)
Autor:
Jones, Brant
We consider the set of affine permutations that avoid a fixed permutation pattern. Crites has given a simple characterization for when this set is infinite. We find the generating series for this set using the Coxeter length statistic and prove that
Externí odkaz:
http://arxiv.org/abs/1501.03087