×

zbMATH — the first resource for mathematics

Tamaki, Mitsushi

Compute Distance To:
Author ID: tamaki.mitsushi Recent zbMATH articles by "Tamaki, Mitsushi"
Published as: Tamaki, Mitsushi; Tamaki, M.
Documents Indexed: 51 Publications since 1975

Publications by Year

Citations contained in zbMATH Open

31 Publications have been cited 96 times in 42 Documents Cited by Year
Maximizing the duration of owning a relatively best object. Zbl 0745.62079
Ferguson, T. S.; Hardwick, J. P.; Tamaki, M.
14
1992
Recognizing both the maximum and the second maximum of a sequence. Zbl 0443.60040
Tamaki, M.
10
1979
Sum the multiplicative odds to one and stop. Zbl 1201.60039
Tamaki, Mitsushi
9
2010
An explicit formula for the optimal gain in the full-information problem of owning relatively best object. Zbl 1097.60026
Mazalov, Vladimir V.; Tamaki, Mitsushi
6
2006
A full-information best-choice problem with finite memory. Zbl 0612.60043
Tamaki, Mitsushi
5
1986
Optimal stopping on trajectories and the ballot problem. Zbl 1002.60035
Tamaki, Mitsushi
5
2001
A secretary problem with uncertain employment and best choice of available candidates. Zbl 0741.90090
Tamaki, Mitsushi
3
1991
An optimal parking problem. Zbl 0494.90083
Tamaki, Mitsushi
3
1982
The secretary problem with optimal assignment. Zbl 0546.90065
Tamaki, Mitsushi
3
1984
Choosing either the best or the second best when the number of applicants is random. Zbl 1052.60007
Kawai, M.; Tamaki, M.
3
2003
Optimal choice of the best available applicant in full-information models. Zbl 1192.60067
Tamaki, Mitsushi
3
2009
Duration problem with multiple exchanges. Zbl 1274.60134
Pearce, Charles E. M.; Szajowski, Krzysztof; Tamaki, Mitsushi
3
2012
A secretary problem with uncertain employment when the number of offers is restricted. Zbl 0873.90108
Ano, Katsunori; Tamaki, Mitsushi; Hu, MuCi
2
1996
A secretary problem with double choices. Zbl 0424.60054
Tamaki, Mitsushi
2
1979
Secretary problem with uncertain employment when backward solicitation is permitted. Zbl 0424.60055
Tamaki, Mitsushi
2
1979
Optimal selection with two choices - full information case. Zbl 0448.90074
Tamaki, Mitsushi
2
1980
Shelf life of candidates in the generalized secretary problem. Zbl 1380.91105
Szajowski, Krzysztof; Tamaki, Mitsushi
2
2016
Adaptive approach to some stopping problems. Zbl 0577.60042
Tamaki, Mitsushi
2
1985
A generalized problem of optimal selection and assignment. Zbl 0614.90072
Tamaki, Mitsushi
2
1986
A Bayesian approach to the best-choice problem. Zbl 0668.90046
Tamaki, Mitsushi
2
1988
Optimal stopping rule for the no-information duration problem with random horizon. Zbl 1287.60051
Tamaki, Mitsushi
2
2013
Maximizing the probability of stopping on any of the last \(m\) successes in independent Bernoulli trials with random horizon. Zbl 1228.60053
Tamaki, Mitsushi
2
2011
A probabilistic proof of an identity related to the Stirling number of the first kind. Zbl 1209.60007
Tamaki, Mitsushi
1
2009
Multiple choice problems related to the duration of the secretary problem. Zbl 0939.90512
Tamaki, Mitsushi; Pearce, Charles E. M.; Szajowski, Krzysztof
1
1998
A full-information best-choice problem with allowance. Zbl 1095.60504
Tamaki, Mitsushi; Shanthikumar, J. George
1
1996
Duration problem on trajectories. Zbl 1123.60025
Mazalov, Vladimir V.; Tamaki, Mitsushi
1
2007
Urn sampling distributions giving alternate correspondences between two optimal stopping problems. Zbl 1351.60051
Tamaki, Mitsushi
1
2016
Optimal stopping in the parking problem with U-turn. Zbl 0647.90100
Tamaki, Mitsushi
1
1988
On the optimal parking problem in which spaces appear randomly. Zbl 0497.60038
Sakaguchi, Minoru; Tamaki, Mitsushi
1
1982
A random arrival time best-choice problem with uniform prior on the number of arrivals. Zbl 1216.60038
Tamaki, Mitsushi; Wang, Qi
1
2010
On the optimal stopping problems with monotone thresholds. Zbl 1336.60080
Tamaki, Mitsushi
1
2015
Shelf life of candidates in the generalized secretary problem. Zbl 1380.91105
Szajowski, Krzysztof; Tamaki, Mitsushi
2
2016
Urn sampling distributions giving alternate correspondences between two optimal stopping problems. Zbl 1351.60051
Tamaki, Mitsushi
1
2016
On the optimal stopping problems with monotone thresholds. Zbl 1336.60080
Tamaki, Mitsushi
1
2015
Optimal stopping rule for the no-information duration problem with random horizon. Zbl 1287.60051
Tamaki, Mitsushi
2
2013
Duration problem with multiple exchanges. Zbl 1274.60134
Pearce, Charles E. M.; Szajowski, Krzysztof; Tamaki, Mitsushi
3
2012
Maximizing the probability of stopping on any of the last \(m\) successes in independent Bernoulli trials with random horizon. Zbl 1228.60053
Tamaki, Mitsushi
2
2011
Sum the multiplicative odds to one and stop. Zbl 1201.60039
Tamaki, Mitsushi
9
2010
A random arrival time best-choice problem with uniform prior on the number of arrivals. Zbl 1216.60038
Tamaki, Mitsushi; Wang, Qi
1
2010
Optimal choice of the best available applicant in full-information models. Zbl 1192.60067
Tamaki, Mitsushi
3
2009
A probabilistic proof of an identity related to the Stirling number of the first kind. Zbl 1209.60007
Tamaki, Mitsushi
1
2009
Duration problem on trajectories. Zbl 1123.60025
Mazalov, Vladimir V.; Tamaki, Mitsushi
1
2007
An explicit formula for the optimal gain in the full-information problem of owning relatively best object. Zbl 1097.60026
Mazalov, Vladimir V.; Tamaki, Mitsushi
6
2006
Choosing either the best or the second best when the number of applicants is random. Zbl 1052.60007
Kawai, M.; Tamaki, M.
3
2003
Optimal stopping on trajectories and the ballot problem. Zbl 1002.60035
Tamaki, Mitsushi
5
2001
Multiple choice problems related to the duration of the secretary problem. Zbl 0939.90512
Tamaki, Mitsushi; Pearce, Charles E. M.; Szajowski, Krzysztof
1
1998
A secretary problem with uncertain employment when the number of offers is restricted. Zbl 0873.90108
Ano, Katsunori; Tamaki, Mitsushi; Hu, MuCi
2
1996
A full-information best-choice problem with allowance. Zbl 1095.60504
Tamaki, Mitsushi; Shanthikumar, J. George
1
1996
Maximizing the duration of owning a relatively best object. Zbl 0745.62079
Ferguson, T. S.; Hardwick, J. P.; Tamaki, M.
14
1992
A secretary problem with uncertain employment and best choice of available candidates. Zbl 0741.90090
Tamaki, Mitsushi
3
1991
A Bayesian approach to the best-choice problem. Zbl 0668.90046
Tamaki, Mitsushi
2
1988
Optimal stopping in the parking problem with U-turn. Zbl 0647.90100
Tamaki, Mitsushi
1
1988
A full-information best-choice problem with finite memory. Zbl 0612.60043
Tamaki, Mitsushi
5
1986
A generalized problem of optimal selection and assignment. Zbl 0614.90072
Tamaki, Mitsushi
2
1986
Adaptive approach to some stopping problems. Zbl 0577.60042
Tamaki, Mitsushi
2
1985
The secretary problem with optimal assignment. Zbl 0546.90065
Tamaki, Mitsushi
3
1984
An optimal parking problem. Zbl 0494.90083
Tamaki, Mitsushi
3
1982
On the optimal parking problem in which spaces appear randomly. Zbl 0497.60038
Sakaguchi, Minoru; Tamaki, Mitsushi
1
1982
Optimal selection with two choices - full information case. Zbl 0448.90074
Tamaki, Mitsushi
2
1980
Recognizing both the maximum and the second maximum of a sequence. Zbl 0443.60040
Tamaki, M.
10
1979
A secretary problem with double choices. Zbl 0424.60054
Tamaki, Mitsushi
2
1979
Secretary problem with uncertain employment when backward solicitation is permitted. Zbl 0424.60055
Tamaki, Mitsushi
2
1979

Citations by Year