Sciweavers

166 search results - page 13 / 34
» On Allocating Goods to Maximize Fairness
Sort
View
AMMA
2009
Springer
14 years 2 months ago
Fair Package Assignment
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...
Sébastien Lahaie, David C. Parkes
INFOCOM
2006
IEEE
14 years 1 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— 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 ...
Michael J. Neely
OSDI
2000
ACM
13 years 9 months ago
Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors
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...
Abhishek Chandra, Micah Adler, Pawan Goyal, Prasha...
ICC
2007
IEEE
158views Communications» more  ICC 2007»
14 years 1 months ago
Cooperative Game Theory for Distributed Spectrum Sharing
— 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. ...
AMMA
2009
Springer
14 years 2 months ago
Auctions with Dynamic Populations: Efficiency and Revenue Maximization
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...
Maher Said