The invention concerns a method for a passenger-allocation in a multi-deck elevator group, the decks of which defining elevator cars, respectively, being stacked above each other and being mounted in a car frame to be moved synchronously in an elevator shaft. The method is performed by a control unit to dispatch the elevator cars for serving any passenger call which can be entered as a landing call or a car call, wherein a call can create a number of allocation proposals calculated by means of an optimization algorithm carried out by the control unit for dispatching an elevator to a passenger call. The invention is characterized in that said allocation proposals are then processed in a routing algorithm defining one serving deck to be taken for the allocation of a specific call, which routing algorithm is restarted either for any further incoming call independent of whether said further incoming call is creating new elevator allocation proposal(s) or when a reallocation timeout has passed. The invention further relates to a computer program carrying out the inventive method.