We consider the problem of fair allocation in the package assignment model, where a set of indivisible items, held by single seller, must be efficiently allocated to agents with q...
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
In this paper, we present surplus fair scheduling (SFS), a proportional-share CPU scheduler designed for symmetric multiprocessors. We first show that the infeasibility of certain...
— There is a need for new spectrum access protocols that are opportunistic, flexible and efficient, yet fair. Game theory provides a framework for analyzing spectrum access, a ...
Juan E. Suris, Luiz A. DaSilva, Zhu Han, Allen B. ...
ABSTRACT: We examine an environment where goods and privately informed buyers arrive stochastically to a market. A seller in this setting faces a sequential allocation problem with...