Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/147638
Authors: 
Elendner, Thomas
Femerling, R.
Year of Publication: 
2003
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 577
Abstract: 
In this paper we consider the problem of allocating scarce resources in a divisionalized company; the resources are made available by the headquarters and requested by profit centers (PCs). This problem was observed at a large german insurance company (LAGIC). Currently, the resources are allocated for free; for the future, LAGIC proposes to use an iterative allocation mechanism to solve the allocation problem. Alternatively, we present a combinatorial auction-based allocation mechanism. Within experimental tests the performance of these two mechanisms is analyzed. To this end, instances are generated motivated by the problem size and structure occurring at LAGIC.
Subjects: 
Resource allocation
in-house services
combinatorial auctions
efficient allocation
winner determination
multidimensional binary knapsack problem
instance generator
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.