The best choice problem for a union of two linear orders with common maximum

We find optimal stopping times for the secretary problem considered on partially ordered sets that are unions of two independent finite linear orders that have a common best element. We also determine the optimal probability of success, i.e. choosing the best element, and the asymptotic value of this probability and a certain threshold behavior of the optimal stopping times when the number of elements in our set tends to infinity.