We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
We study a problem of dynamic allocation without money. Agents have
arrivals and departures and strict preferences over items. Strategyproofness
requires the
use of an arriva...
The problem of interest is how to dynamically allocate wireless access services in a competitive market which implements a take-it-or-leave-it allocation mechanism. In this paper ...
George Lee, Steven Bauer, Peyman Faratin, John Wro...
One of the main challenges in Grid computing is efficient allocation of resources (CPU-hours, network bandwidth, etc.) to the tasks submitted by users. Due to the lack of centrali...
This paper addresses a problem in supply chain management that how scarce resources can be efficiently allocated among competing interests. We present a formal model of allocation...
— In this paper, we propose a new resource allocation mechanism which is designed to improve the multiuser detection of wireless network diversity multiple access (NDMA) protocol...
Ramiro Samano-Robles, Mounir Ghogho, Desmond C. Mc...
We study the problem of allocating a single item repeatedly among multiple competing agents, in an environment where monetary transfers are not possible. We design (Bayes-Nash) inc...