We investigate the existence of a spanning local tournament with possi
bly high connectivity in a highly connected locally semicomplete digra
ph. It is shown that every (3k - 2)-connected locally semicomplete dig
raph contains a k-connected spanning local tournament. This improves t
he result of Bang-Jensen and Thomassen for semicomplete digraphs and o
f Bang-Jensen [1] for locally semicomplete digraphs.