Online algorithms are central to solving resource allocation and matching challenges in dynamic environments where decisions must be made without complete knowledge of future events. Research in this ...

A variety of well-known facility location and location-allocation models are shown to be equivalent to, and therefore solvable as, generalized assignment problems (GAP's). (The GAP is a 0-1 ...

This paper studies an allocation problem with multiple object assignments, indivisible objects, no endowments and no monetary transfers. Agents have complete, transitive and strict preferences over ...

Capital risk allocation is an important problem in corporate, financial and insurance risk management. There are two theoretical aspects to this problem. The first aspect consists of choosing a risk ...