Resource allocation involves deciding how to divide a resource of limited availability among multiple demands in a way that optimizes current objectives. In this brief paper we focus on one type of distributed resource allocation problem where via an imperfect communication network multiple processors can share the load presented by multiple task types. We introduce asynchronous “cooperative” r...

Supply chain management (SCM) is not always concerned with optimal solutions conventionally in terms of product allocation. Virtual market based supply chain operation solves the product allocation problem by distributing the scheduled resources based on the agent interactions in the market. We formulate supply chain model as a discrete resource allocation problem under dynamic environment, and...

We consider a two-server queueing system in which the servers choose their service rate based on the demand and holding cost allocation scheme offered by the demand generating entity. We provide an optimal holding cost allocation scheme that leads to the maximum possible service rate for each of a pooled and a split system. Our results suggest that careful allocation of holding costs can create...

We consider private good economies with single-plateaued preferences. We show that the uniform rule is the only allocation rule satisfying indifference (in terms of welfare), strategy-proofness and no-envy. Indifference (in terms of welfare) means that if one allocation is recommended, then another allocation is recommended if and only if all agents are indifferent between these allocations.  ...

Two extensions are formulated of the analysis of the allocation of decision rights in Hendrikse and Veerman (2001). First, the incomplete contracts in their article can be viewed as simple long-term contracts, i.e. it is not allowed to make the allocation of authority contingent on the circumstances. Contingent long-term contracts are now considered. Second, another aspect of decision rights is...

This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation termination. We propose several algorithms with various worst-case and average-case time complexities, and evaluate their computation elapse times.  2005 Elsevier B.V. All rights reserved.

We prove NP-completeness of deciding the existence of an economic equilibrium in so-called house allocation markets. House allocation markets are markets with indivisible goods in which every agent holds exactly one copy of some good.  2003 Elsevier B.V. All rights reserved.

We examine a housing market with price controls and show how the allocation problem can be solved through a price system. We demonstrate that the auction of Talman and Yang (2008) always generates a core allocation, thus resulting in a Pareto efficient and stable outcome. © 2015 Elsevier B.V. All rights reserved.