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...

We investigate the implications of welfare lower bounds together with queue-efficiency and strategyproofness in the context of the queueing problem. As a consequence, we provide alternative characterizations of the k-pivotal mechanisms (Mitra and Mutuswami [13]). First, we introduce the...