Many algorithms have been developed for the optimal solution of the asymmetric travelling salesman problem: the most efficient ones are based on the subtour elimination approach. This paper presents a breadth-first branch and bound algorithm which differs from the method of Smith, Srinivasan and...

This paper considers the problem of allocating N indivisible objects among N agents according to their preferences when transfers are not allowed, and studies the tradeoff between fairness and efficiency in the class of strategy-proof mechanisms. The main finding is that for strategy-proof...

This volume was prepared by Susanne Link during her stay at the Ludwig-Maximilians-University of Munich and the Department of Human Capital and Innovation of the Ifo Institute of Economic Research. It was accepted as a doctoral thesis by the Economics Departure of the University of Munich in...