Coincidence of Cooperative Game Theoretic Solutions in the Appointment Problem

The fixed-route traveling salesman problem with appointments, simply the appointment problem, is concerned with the following situation. Starting from home, a traveller makes a scheduled visit to a set of sponsors and returns home. If a sponsor in the route cancels her appointment, the traveller returns home and waits for the next appointment. We are interested in finding a way of dividing the total traveling cost among sponsors in the appointment problem by applying solutions developed in the cooperative game theory. We show that the well-known solutions of the cooperative game theory, the Shapley value, the nucleolus (or the prenucleolus), and the t -value, coincide under a mild condition onthe traveling cost.