The following pages link to Mitsushi Tamaki (Q450750):
Displaying 47 items.
- Duration problem with multiple exchanges (Q450751) (← links)
- (Q1003031) (redirect page) (← links)
- Optimal computer memory allocation for the Poisson flows (Q1003033) (← links)
- Shelf life of candidates in the generalized secretary problem (Q1694784) (← links)
- (Q2742676) (← links)
- (Q2759602) (← links)
- On the optimal stopping problems with monotone thresholds (Q2794716) (← links)
- Optimal stopping rule for the full-information duration problem with random horizon (Q2806344) (← links)
- Urn sampling distributions giving alternate correspondences between two optimal stopping problems (Q2830878) (← links)
- A Random Arrival Time Best-Choice Problem with Uniform Prior on the Number of Arrivals (Q3059307) (← links)
- Maximizing the probability of stopping on any of the last <i>m</i> successes in independent Bernoulli trials with random horizon (Q3173004) (← links)
- The Secretary Problem with Optimal Assignment (Q3337949) (← links)
- Optimal Choice of the Best Available Applicant in Full-Information Models (Q3402060) (← links)
- Duration problem on trajectories (Q3429341) (← links)
- (Q3637888) (← links)
- Adaptive approach to some stopping problems (Q3697988) (← links)
- A full-information best-choice problem with finite memory (Q3753199) (← links)
- Optimal stopping in the parking problem with U-turn (Q3792512) (← links)
- A Bayesian Approach to the Best-Choice Problem (Q3821926) (← links)
- A SECRETARY PROBLEM WITH DOUBLE CHOICES (Q3859033) (← links)
- (Q3859034) (← links)
- (Q3859035) (← links)
- (Q3891494) (← links)
- (Q3895260) (← links)
- An optimal parking problem (Q3958293) (← links)
- (Q3962251) (← links)
- A Secretary Problem with Uncertain Employment and Best Choice of Available Candidates (Q3976912) (← links)
- (Q4081027) (← links)
- (Q4225599) (← links)
- (Q4253437) (← links)
- (Q4329883) (← links)
- A SECRETARY PROBLEM WITH UNCERTAIN EMPLOYMENT WHEN THE NUMBER OF OFFERS IS RESTRICTED (Q4345048) (← links)
- (Q4363268) (← links)
- Optimal stopping on trajectories and the ballot problem (Q4537302) (← links)
- (Q4538152) (← links)
- (Q4538177) (← links)
- (Q4548787) (← links)
- (Q4705043) (← links)
- A Generalized Problem of Optimal Selection and Assignment (Q4723566) (← links)
- Sum the Multiplicative Odds to One and Stop (Q4933198) (← links)
- (Q4935236) (← links)
- (Q4937142) (← links)
- (Q4948261) (← links)
- A Note on the Distribution of the Time of the First <i>k</i>-Record Index (Q4950716) (← links)
- Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon (Q5396590) (← links)
- A Full-Information Best-Choice Problem with Allowance (Q5485354) (← links)
- An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object (Q5488991) (← links)
